More Web Proxy on the site http://driver.im/

Article

Free access

Job scheduling in the presence of multiple resource requirements

Authors:

William Leinberger,

George Karypis,

Vipin KumarAuthors Info & Claims

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

Pages 47 - es

https://doi.org/10.1145/331532.331579

Published: 01 January 1999 Publication History

First page of PDF

References

[1]

Jr. E. G. Coffman, M. R. Garey, and D. S. Johnson. Approximation algorithms for bin-packing - an updated survey. In G. Ausiello, M. Lucertini, and P. Serafini, editors, Algorithm Design for Computer System Design, pages 49-99. Springer-Verlag, New York, 1984.

[2]

D.G. Feitelson. Packing schemes for gang scheduling. In D.G. Feitelson and L. Rudolph, editors, IPPS '96 Workshop: Job Scheduling Strategies for Parallel Processing, volume 1162, pages 65-88. Springer-Verlag, New York, 1996. Lect. Notes in Computer Science.

Digital Library

[3]

D.G. Feitelson and L. Rudolph. Parallel job scheduling: Issues and approaches. In D.G. Feitelson and L. Rudolph, editors, IPPS '95 Workshop: Job Scheduling Strategies for Parallel Processing, volume 949, pages 1-18. Springer-Verlag, New York, 1995. Lect. Notes in Computer Science.

Digital Library

[4]

D.G. Feitelson and A.M. Weil. Utilization and predictability in scheduling the ibm sp2 with backfilling. In Proceedings of the IPPS/SPDP 1998, pages 542- 546. IEEE Computer Society, 1998.

Digital Library

[5]

M. R. Garey and R. L. Graham. Bounds for multiprocessor scheduling with resource constraints. SIAM Journal of Computing, 4(2):187-201, June 1975.

[6]

S. Hotovy. Workload evolution on the cornell theory center ibm sp2. In D.G. Feitelson and L. Rudolph, editors, IPPS '96 Workshop: Job Scheduling Strategies for Parallel Processing, volume 1162, pages 27- 40. Springer-Verlag, New York, 1996. Lect. Notes in Computer Science.

Digital Library

[7]

G. Karypis and V. Kumar. Multi-constraint graph partitioning. In Supercomputing '98, November 1998.

Digital Library

[8]

W. Leinberger, G. Karypis, and V. Kumar. Multicapacity bin packing algorithms with applications to job scheduling under multiple constraints. In International Conferfence on Parallel Processing, 1999.

Digital Library

[9]

D. Lifka. The anl/ibm sp scheduling system. Technical report, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL, 1995.

[10]

R. K. Mansharamani and M. K. Vernon. Comparison of processor allocation policies for parallel systems. Technical report, Computer Sciences Department, University of Wisconsin, December 1993.

[11]

R.K. Mansharamani and M.K. Vernon. Properties of the eqs parallel processor allocation policy. Technical Report 1192, Computer Science Department, University of Wisconsin-Madison, November 1993.

[12]

K. Maruyama, S. K. Chang, and D. T. Tang. A general packing algorithm for multidimensional resource requirements. International Journal of Computer and Information Sciences, 6(2):131-149, May 1976.

[13]

C. McCann and J. Zahorjan. Scheduling memory constrained jobs on distributed memory computers. In Proceedings of the 1995 ACM SIGMETRICS Joint International Conference on Measurement and Modelling of Computer Systems, pages 208-219, 1996.

Digital Library

[14]

W. Nitzberg, K. Windisch, V. Lo, R. More, and D. Feitelson. A comparison of workload traces from two production parallel machines. In The 6th Symposium on the Frontiers of Massively Parallel Computing, pages 319-326, October 1998.

Digital Library

[15]

E. W. Parsons and K. C. Sevcik. Coordinated allocation of memory and processors in multiprocessors. Technical report, Computer Systems Research Institute, University of Toronto, October 1995.

[16]

E.W. Parsons and K. C. Sevcik. Implementing multiprocessor scheduling disciplines. Technical Report 356, Computer Systems Research Institute, University of Toronto, Canada, 1998.

[17]

J. Skovira, W. Chan, H. Zhou, and D.Lifka. The easy-loadleveler api project. In D.G. Feitelson and L. Rudolph, editors, Job Scheduling Strategies for Parallel Processing, volume 1162, pages 41-47. Springer-Verlag, New York, 1996. Lect. Notes in Computer Science.

Digital Library

[18]

D. Talby and D. G. Feitelson. Supporting priorities and improving utilization of the ibm sp2 scheduler using slack-based backfilling. Technical report, Institute of Computer Science, The Hebrew University of Jerusalem, 1999.

Cited By

