Article

Free access

ESP: a system utilization benchmark

Authors:

Adrian T. Wong,

Leonid Oliker,

William T. C. Kramer,

Teresa L. Kaltz,

David H. BaileyAuthors Info & Claims

SC '00: Proceedings of the 2000 ACM/IEEE conference on Supercomputing

Pages 15 - es

Published: 01 November 2000 Publication History

PDF eReader

Abstract

This article describes a new benchmark, called the Effective System Performance (ESP) test, which is designed to measure system-level performance, including such factors as job scheduling efficiency, handling of large jobs and shutdown-reboot times. In particular, this test can be used to study the effects of various scheduling policies and parameters. We present here some results that we have obtained so far on the Cray T3E and IBM SP systems, together with insights obtained from simulations.

References

[1]

David H. Bailey, et. al, "The NAS Parallel Benchmarks", Intl. Journal of Supercomputer Applications, vol. 5 (1991), pg. 66.

Digital Library

Google Scholar

[2]

Jay Blakeborough and Mike Welcome, "T3E Scheduling Update", 41st Cray User Group Conference Proc., 1999.

Google Scholar

[3]

Jack Dongarra, "Performance of Various Computers Using Standard Linear Algebra Software in a Fortran Environment". Available from http://www.netlib.org/benchmarks/performance.ps.

Google Scholar

[4]

D. G. Feitelson and M. A. Jette, "Improved Utilization and Responsiveness with Gang Scheduling", Workshop in Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph, ed., Springer-Verlag/IEEE, 1997, pg. 238.

Digital Library

Google Scholar

[5]

Morris A. Jette, "Performance Characteristics of Gang Scheduling in Muliprogrammed Environments", Proc. of Supercomputing '97, IEEE, 1997.

Digital Library

Google Scholar

[6]

W. Leinberg, G. Karypis and V. Kumar, "Job Scheduling in the presence of Mulitple Resource Requirements", CS Dept. TR 99-925, University of Minnesota, 1999.

Google Scholar

[7]

Horst Simon and William Kramer and Robert Lucas, "Building the Teraflops/Petabytes Production Supercomputing Center", Fifth International Euro-Par Conference Proc., 1999, pg. 61.

Digital Library

Google Scholar

[8]

D. Talby and D. G. Feitelson, "Supporting Priorities and Improving Utilization of the IBM SP2 Scheduler using Slack-Based Backfilling", 13th International Parallel Processing Symposium, IEEE, 1999, pg. 513.

Digital Library

Google Scholar

[9]

Adrian Wong, Leonid Oliker, William Kramer, Teresa Kaltz and David Bailey, "Evaluating System Effectiveness in High Performance Computing Systems", 1999. Available from http://www.nersc.gov/~dhbailey.

Google Scholar

[10]

Dmitry Zotkin and Peter J. Keleher, "Job-Length Estimation and Performance in Backfilling Schedulers", 8th High Performance Distributed Computing Conference, IEEE, 1999.

Digital Library

Google Scholar

Cited By

View all

Georgiou YGlesser DRzadca KTrystram DBalaji PXu C(2015)A scheduler-level incentive mechanism for energy efficiency in HPCProceedings of the 15th IEEE/ACM International Symposium on Cluster, Cloud, and Grid Computing10.1109/CCGrid.2015.101(617-626)Online publication date: 4-May-2015
https://dl.acm.org/doi/10.1109/CCGrid.2015.101
Vengerov D(2009)A reinforcement learning framework for utility-based scheduling in resource-constrained systemsFuture Generation Computer Systems10.1016/j.future.2008.02.00625:7(728-736)Online publication date: 1-Jul-2009
https://dl.acm.org/doi/10.1016/j.future.2008.02.006
Esbaugh BSodan A(2007)Coarse-grain time slicing with resource-share control in parallel-job schedulingProceedings of the Third international conference on High Performance Computing and Communications10.5555/2401945.2401956(30-43)Online publication date: 26-Sep-2007
https://dl.acm.org/doi/10.5555/2401945.2401956
Show More Cited By

Index Terms

Recommendations

Permutation Flowshop Scheduling Problem Using Classical NEH, ILS-ESP Operator
SEMCCO 2013: Proceedings of the 4th International Conference on Swarm, Evolutionary, and Memetic Computing - Volume 8298

This paper deals with the Permutation Flow Shop scheduling problem with the objective of minimizing the maximum completion time (makespan), which is associated with an efficient utilization of resources. A differential evolutionary algorithm with ...
Scheduling of deteriorating jobs with release dates to minimize the maximum lateness

In this paper, we consider the problem of scheduling n deteriorating jobs with release dates on a single (batching) machine. Each job's processing time is a simple linear function of its starting time. The objective is to minimize the maximum lateness. ...
Primary-secondary bicriteria scheduling on identical machines to minimize the total completion time of all jobs and the maximum T-time of all machines

In this paper, we study a new primary-secondary bicriteria scheduling problem on identical machines. The primary objective is to minimize the total completion time of all jobs and the secondary objective is to minimize the maximum T-time of all machines,...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

SC '00: Proceedings of the 2000 ACM/IEEE conference on Supercomputing

November 2000

889 pages

ISBN:0780398025

Conference Chair:
Louis Turcotte
Rose-Hulman Institute of Technology

In-Cooperation

SIAM: Society for Industrial and Applied Mathematics

Publisher

IEEE Computer Society

United States

Publication History

Published: 01 November 2000

Check for updates

Qualifiers

Article

Conference

SC '00

Sponsor:

SIGARCH
IEEE-CS

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

November 4 - 10, 2000

Texas, Dallas, USA

Acceptance Rates

SC '00 Paper Acceptance Rate 62 of 179 submissions, 35%;

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

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
481
Total Downloads

Downloads (Last 12 months)28
Downloads (Last 6 weeks)7

Reflects downloads up to 19 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Georgiou YGlesser DRzadca KTrystram DBalaji PXu C(2015)A scheduler-level incentive mechanism for energy efficiency in HPCProceedings of the 15th IEEE/ACM International Symposium on Cluster, Cloud, and Grid Computing10.1109/CCGrid.2015.101(617-626)Online publication date: 4-May-2015
https://dl.acm.org/doi/10.1109/CCGrid.2015.101
Vengerov D(2009)A reinforcement learning framework for utility-based scheduling in resource-constrained systemsFuture Generation Computer Systems10.1016/j.future.2008.02.00625:7(728-736)Online publication date: 1-Jul-2009
https://dl.acm.org/doi/10.1016/j.future.2008.02.006
Esbaugh BSodan A(2007)Coarse-grain time slicing with resource-share control in parallel-job schedulingProceedings of the Third international conference on High Performance Computing and Communications10.5555/2401945.2401956(30-43)Online publication date: 26-Sep-2007
https://dl.acm.org/doi/10.5555/2401945.2401956
Frachtenberg EFeitelson D(2005)Pitfalls in parallel job scheduling evaluationProceedings of the 11th international conference on Job Scheduling Strategies for Parallel Processing10.1007/11605300_13(257-282)Online publication date: 19-Jun-2005
https://dl.acm.org/doi/10.1007/11605300_13

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

Permutation Flowshop Scheduling Problem Using Classical NEH, ILS-ESP Operator

Scheduling of deteriorating jobs with release dates to minimize the maximum lateness

Primary-secondary bicriteria scheduling on identical machines to minimize the total completion time of all jobs and the maximum T-time of all machines