Abstract
In multiprocessors with static allocation of processes to processors, scheduling can be done locally for each processor. The scheduling strategy may have dramatic effect on the execution time of a parallel program. It is an NP-hard problem to find an optimal schedule, and very little is known of how close the heuristic solutions get.
The major result here is a theorem stating that if certain program parameters, which can be obtained from an execution of the program on a single-processor, are known, the execution time of the optimal schedule can be calculated within a factor equal to the largest number of border processes on one processor. Border processes are processes which communicate with other processors. The program parameters are obtained using a previously developed tool.
Due to the generality of this theorem, the proof is rather complex because it has to cover a large range of situations. The theorem itself, however, is easy to apply, making it possible to compare the performance of different scheduling strategies with the optimal case. The proof also gives important hints on how to design efficient scheduling algorithms for statically allocated programs.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Shahid H. Bokhari,A Comparative Analysis of Static and Dynamic Load Balancing Strategies, In proceedings of the 1986 International Conference on Parallel Processing, pp 1040–1047, August 1986.
E. G. Coffman,Computer and Job-Shop Scheduling Theory, John Wiley & Sons, New York, 1976.
R. L. Graham,Bounds for certain multiprocessor timing anomalies, SIAM Journal of Applied Mathematics, 17, 2 (1969), pp 416–429.
R. L. Graham, E. L. Lawler, J. K. Lenstra and A. H. G. Rinnooy Kan,Optimization and approximation in deterministic sequencing and scheduling: a survey, Annals of Discrete Mathematics, pp 287–326, No 5, 1979.
E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan and D. B. Shmoys,Sequencing and scheduling: Algorithms and complexity, In S. C. Graves, A. H. G. Rinnooy Kan and P. Zipkin, editors.Handbooks in Operations Research and Management Science, Volume 4: Logistics of Production and Inventory. North-Holland, Amsterdam 1989.
Lars Lundberg,Predicting the speedup of parallel Ada programs, In Proceedings of the Ada Europe Conference, Amsterdam, June, 1992.
Lars Lundberg,Static process allocation using information about program behavior, In Proceedings of 24'th Hawaii Conference on System Sciences, Hawaii, January, 1991.
Lars Lundberg,Performance bounds on multiprocessor scheduling strategies for chain structured programs, Technical Report, Dept. of Comp. Eng., Lund University, P.O Box 118, S-22100, Sweden, April, 1992.
Tin-Fook Ngai,Run-Time Resource Management in Concurrent Systems, Ph.D thesis, Computer Systems Laboratory, Stanford University, January 1992, Also available as Technical report No. CSL-TR-92-504, Stanford University.
R. Rajkumar, L. Sha and J. P. Lehoczky,Real-time synchronization protocols for multiprocessors, in Proceedings of the IEEE Real-Time Systems Symposium, Los Alamitos, pp 259–269, 1988.
Lui Sha and John B. Goodenough,Real-time scheduling theory and Ada, in IEEE Computer, April 1990.
André M. van Tilborg and Larry D. Wittie,Wave scheduling -decentralized scheduling of task forces in multicomputers, IEEE Transactions on Computers, Vol C-33, No 9, September, 1984.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Lundberg, L. Performance bounds on multiprocessor scheduling strategies for statically allocated programs. BIT 33, 190–213 (1993). https://doi.org/10.1007/BF01989744
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01989744