Article

Free access

An evaluation of parallel job scheduling for ASCI Blue-Pacific

Authors:

H. Franke,

J. Jann,

J. E. Moreira,

P. Pattnaik,

M. A. JetteAuthors Info & Claims

SC '99: Proceedings of the 1999 ACM/IEEE conference on Supercomputing

Pages 45 - es

https://doi.org/10.1145/331532.331577

Published: 01 January 1999 Publication History

PDF eReader

References

[1]

D. G. Feitelson. A Survey of Scheduling in Multiprogrammed Parallel Systems. Technical Report RC 19790 (87657), IBM T. J. Watson Research Center, October 1994.

Google Scholar

[2]

D. G. Feitelson and M. A. Jette. Improved Utilization and Responsiveness with Gang Scheduling. In IPPS'97 Workshop on Job Scheduling Strategies for Parallel Processing, volume 1291 of Lecture Notes in Computer Science, pages 238-261. Springer-Verlag, April 1997.

Digital Library

Google Scholar

[3]

D. G. Feitelson and A.M. Weil. Utilization and predictability in scheduling the IBM SP2 with backfilling. In 12th International Parallel Processing Symposium, pages 542-546, April 1998.

Digital Library

Google Scholar

[4]

H. Franke, P. Pattnaik, and L. Rudolph. Gang Scheduling for Highly Efficient Multiprocessors. In Sixth Symposium on the Frontiers of Massively Parallel Computation, Annapolis, Maryland, 1996.

Digital Library

Google Scholar

[5]

B. Gorda and R. Wolski. Time Sharing Massively Parallel Machines. In International Conference on Parallel Processing, volume II, pages 214-217, August 1995.

Google Scholar

[6]

N. Islam, A. L. Prodromidis, M. S. Squillante, L. L. Fong, and A. S. Gopal. Extensible Resource Management for Cluster Computing. In Proceedings of the 17th International Conference on Distributed Computing Systems, pages 561-568, 1997.

Digital Library

Google Scholar

[7]

J. Jann, P. Pattnaik, H. Franke, F. Wang, J. Skovira, and J. Riordan. Modeling of Workload in MPPs. In Proceedings of the 3rd Annual Workshop on Job Scheduling Strategies for Parallel Processing, pages 95-116, April 1997. In Conjunction with IPPS'97, Geneva, Switzerland.

Digital Library

Google Scholar

[8]

M. Jette, D. Storch, and E. Yim. Timesharing the Cray T3D. Cray User Group, pages 247-252, March 1996.

Google Scholar

[9]

M. A. Johnson and M. R. Taaffe. Matching Moments to Phase Distributions: Mixtures of Erlang Distributions of Common Order. Communications in Statistics - Stochastic Models, 5(4):711-743, 1989.

Crossref

Google Scholar

[10]

D. Lifka. The ANL/IBM SP scheduling system. In IPPS'95 Workshop on Job Scheduling Strategies for Parallel Processing, volume 949 of Lecture Notes in Computer Science, pages 295-303. Springer-Verlag, April 1995.

Digital Library

Google Scholar

[11]

J. E. Moreira, W. Chan, L. L. Fong, H. Franke, and M. A. Jette. An Infrastructure for Efficient Parallel Job Execution in Terascale Computing Environments. In Proceedings of SC98, Orlando, FL, November 1998.

Digital Library

Google Scholar

[12]

