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
关键词
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
相关论文
共 31 条
[1]  
ADLER M, 2003, S PAR ALG ARCH SPAA
[2]  
[Anonymous], IEEE T AERO ELEC SYS
[3]  
[Anonymous], IEEE T SYSTEM MAN A
[4]  
[Anonymous], P INT PAR DISTR PROC
[5]  
[Anonymous], CLUSTER COMPUT
[6]  
[Anonymous], 1996, Scheduling Divisible Loads in Parallel and Distributed Systems
[7]   Collection-aware optimum sequencing of operations and closed-form solutions for the distribution of a divisible load on arbitrary processor trees [J].
Barlas, GD .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1998, 9 (05) :429-441
[8]   BUS-ORIENTED LOAD SHARING FOR A NETWORK OF SENSOR DRIVEN PROCESSORS [J].
BATAINEH, S ;
ROBERTAZZI, TG .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1991, 21 (05) :1202-1205
[9]   Scheduling divisible loads on star and tree networks: Results and open problems [J].
Beaumont, O ;
Casanova, H ;
Legrand, A ;
Robert, Y ;
Yang, Y .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2005, 16 (03) :207-218
[10]   Scheduling divisible workloads on heterogeneous platforms [J].
Beaumont, O ;
Legrand, A ;
Robert, Y .
PARALLEL COMPUTING, 2003, 29 (09) :1121-1152