S. Majumdar
ABSTRACT
Processor scheduling on multiprocessor systems that simultaneously run concurrent applications is currently not well-understood. This paper reports a preliminary investigation of a number of fundamental issues which are important in the context of scheduling concurrent jobs on multiprogrammed parallel systems. The major motivation for this research is to gain insight into system behaviour and understand the basic principles underlying the performance of scheduling strategies in such parallel systems. Based on abstract models of systems and scheduling disciplines, several high level issues that are important in this context have been analysed.
- Adam et al 74.Adam, T.L., Chandy, K.M., Gonzalez, M.J., "A comparison of List Schedules for Parallel Processing Systems", CACM, 17, 12, 1974, pp. 685 - 690. Google Scholar
Digital Library
- Browne et al 73.Brown, J.C., Chandy, K.M., Hogarth, J., Lee, C.C.-A., "The Effect of Throughput of Multiprocessing in a Multiprogramming Environment", IEEETC, C-22, 8, August 1973, pp. 728 - 735.Google Scholar
- Coffman and Denning 73.Coffman E.G., Denning, P.J., Operating Systems Theory, Prentice Hall, 1973. Google ScholarDigital Library
- Eager et al 86.Eager, D.L., Zahorjan, J., Lazowska, E.D., "Speedup Versus Efficiency in Parallel Systems", Research Report 86-12, Department of Computational Science, University of Saskatchewan, Saskatoon, Canada, {to appear in IEEETC}.Google Scholar
- Ferrari 78.Ferrari, D., Computer Systems Performance Evaluation, Prentice-Hall, 1978.Google Scholar
- Fernandez and Bussel 73.Fernandez, E.B., Bussel, B., "Bounds on the Number of Processors and Time for Multiprocessor Optimal Schedules", IEEETC, C-22, 8, August 1973, pp. 745 - 751.Google ScholarDigital Library
- Graham 69.Graham, R.L., "Bounds on Multiprocessing and Timing Anomalies' ', SlAM J. Appl. Math., 17, March 1969, pp. 416 - 429.Google ScholarCross Ref
- Kleinrock 76.Kleinrock, L., Queuing Systems Voljl: Computer Applications, John Wiley and Sons, 1976.Google Scholar
- Kobayashi 81.Kobayashi, H., Modeling and Analysis: An Introduction to System Performance Evaluation Methodology, Addison-Wesley, 1981.Google Scholar
- Kuck et al 84.Kuck, D.J. et al., "The Effects of Program Restructuring, Algorithm Change and Architecture Choice on Program Parallelism", Proc. International Conference on Parallel Processing, August 1984, pp. 128 - 138.Google Scholar
- Kung 84.Kung, K.C-Y., "Concurrency in Parallel Processing Systems", Research Report No. CSD-840039 (Ph.D. Thesis), Computer Science Department, Univ. of California (Los Angeles), 1984. Google ScholarDigital Library
- Majumdar 88.Majumdar S., "Processor Scheduling in Multiprogrammed Parallel Systems", Ph.D. Thesis, Department of Computational Science, University of Saskatchewan, Saskatoon, Canada, {to appear}. Google ScholarDigital Library
- Miller 87.Miller, A.R., "Non-Preemptive Run-Time Scheduling Issues on a Multitasked, Multiprogrammed Multiprocessor with Dependencies, Bidimensional Tasks, Folding, and Dynamic Graphs", Ph.D. Thesis, Department of Computer Science, University of Illinois at Urbana-Champaign, 1987. Google ScholarDigital Library
- Nelson et al 87.Nelson, R., Towsley, D., Tantawi, A.N., "PerformanceAnaIysis of Parallel Processing Systems", IEEETSE, 1987 {to appear}. Google ScholarDigital Library
- Ramamoorthy et al72.Ramamoorthy, C.V., Chandy, K.M., Gonzalez, M.J., "Optimal Scheduling Strategies in a Multiprocessing System", IEEETC, C- 21, 1972, pp. 145- 154.Google Scholar
- Rommel et al 87.Rommel, C.G., Towsley, D., Stankovic, J.A., "Analysis of Fork-Join Jobs using Processor Sharing", {submitted to OperationsResearch}.Google Scholar
- Sauer and Chandy 79.Sauer, C.H., Chandy, K.M., "The Impact of Distributions and Disciplines on Multiple Processor Systems", CACM, 22, 1, January 1979, pp. 25 - 34. Google ScholarDigital Library
- Tuomenoska and Siegel 85.Tuomenoska, D.L., Siegel, H.J., "Task Scheduling on the PASM Parallel Processing System", IEEETSE, SE-11, 2, February 1985, pp. 145- 157.Google Scholar
Index Terms
- Scheduling in multiprogrammed parallel systems
Recommendations
Scheduling in multiprogrammed parallel systems
Processor scheduling on multiprocessor systems that simultaneously run concurrent applications is currently not well-understood. This paper reports a preliminary investigation of a number of fundamental issues which are important in the context of ...
Performance characteristics of gang scheduling in multiprogrammed environments
SC '97: Proceedings of the 1997 ACM/IEEE conference on SupercomputingGang scheduling provides both space-slicing and time-slicing of computer resources for parallel programs. Each thread of execution from a parallel job is concurrently scheduled on an independent processor in order to achieve an optimal level of program ...
Comments