Ageev ABoguslavskiy ASokolov S(2024)Modification of the HEFT algorithm for scheduling parallel jobs on heterogeneous computersKeldysh Institute Preprints10.20948/prepr-2024-58(1-34)Online publication date: 2024
https://doi.org/10.20948/prepr-2024-58
Priya ASahana S(2020)Processor Scheduling in High-Performance Computing (HPC) EnvironmentEmerging Trends and Impacts of the Internet of Things in Libraries10.4018/978-1-7998-4742-7.ch009(151-179)Online publication date: 2020
https://doi.org/10.4018/978-1-7998-4742-7.ch009
Priya ASahana S(2020)Multi-Processor Job Scheduling in High-Performance Computing (HPC) SystemsFPGA Algorithms and Applications for the Internet of Things10.4018/978-1-5225-9806-0.ch009(168-203)Online publication date: 30-Mar-2020
https://doi.org/10.4018/978-1-5225-9806-0.ch009
Show More Cited By

Index Terms

Recommendations

Selective preemption strategies for parallel job scheduling

Although theoretical results have been established regarding the utility of preemptive scheduling in reducing average job turnaround time, job suspension/restart is not much used in practice at supercomputer centres for parallel job scheduling. A number ...
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 ...
A Multi-constraint Preemption Algorithm for Parallel Job Scheduling
PDCAT '11: Proceedings of the 2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies

Using effective scheduling strategies to improve turnaround time, slowdown, and utilization is an important consideration in large supercomputing environments. Since such machines have traditionally used non-preemption strategies to accommodate multiple ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences

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

Copyright © 1999 ACM.

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]

Sponsors

SIGARCH: ACM Special Interest Group on Computer Architecture
IEEE-CS: Computer Society

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

Author Tags

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

32
Total Citations
View Citations
834
Total Downloads

Downloads (Last 12 months)68
Downloads (Last 6 weeks)6

Reflects downloads up to 13 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Ageev ABoguslavskiy ASokolov S(2024)Modification of the HEFT algorithm for scheduling parallel jobs on heterogeneous computersKeldysh Institute Preprints10.20948/prepr-2024-58(1-34)Online publication date: 2024
https://doi.org/10.20948/prepr-2024-58
Priya ASahana S(2020)Processor Scheduling in High-Performance Computing (HPC) EnvironmentEmerging Trends and Impacts of the Internet of Things in Libraries10.4018/978-1-7998-4742-7.ch009(151-179)Online publication date: 2020
https://doi.org/10.4018/978-1-7998-4742-7.ch009
Priya ASahana S(2020)Multi-Processor Job Scheduling in High-Performance Computing (HPC) SystemsFPGA Algorithms and Applications for the Internet of Things10.4018/978-1-5225-9806-0.ch009(168-203)Online publication date: 30-Mar-2020
https://doi.org/10.4018/978-1-5225-9806-0.ch009
Hu JPu YLi ZWang L(2019)Multi-dimensional Resource Optimal Allocation Method for Service Function Chain DeploymentJournal of Physics: Conference Series10.1088/1742-6596/1345/3/0320031345:3(032003)Online publication date: 1-Nov-2019
https://doi.org/10.1088/1742-6596/1345/3/032003
Sun HElghazi RGainaru AAupy GRaghavan P(2018)Scheduling Parallel Tasks under Multiple Resources: List Scheduling vs. Pack Scheduling2018 IEEE International Parallel and Distributed Processing Symposium (IPDPS)10.1109/IPDPS.2018.00029(194-203)Online publication date: May-2018
https://doi.org/10.1109/IPDPS.2018.00029
Wang TXu HLiu F(2017)Multi-resource Load Balancing for Virtual Network Functions2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS)10.1109/ICDCS.2017.233(1322-1332)Online publication date: Jun-2017
https://doi.org/10.1109/ICDCS.2017.233
Agrawal SDas SValmiki MWandhekar SMoona R(2017)A Case for PARAM Shavak: Ready-to-Use and Affordable Supercomputing Solution2017 International Conference on High Performance Computing & Simulation (HPCS)10.1109/HPCS.2017.66(396-401)Online publication date: Jul-2017
https://doi.org/10.1109/HPCS.2017.66
Jiang JMa SLi BLi B(2016)Symbiosis: Network-aware task scheduling in data-parallel frameworksIEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications10.1109/INFOCOM.2016.7524415(1-9)Online publication date: Apr-2016
https://doi.org/10.1109/INFOCOM.2016.7524415
Liu LLuan ZWang HQian D(2016)IBB: Improved K-Resource Aware Backfill Balanced Scheduling for HTCondorNetwork and Parallel Computing10.1007/978-3-319-47099-3_7(85-92)Online publication date: 30-Sep-2016
https://doi.org/10.1007/978-3-319-47099-3_7
Xiao PLiu D(2014)Multi-scheme co-scheduling framework for high-performance real-time applications in heterogeneous gridsInternational Journal of Computational Science and Engineering10.1504/IJCSE.2014.0586979:1/2(55-63)Online publication date: 1-Jan-2014
https://dl.acm.org/doi/10.1504/IJCSE.2014.058697
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Login options

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

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents