Article

Free access

An analysis of gang scheduling for multiprogrammed parallel computing environments

Authors:

Mark S. Squillante,

Fang Wang,

Marios PapaefthymiouAuthors Info & Claims

SPAA '96: Proceedings of the eighth annual ACM symposium on Parallel Algorithms and Architectures

Pages 89 - 98

https://doi.org/10.1145/237502.237511

Published: 24 June 1996 Publication History

PDF eReader

References

[1]

A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The Design and Analyszs of Computer Algomthms. Addison- Wesley, 1974.

Digital Library

Google Scholar

[2]

S. Asmussen, O. Nerman, and M. Olsson. Fitting phase type distributions via the EM algorithm. Technical Report 1994:23, Department of Mathematics, Chalmers University of Technology, May 1994.

Google Scholar

[3]

V. D. Cung et al. Concurrent data structures and load balancing strategies for parallel branch-and-bound/a* algorithms. In The Thwd DIMACS International Algomthm {mplementatzon Challenge on Parallel Atgomthms, October 1994.

Google Scholar

[4]

E. de Souza e Silva, H. R. Gaff, and R. R. Muntz. Polling systems with server timeouts and their apphcation to token passing networks. IEEE/ACM Transactions on Networking, 3(5):560-575, October 1995.

Digital Library

Google Scholar

[5]

M. J. Faddy. Fitting structured phase-type distributions. Technical report, Department of Mathematics, University of Queensland, Australia, April 1994. To appear, Applzed S$ochastzc Models and Data Analyszs.

Google Scholar

[6]

D. G. Feitelson and L. Rudolph. Distributed hierarchical control for parallel processing. Computer, May 1990.

Digital Library

Google Scholar

[7]

D. G. Feitelson and L. Rudolph. Mapping and scheduling in a shared parallel environment using distributed hierarchical control. In Proceedzngs of the International Conference on Parallel Processing, volume I, pages 1-8, August 1990.

Google Scholar

[8]

D. G. Feitelson and L. Rudolph. Gang scheduling performance benefits for fine-grain synchronization. Journal of Parallel and D,stributed Computing, 16(4):306- 318, December 1992.

Google Scholar

[9]

W. Feller. An Introductzon to Probabihty Theory and Its Applicat, ons, volume I. John Wiley and Sons, Third edition, 1968.

Google Scholar

[10]

F. R. Gantmacher. The Theory of Matinees. Chelsea, 1959.

Google Scholar

[11]

N. Islam, A. Prodromtdis, and M. S. Squillante. Dynamic partitioning in different distributed-memory environments. In Proceedings of the 2nd Workshop on Job Scheduling Strategies for Parallel Processzng, April 1996.

Digital Library

Google Scholar

[12]

S. Karlin and H. M. Taylor. A First Course in Stochastic Processes. Academic Press, Second edition, 1975.

Google Scholar

[13]

L. Kleinrock. Queuezng Systems Volume I: Theory. John Wiley and Sons, 1975.

Digital Library

Google Scholar

[14]

A. Krishnamurthy et al. Connected components on distributed memory machines. In The Third DIMACS International Algomthm Implementation Challenge on Parallel Algorithms, October 1994.

Google Scholar

[15]

A. Lang. Parameter estimation for phase-type distributions, part i: Fundamentals and existing methods. Technical Report 159, Department of Statistics, Oregon State University, 1994.

Google Scholar

[16]

A. Lang and J. L. Arthur. Parameter estimation for phase-type distributions, part II: Computational evaluation. Technical Report 160, Department of Statistics, Oregon State University, August 1994.

Google Scholar

[17]

J. D. C. Little. A proof of the queuing formula L --,#W. Operations Research, 9, 1961.

Google Scholar

[18]

R. Nelson. Probability, Stochastic Processes, and Queueing Theory- The Mathematzcs of Computer Performance Modeling. Springer-Verlag, 1995.

Digital Library

Google Scholar

[19]

M. F. Neuts. Matrix-Geometmc Solutions zn Stochast, c Models: An Algomthmzc Approach. The Johns Hopkins University Press, 1981.

Google Scholar

[20]

S. M. Ross. Stochastic Processes. John Wiley and Sons, New York, 1983.

Google Scholar

[21]

R. Schassberger. Insensitivity of steady-state distributions of generalized semi-Markov processes, part I. The Annals of Probability, 5(1):87-99, 1977.

Crossref

Google Scholar

[22]

R. Schassberger. Insensitivity of steady-state distributions of generalized semi-Markov processes, part II. The Annals of Probability, 6(1):85-93, 1978.

Crossref

Google Scholar

[23]

M. S. Squillante. MAGIC: A computer performance modeling tool based on matrix-geometric techniques. In Proceedings of the Fzfth Internatzonal Conference on Modellzng Techniques and Tools for Computer Performance Evaluation, pages 411-425, February 1991.

Google Scholar

[24]

H. Takagi. Queuemg Analysis - A Foundation of Performance Evaluation, volume 1: Vacation and Priority Systems, Part 1. North Holland, 1991.

Google Scholar

[25]

A. Tucker and A. Gupta. Process control and scheduling issues for multiprogrammed shared-memory multiprocessors. In Proceedzngs of the Twelfth A CM Symposium on Operating Systems Princzples, pages 159-166, December 1989.

Digital Library

Google Scholar

[26]

J. Walrand. An Introductzon to Queuezng Networks. Prentice Hall, 1988.

Google Scholar

[27]

F. Wang, H. Franke, M. Papaefthymiou, P. Pattnaik, L. Rudolph, and M. S. Squfllante. A gang scheduling design for multiprogrammed parallel computing environments. In Proceedings of the #nd Workshop on Job Scheduling Strategies for Parallel Processing, April 1996.

Digital Library

Google Scholar

[28]

R. W. Wolff. Stochastic Modelzng and the Theory of Queues. Prentice Hall, 1989.

Google Scholar

[29]

J. Z#horjan and C. McCann. Processor scheduling in shared memory multiprocessors. In Proceedings of the A CM SIGMETRICS Conference on Measurement and Modehng of Computer Systems, pages 214-225, May 1990.

Digital Library

Google Scholar

Cited By

View all

Choi GKim JErsoz DYoo ADas C(2007)A comprehensive performance and energy consumption analysis of scheduling alternatives in clustersThe Journal of Supercomputing10.1007/s11227-006-0018-z40:2(159-184)Online publication date: 1-May-2007
https://dl.acm.org/doi/10.1007/s11227-006-0018-z
Silva FCampos LScherson I(2006)A lower bound for dynamic scheduling of data parallel programsEuro-Par’98 Parallel Processing10.1007/BFb0057875(367-372)Online publication date: 30-Jun-2006
https://doi.org/10.1007/BFb0057875
Wang FFranke HPapaefthymiou MPattnaik PRudolph LSquillante M(2005)A gang scheduling design for multiprogrammed parallel computing environmentsJob Scheduling Strategies for Parallel Processing10.1007/BFb0022290(111-125)Online publication date: 15-Jun-2005
https://doi.org/10.1007/BFb0022290
Show More Cited By

Index Terms

An analysis of gang scheduling for multiprogrammed parallel computing environments
1. Mathematics of computing
  1. Probability and statistics
    1. Statistical paradigms
      1. Queueing theory
2. Theory of computation

Recommendations

Performance characteristics of gang scheduling in multiprogrammed environments
SC '97: Proceedings of the 1997 ACM/IEEE conference on Supercomputing

Gang 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 ...
Improvements in Parallel Job Scheduling Using Gang Service
ISPAN '99: Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks

Gang scheduling has been widely used as a practical solution to the dynamic parallel job scheduling problem. Parallel threads of a single job are scheduled for simultaneous execution on a parallel computer even if the job does not fully utilize all ...
Processor scheduling in multiprogrammed parallel systems

Comments

Information & Contributors

Information

Published In

SPAA '96: Proceedings of the eighth annual ACM symposium on Parallel Algorithms and Architectures

June 1996

337 pages

ISBN:0897918096

DOI:10.1145/237502

Chairman:
Guy E. Blelloch
CMU

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 24 June 1996

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

8SPAA96

Sponsor:

8SPAA96: 8th Annual ACM Symposium on Parallel

June 24 - 26, 1996

Padua, Italy

Acceptance Rates

SPAA '96 Paper Acceptance Rate 39 of 106 submissions, 37%;

Overall Acceptance Rate 447 of 1,461 submissions, 31%

Upcoming Conference

SPAA '25

Sponsor:
sigact
sigact

37th ACM Symposium on Parallelism in Algorithms and Architectures

July 28 - August 1, 2025

Portland , OR , USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

8
Total Citations
View Citations
345
Total Downloads

Downloads (Last 12 months)42
Downloads (Last 6 weeks)8

Reflects downloads up to 09 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Choi GKim JErsoz DYoo ADas C(2007)A comprehensive performance and energy consumption analysis of scheduling alternatives in clustersThe Journal of Supercomputing10.1007/s11227-006-0018-z40:2(159-184)Online publication date: 1-May-2007
https://dl.acm.org/doi/10.1007/s11227-006-0018-z
Silva FCampos LScherson I(2006)A lower bound for dynamic scheduling of data parallel programsEuro-Par’98 Parallel Processing10.1007/BFb0057875(367-372)Online publication date: 30-Jun-2006
https://doi.org/10.1007/BFb0057875
Wang FFranke HPapaefthymiou MPattnaik PRudolph LSquillante M(2005)A gang scheduling design for multiprogrammed parallel computing environmentsJob Scheduling Strategies for Parallel Processing10.1007/BFb0022290(111-125)Online publication date: 15-Jun-2005
https://doi.org/10.1007/BFb0022290
Wang FPapaefthymiou MSquillante M(2005)Performance evaluation of gang scheduling for parallel and distributed multiprogrammingJob Scheduling Strategies for Parallel Processing10.1007/3-540-63574-2_26(277-298)Online publication date: 12-Jul-2005
https://doi.org/10.1007/3-540-63574-2_26
Jann JPattnaik PFranke HWang FSkovira JRiordan J(2005)Modeling of workload in MPPsJob Scheduling Strategies for Parallel Processing10.1007/3-540-63574-2_18(95-116)Online publication date: 12-Jul-2005
https://doi.org/10.1007/3-540-63574-2_18
Da Silva FScherson I(2001)Simulation-based average case analysis for parallel job schedulingProceedings. 34th Annual Simulation Symposium10.1109/SIMSYM.2001.922110(15-24)Online publication date: 2001
https://doi.org/10.1109/SIMSYM.2001.922110
Werner-Kytölä OTichy W(2001)Self-Tuning ParallelismHigh Performance Computing and Networking10.1007/3-540-45492-6_30(300-312)Online publication date: 12-Jun-2001
https://doi.org/10.1007/3-540-45492-6_30
Franke HPattnaik PRudolph L(1996)Gang scheduling for highly efficient, distributed multiprocessor systemsProceedings of 6th Symposium on the Frontiers of Massively Parallel Computation (Frontiers '96)10.1109/FMPC.1996.558056(4-12)Online publication date: 1996
https://doi.org/10.1109/FMPC.1996.558056

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Performance characteristics of gang scheduling in multiprogrammed environments

Improvements in Parallel Job Scheduling Using Gang Service

Processor scheduling in multiprogrammed parallel systems