This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Lower Bound on the Number of Processors and Time for Scheduling Precedence Graphs with Communication Costs
December 1990 (vol. 16 no. 12)
pp. 1390-1401

A lower bound on the number of processors and finish time for the problem of scheduling precedence graphs with communication costs is presented. The notion of the earliest starting time of a task is formulated for the context of lower bounds. A lower bound on the completion time is proposed. A task delay which does not increase the earliest completion time of a schedule is defined. Each task can then be scheduled within a time interval without affecting the lower bound performance on the finish time. This leads to definition of a new lower bound on the number of processors required to process the task graph. A derivation of the minimum time increase over the earliest completion time is also proposed for the case of a smaller number of processors. A lower bound on the minimum number of interprocessor communication links required to achieve optimum performance is proposed. Evaluation had been carried out by using a set of 360 small graphs. The bound on the finish time deviates at most by 5% from the optimum solution in 96% of the cases and performs well with respect to the minimum number of processors and communication links.

[1] J.-J. Hwang, Y.-C. Chow, F. D. Anger, and C. Y. Lee, "Scheduling precedence graphs in systems with interprocessor communication times,"SIAM Computing, pp. 244-257, Apr. 1988.
[2] E. G. Coffman and P. J. Denning,Operating Systems Theory. Englewood Cliffs, NJ: Prentice-Hall, 1973.
[3] E. G. Coffman,et al., Eds.,Computer and Job-Shop Scheduling Theory. New York: Wiley, 1976.
[4] M. R. Garey, R. L. Graham, and D. S. Johnson, "Performance guarantee for scheduling algorithms,"Oper. Res., vol. 26, no. 1, pp. 3-21, Jan. 1978.
[5] T. L. Adam, K. M. Chandy, and J. R. Dickson, "A comparison of list schedules for parallel processing systems,"Commun. ACM, vol. 17, no. 12, pp. 685-690, Dec. 1974.
[6] E. B. Fernandez and B. Bussell, "Bounds on the number of processors and time for multiprocessors optimal schedules,"IEEE Trans. Comput., vol. C-22, no. 8, pp. 745-751, Aug. 1973.
[7] H. Kasahara and S. Narita, "Practical multiprocessor scheduling algorithms for efficient parallel processing,"IEEE Trans. Comput., vol. C-33, no. 11, pp. 1023-1029, Nov. 1984.
[8] M. A. Al-Mouhamed, "A multiprocessor system for real-time robotics applications,"J. Microprocessors and Microsyst., vol. 14, no. 5, pp. 276-290, June 1990.
[9] V. J. Rayward-Smith, "UET scheduling with interprocessor communication delays," School Inform. Syst., Univ. East Anglia, Norwich, England, Internal Rep. SYS-C86-06, 1986.

Index Terms:
scheduling; precedence graphs; communication costs; earliest starting time; lower bounds; completion time; task delay; time interval; finish time; task graph; minimum time increase; interprocessor communication links; optimum performance; small graphs; graph theory; scheduling
Citation:
M.A. Al-Mouhamed, "Lower Bound on the Number of Processors and Time for Scheduling Precedence Graphs with Communication Costs," IEEE Transactions on Software Engineering, vol. 16, no. 12, pp. 1390-1401, Dec. 1990, doi:10.1109/32.62447
Usage of this product signifies your acceptance of the Terms of Use.