Scheduling Nonlinear Computational Loads

被引：17

作者：

Hung, Jui Tsun ^{[1
]}

Robertazzi, Thomas G. ^{[2
]}

机构：

[1] SUNY Stony Brook, Dept Comp Sci, Stony Brook, NY 11794 USA

[2] SUNY Stony Brook, Cosine Lab, Dept Elect & Comp Engn, Stony Brook, NY 11794 USA

来源：

IEEE TRANSACTIONS ON AEROSPACE AND ELECTRONIC SYSTEMS | 2008年 / 44卷 / 03期

关键词：

D O I：

10.1109/TAES.2008.4655372

中图分类号：

V [航空、航天];

学科分类号：

08 ; 0825 ;

摘要：

A scheduling model for a tree network is studied where the computation time for each node is nonlinear in the size of the assigned load. Optimal load allocation and speedup for simultaneous load distribution for a quadratic nonlinearity are obtained using simple equations. An iterative solution for sequential load distribution is presented for a nonlinearity of arbitraty power. Superlinear speedup is possible when computational complexity is nonlinear in the size of assigned loads. Aerospace applications include spectrum computation, radar and sensor data processing, and satellite image processing.

引用

页码：1169 / 1182

页数：14