J. E. Moreira, H. Franke, W. Chan, L. L. Fong, M. A. Jette, and A. Yoo. A Gang-Scheduling System for ASCI Blue-Pacific. In Proceedings of the 7th International Conference on High-Performance Computing and Networking (HPCN'99), volume 1593 of Lecture Notes in Computer Science, pages 831-840. Springer, April 1999.

Digital Library

Google Scholar

[13]

R. Nelson. Probability, Stochastic Processes, and Queueing Theory. Springer-Verlag, 1995.

Digital Library

Google Scholar

[14]

J. K. Ousterhout. Scheduling Techniques for Concurrent Systems. In Third International Conference on Distributed Computing Systems, pages 22-30, 1982.

Google Scholar

[15]

U. Schwiegelshohn and R. Yahyapour. Improving First-Come-First-Serve Job Scheduling by Gang Scheduling. In IPPS'98 Workshop on Job Scheduling Strategies for Parallel Processing, March 1998.

Digital Library

Google Scholar

Cited By

View all

Whitlock BFavre JMeredith J(2011)Parallel in situ coupling of simulation with a fully featured visualization systemProceedings of the 11th Eurographics conference on Parallel Graphics and Visualization10.5555/2386230.2386245(101-109)Online publication date: 10-Apr-2011
https://dl.acm.org/doi/10.5555/2386230.2386245
Hongbing LLinping WWei W(2011)A Multi-constraint Preemption Algorithm for Parallel Job SchedulingProceedings of the 2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies10.1109/PDCAT.2011.7(73-78)Online publication date: 20-Oct-2011
https://dl.acm.org/doi/10.1109/PDCAT.2011.7
Qureshi KShah SManuel P(2011)Empirical performance evaluation of schedulers for cluster of workstationsCluster Computing10.1007/s10586-010-0128-514:2(101-113)Online publication date: 1-Jun-2011
https://dl.acm.org/doi/10.1007/s10586-010-0128-5
Show More Cited By

Recommendations

Parallel job scheduling algorithms
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 ...
Adaptive Parallel Job Scheduling with Flexible Coscheduling

Many scientific and high-performance computing applications consist of multiple processes running on different processors that communicate frequently. Because of their synchronization needs, these applications can suffer severe performance penalties if ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

SC '99: Proceedings of the 1999 ACM/IEEE conference on Supercomputing

January 1999

1015 pages

ISBN:1581130910

DOI:10.1145/331532

General Chair:
Cherri Pancake

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: 01 January 1999

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SC '99

Sponsor:

SIGARCH
IEEE-CS

SC '99: International Conference for High Performance Computing, Networking, Storage and Analysis

November 14 - 19, 1999

Oregon, Portland, USA

Acceptance Rates

Overall Acceptance Rate 1,516 of 6,373 submissions, 24%

Upcoming Conference

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

36
Total Citations
View Citations
353
Total Downloads

Downloads (Last 12 months)22
Downloads (Last 6 weeks)4

Reflects downloads up to 01 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Whitlock BFavre JMeredith J(2011)Parallel in situ coupling of simulation with a fully featured visualization systemProceedings of the 11th Eurographics conference on Parallel Graphics and Visualization10.5555/2386230.2386245(101-109)Online publication date: 10-Apr-2011
https://dl.acm.org/doi/10.5555/2386230.2386245
Hongbing LLinping WWei W(2011)A Multi-constraint Preemption Algorithm for Parallel Job SchedulingProceedings of the 2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies10.1109/PDCAT.2011.7(73-78)Online publication date: 20-Oct-2011
https://dl.acm.org/doi/10.1109/PDCAT.2011.7
Qureshi KShah SManuel P(2011)Empirical performance evaluation of schedulers for cluster of workstationsCluster Computing10.1007/s10586-010-0128-514:2(101-113)Online publication date: 1-Jun-2011
https://dl.acm.org/doi/10.1007/s10586-010-0128-5
Iosup ATannenbaum TFarrellee MEpema DLivny M(2008)Inter-operating grids through Delegated MatchMakingScientific Programming10.1155/2008/30496516:2-3(233-253)Online publication date: 1-Apr-2008
https://dl.acm.org/doi/10.1155/2008/304965
Ngubiri JVan Vliet M(2007)Group-wise performance evaluation of processor co-allocation in multi-cluster systemsProceedings of the 13th international conference on Job scheduling strategies for parallel processing10.5555/1791551.1791553(24-36)Online publication date: 17-Jun-2007
https://dl.acm.org/doi/10.5555/1791551.1791553
Choi GAgarwal SKim JDas CYoo A(2007)Performance Comparison of Coscheduling Algorithms for Non-Dedicated Clusters Through a Generic FrameworkInternational Journal of High Performance Computing Applications10.1177/109434200607486821:1(91-105)Online publication date: 1-Feb-2007
https://dl.acm.org/doi/10.1177/1094342006074868
Iosup AEpema DTannenbaum TFarrellee MLivny MVerastegui B(2007)Inter-operating grids through delegated matchmakingProceedings of the 2007 ACM/IEEE conference on Supercomputing10.1145/1362622.1362640(1-12)Online publication date: 16-Nov-2007
https://dl.acm.org/doi/10.1145/1362622.1362640
Yu JKim JMaeng S(2007)A runtime resolution scheme for priority boost conflict in implicit coschedulingThe Journal of Supercomputing10.1007/s11227-006-0006-340:1(1-28)Online publication date: 1-Apr-2007
https://dl.acm.org/doi/10.1007/s11227-006-0006-3
Oliner ASahoo R(2006)Evaluating cooperative checkpointing for supercomputing systemsProceedings of the 20th international conference on Parallel and distributed processing10.5555/1898699.1898920(363-363)Online publication date: 25-Apr-2006
https://dl.acm.org/doi/10.5555/1898699.1898920
Barsanti LSodan A(2006)Adaptive job scheduling via predictive job resource allocationProceedings of the 12th international conference on Job scheduling strategies for parallel processing10.5555/1757044.1757050(115-140)Online publication date: 26-Jun-2006
https://dl.acm.org/doi/10.5555/1757044.1757050
Show More Cited By

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

Parallel job scheduling algorithms

Improvements in Parallel Job Scheduling Using Gang Service

Adaptive Parallel Job Scheduling with Flexible Coscheduling