The Multiprocessor Scheduling of Precedence-Constrained Task Systems in the Presence of Interprocessor Communication Delays

The problem of scheduling precedence-constrained task systems characterized by interprocessor communication delays is addressed. It is assumed that task duplication is permitted. The target machine is a homogenous multiprocessor with an unbounded number of processors. The general problem is known to be NP-hard; however, when communication delays are small relative to task execution times, the C.P.M. based approach of Colin and Chretienne (1991) yields an optimal schedule in polynomial time. Extensions to this method of Colin and Chretienne are presented here, which allow for polynomial-time optimal schedule generation for certain categories of task systems with arbitrary precedence relations, processing times, and communication delays.

[1]  Hesham H. Ali,et al.  An Optimal Algorithm for Scheduling Interval Ordered Tasks with Communication on N Processors , 1995, J. Comput. Syst. Sci..

[2]  C. Hanen,et al.  An approximation algorithm for scheduling dependent tasks on m processors with small communication delays , 1995, Proceedings 1995 INRIA/IEEE Symposium on Emerging Technologies and Factory Automation. ETFA'95.

[3]  Mihalis Yannakakis,et al.  Towards an Architecture-Independent Analysis of Parallel Algorithms , 1990, SIAM J. Comput..

[4]  Ronald L. Graham,et al.  Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.

[5]  David Perry,et al.  Control of input and demand rates in inventory systems of perishable commodities , 1990 .

[6]  Philippe Chrétienne,et al.  C.P.M. Scheduling with Small Communication Delays and Task Duplication , 1991, Oper. Res..

[7]  Kamran Moinzadeh,et al.  An (S - 1, S) Inventory System with Emergency Orders , 1991, Oper. Res..

[8]  H. Kaspi,et al.  Inventory systems of perishable commodities , 1983, Advances in Applied Probability.

[9]  Frank D. Anger,et al.  Scheduling Precedence Graphs in Systems with Interprocessor Communication Times , 1989, SIAM J. Comput..

[10]  David Perry,et al.  Control Policies for Two Classes of Inventory Systems via a Duality-Equivalence Relationship , 1989 .

[11]  Ronald W. Wolff,et al.  Stochastic Modeling and the Theory of Queues , 1989 .

[12]  D. P. Agrawal,et al.  SDBS: a task duplication based optimal scheduling algorithm , 1994, Proceedings of IEEE Scalable High Performance Computing Conference.

[13]  Boontee Kruatrachue,et al.  Static task scheduling and grain packing in parallel processing systems , 1987 .

[14]  Stephen C. Graves,et al.  The Application of Queueing Theory to Continuous Perishable Inventory Systems , 1982 .

[15]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[16]  Philippe Chrétienne.  Tree Scheduling with Communication Delays , 1994, Discret. Appl. Math..

[17]  David Perry,et al.  Rejection rules in theM/G/1 queue , 1995, Queueing Syst. Theory Appl..

[18]  Jan Karel Lenstra,et al.  Recent developments in deterministic sequencing and scheduling: a survey : (preprint) , 1981 .

[19]  Eugene L. Lawler,et al.  Scheduling In and Out Forests in the Presence of Communication Delays , 1996, IEEE Trans. Parallel Distributed Syst..

[20]  Jeffrey D. Ullman,et al.  NP-Complete Scheduling Problems , 1975, J. Comput. Syst. Sci..

[21]  Denis Trystram,et al.  Worst Case Analysis of Lawler's Algorithm for Scheduling Trees with Communication Delays , 1997, IEEE Trans. Parallel Distributed Syst..

[22]  H. Kaspi,et al.  Inventory systems for perishable commodities with renewal input and Poisson output , 1984, Advances in Applied Probability.

[23]  Steven Nahmias,et al.  S-1, S Policies for Perishable Inventory , 1985 .

[24]  Craig C. Sherbrooke,et al.  Metric: A Multi-Echelon Technique for Recoverable Item Control , 1968, Oper. Res..

[25]  Stephen A. Smith.  Optimal Inventories for an (S − 1, S) System with No Backorders , 1977 .

[26]  Garth Isaak,et al.  Scheduling rooted forests with communication delays , 1994 .