Abstract
Processor scheduling in multiprocessor systems can be divided into two steps. The first step, referred to as the processor allocation problem, is to determine the number of processors to be allocated to a job so as to maximize the system throughput and processor utilization. This depends both on the load on the system and on certain inherent characteristics of the job — most importantly how efficiently the job can utilize a given number of processors. The second step, referred to as the processor assignment problem, assigns processors to the parallel tasks in a job so as to minimize the execution time on the allocated processors. The processor assignment depends on the number of processor allocated, the processor interconnection structure, and the precedence relationship among the tasks in the job. This paper reviews the various issues in the above two steps of the processor scheduling.
This research was partially supported in part by the Italian CNR “Progetto Finalizzato Sistemi Informatici e Calcolo Parallelo” under Grant 89.00055.69, by the MURST 40 % Project, and by the National Science Foundation grant CCR-9002351.
Preview
Unable to display preview. Download preview PDF.
References
D. L. Eager, J. Zahorjan, and E. D. Lazowska, Speedup versus Efficiency in Parallel Systems, IEEE Transactions on Computers, Volume 38, Number 3, March 1989, pp.408–423.
E. G. Coffman and P. J. Denning, Operating System Theory, Prentice-Hall Inc., 1973.
L. W. Dowdy, On the Partitioning of Multiprocessor Systems, Technical Report, Department of Computer Science, Vanderbilt University, March 1988.
D. Ghosal, G. Serazzi, and S. K. Tripathi, Processor Working Set and Its Use in Scheduling Multiprocessor Systems, IEEE Transactions on Software Engg. May, 1991.
W. D. Hillis, The Connection Machine, MIT Press, Cambridge, Mass., 1985.
M. Kumar, Measuring parallelism in computation intensive scientific/engineering applications, IEEE Transactions on Computers Volume 37, Number 9, September 1988, pp. 1088–1098.
S. T. Leutenegger and M. K. Vernon, The Performance of Multiprogrammed Multiprocessor Scheduling Policies, Proc. 1990 ACM SIGMETRICS Conf., May 1990.
M. R. Leuze, L. W. Dowdy and K. H. Park, Multiprogramming a Distributed-Memory Multiprocessor, Journal of Concurrency & Practice, 1989.
R. D. Nelson and M. S. Squillante, Analysis of Contention in Multiprocessor Scheduling, IBM Technical Report, 109.7, November 1989.
R. D. Nelson and D. Towsley, A Performance Evaluation of Several Priority Policies for Parallel Processing Systems, IBM Technical Report, November 1989.
MASPAR — The massively parallel architecture, MASPAR Inc. 1990.
S. Majumdar, D. L. Eager, and R. Bunt, Scheduling in Multiprogrammed Parallel Systems, ACM SIGMETRICS, 1988, pp. 104–113.
K. H. Park and L. W. Dowdy, Dynamic Partitioning of Multiprocessor Systems, International Journal of Parallel Programming, 1, 1989.
Y. Saad and M. H. Schultz, Topological Properties of Hypercubes, IEEE Transactions on Computers, Vol. 37, No.7, July 1988, pp. 867–872.
K. C. Sevcik, Characterization of Parallelism in Applications and Their Use in Scheduling, ACM SIGMETRICS, 1989, pp. 171–180.
J. Zahorjan and Cathy McCann, Priority Scheduling in Shared Memory Multiprocesors, Proc. 1990 ACM SIGMETRICS Conf., May 1990.
C. D. Polychronopoulos and U. Banerjee, Processor Allocation for Horizontal and Vertical Parallelism and Related Speedup Bounds, IEEE Transactions on Computers, c-36(4), pp. 410–420, April 1987.
S. P. Lo and V. D. Gligor, Properties of Multiprocessor Scheduling Algorithms, Proc. of Int'l Conf. on Parallel Processing, pp. 867–870, August 1987.
H. Kasahara and S. Narit, Practical Multiprocessor Scheduling Algorithms for Efficient Parallel Processing, IEEE Transactions on Computers, c-33(11), Nov. 1984, pp. 1023–1029.
W. H. Tsai, Graphic Matching Problems: A Survey and Tutorial. Proceedings of the 1st Conference on Computer Algorithm, Hinschu, Taiwan R.O.C, July 1982, pp. 16.1–16.66.
S. Y. Lee and J. K. Aggarwal, A Mapping Strategy for Parallel Processing, IEEE Transactions on Computers, c-36(4), April 1987, pp. 433–442.
C. C. Shen and W. H. Tsai, A Graph Matching Approach to Optimal Task Assignment in Distributed COmputing Systems Using a Minmax Criterion, IEEE Transactions on Computers, c-34(3), March 1985, pp. 197–203.
S. H. Bokhari, On the Mapping Problem, IEEE Transactions on Computers, c-30(3), March 1981, pp. 550–557.
M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to Theory of NP-Completeness. San Francisco, CA, Freeman Publishing Co., 1979.
T. C. Hu. Parallel Sequencing and Assembly Line Problem, Operations Research, Vol. 9, Nov. 1961, pp. 841–848.
Win-Tsung Lo, D. Ghosal and S. K. Tripathi, Task Allocation on Hypercube Multiprocessor, High Performance Computer Architecture, France, 1990.
J. K. Ousterhout, Scheduling techniques for concurrent systems. In Third International Conference on Distributed Computing Systems, 1982, pp.22–30.
A. Tucker and A. Gupta, Process control and scheduling issues for multiprogrammed shared memory multiprocessors, In Proceedings of the 12th ACM Symposium on Operating Systems Principle, 1989, pp. 159–166.
K. Dussa, B. Carslon, L. Dowdy, and K-H. Park, Dynamic Partitioning in a Transputer Environment, ACM SIGMETRICS Conference, May 1990.
D. Ghosal, A. Mukherjee, R. Thurimella, and Y. Yesha, Mapping Task Trees onto a Linear Array, 1991 Int'l Conference on Parallel Processing, August 1991.
J. Zahorjan, E. D. Lazaowska, and D. L. Eager, Spinning versus blocking in parallel systems with uncertainty, Technical Report 88-03-01, Department of Computer Science, University of Washington, 1988.
E. D. Lazowska, M. Squillante, Using processor-cache affinity in shared memory multiprocessor scheduling, technical Report, Department of Computer Science, University of Washington, Seattle, June 1989.
E. Gelenbe, D. Ghosal and S. K. Tripathi, Analysis of processor allocation in large multiprocessor systems. In Proc. of the Intl. Conf. on the Performance of Distributed Systems and Integrated Communication Networks, Kyoto, Japan, September 1991.
S. Setia and S. K. Tripathi, An analysis of several processor partitioning policies for parallel computers, Technical Report, CS-TR-2684, University of Maryland, College Park, MD 20741.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tripathi, S.K., Serazzi, G., Ghosal, D. (1992). Processor scheduling in multiprocessor systems. In: Zima, H.P. (eds) Parallel Computation. ACPC 1991. Lecture Notes in Computer Science, vol 591. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55437-8_82
Download citation
DOI: https://doi.org/10.1007/3-540-55437-8_82
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55437-0
Online ISBN: 978-3-540-47073-1
eBook Packages: Springer Book Archive