article

Free access

Coordinated allocation of memory and processors in multiprocessors

Authors:

Eric W. Parsons,

Kenneth C. SevcikAuthors Info & Claims

ACM SIGMETRICS Performance Evaluation Review, Volume 24, Issue 1

Pages 57 - 67

https://doi.org/10.1145/233008.233023

Published: 15 May 1996 Publication History

Abstract

An important issue in multiprogrammed multiprocessor systems is the scheduling of parallel jobs. Most research in the area has focussed solely on the allocation of processors to jobs. However, since memory is also a critical resource for many parallel jobs, the allocation of memory and processors must be coordinated to allow the system to operate most effectively.To understand how to design such coordinated scheduling disciplines, it is important to have a theoretical foundation. To this end, we develop bounds on the achievable system throughput when both memory and processing time are in demand. We then propose and simulate a simple discipline and relate its performance to the throughput bounds. An important result of our work is for the situation in which the workload speedup is convex (from above), but the speedup characteristics of individual jobs are unknown. It shows that an equi-allocation strategy for processors can achieve near-maximum throughput, yet offer good mean response times, when both memory and processors are considered.

References

[1]

Gail Alverson, Simon Kahan, Richard Korry, Cathy McCann, and Burton Smith. Scheduling on the Tera MTA. In D. G. Feitelson and L. Rudolph, editors, Job Scheduling Strategies for Parallel Processing, Lecture Notes in Computer Science Vol. 949, pages 19--44. Springer-Verlag, 1995.

Digital Library

[2]

Douglas C. Burger, Rahmat S. Hyder, Barton P. Miller, and David A. Wood. Paging tradeoffs in distributedshared-memory multiprocessors. In Proceedings Supercomputing '94, November 1994.

Digital Library

[3]

Su-Hui Chiang, Rajesh K. Mansharamani, and Mary K. Vemon. Use of application characteristics and limited preemption for run-to-completion parallel processor scheduling policies. In Proceedings of the 1994 A CM SIGMETRICS Conference on Measurement and Modelling of Computer Systems, pages 33- 44, 1994.

Digital Library

[4]

Edward G. Coffman. Studying multiprogrammed systems. Datamation, pages 47-54, June 1967.

[5]

Derek L. Eager, John Zahorjan, and Edward D. Lazowska. Speedup versus efficiency in parallel systems. IEEE Transactions on Computers, 38(3):408- 423, March 1989.

Digital Library

[6]

Dror G. Feitelson and Bill Nitzberg. Job characteristics of a production parallel scientific workload on the NASA Ames iPSC/860. In D. G. Feitelson and L. Rudolph, editors, Job Scheduling Strategies for Parallel Processing, Lecture Notes in Computer Science Vol. 949, pages 337-360. Springer-Verlag, 1995.

Digital Library

[7]

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

[8]

Dipak Ghosal, Guiseppe Serazzi, and Satish K. Tripathi. The processor working set and its use in scheduling multiprocessor systems. IEEE Transactions on Software Engineering, 17(5):443-453, May 1991.

Digital Library

[9]

Anoop Gupta, Andrew Tucker, and Shigeru Urushibara. The impact of operating system scheduling policies and synchronization methods on the performance of parallel applications. In Proceedings of the 1991 A CM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, pages 120- 132, 1991.

Digital Library

[10]

Cathy McCann and John Zahorjan. Processor allocation policies for message-passing parallel computers. In Proceedings of the 1994 A CM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, pages 19-32, 1994.

Digital Library

[11]

Cathy McCann and John Zahorjan. Scheduling memory constrained jobs on distributed memory parallel computers. In Proceedings of the 1995 A CM SIGMET- RICS Joint International Conference on Measurement and Modelling of Computer Systems, pages 208-219, 1995.

Digital Library

[12]

Eric W. Parsons and Kenneth C. Sevcik. Coordinated allocation of memory and processors in multiprocessors. Technical Report 336, Computer Systems Research Institute, University of Toronto, 1995.

[13]

Eric W. Parsons and Kenneth C. Sevcik. Multiprocessor scheduling for high-variability service time distributions. In D. G. Feitelson and L. Rudolph, editors, Job Scheduling Strategies for Parallel Processing, Lecture Notes in Computer Science Vol. 949, pages 127-145. Springer-Verlag, 1995.

Digital Library

[14]

Vinod G. J. Peris, Mark S. Squillante, and Vijay K. Naik. Analysis of the impact of memory in distributed parallel processing systems. In Proceedings of the 1994 A CM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, pages 5-18, 1994.

Digital Library

[15]

Sanjeev Setia. The interaction between memory allocations and adaptive partitioning in message-passing multiprocessors. In D. G. Feitelson and L. Rudolph, editors, Job Scheduling Strategies for Parallel Processing, Lecture Notes in Computer Science Vol. 949, pages 146-164. Springer-Verlag, 1995.

Digital Library

[16]

Kenneth C. Sevcik. Characterizations ofparallelism in applications and their use in scheduling. In Proceedings of the 1988 ACM SIGMETRICS International Conference on Measurement and Modelling of Computer Systems, pages 171-180, May 1989.

Digital Library

[17]

K.C. Sevcik. Application scheduling and processor allocation in multiprogrammed parallel processing systems. Performance Evaluation, 19:107-140, 1994.

Digital Library

[18]

Xian-He Sun and L. Ni. Scalable problems and memory-bounded speedup. Journal of Parallel and Distributed Computing, 19(1):27-37, Sept 1993.

Digital Library

[19]

Sanjeev Setia and Satish Tripathi. A comparative analysis of static processor partitioning policies for parallel computers, in Proceedings of the International Workshop on Modeling and Simulation of Computer and Telecommunication Systems (MASCOTS), pages 283-28"6, January 1993.

Digital Library

[20]

Andrew Tucker and Anoop Gupta. Process control and scheduling issues for multiprogrammed sharedmemory multiprocessors. In Proceedings of the 12th A CM Symposium on Operating Systems Principles, pages 159-166, 1989.

Digital Library

[21]

Chee-Shong Wu. Processor scheduling in multiprogrammed shared memory NUMA multiprocessors. Technical Report 341, Computer Systems Research Institute, University of Toronto, 1993.

Cited By

Ghasemi MLubin B(2015)Modeling multi-attribute demand for sustainable cloud computing with copulaeProceedings of the 24th International Conference on Artificial Intelligence10.5555/2832581.2832612(2596-2602)Online publication date: 25-Jul-2015
https://dl.acm.org/doi/10.5555/2832581.2832612
Ghumman WLópez-Garcia P(2010)Optimized parallelization heuristic for task schedulingProceedings of the 4th WSEAS international conference on Computational intelligence10.5555/1844299.1844322(122-128)Online publication date: 20-Apr-2010
https://dl.acm.org/doi/10.5555/1844299.1844322
Feitelson D(2005)Memory usage in the LANL CM-5 workloadJob Scheduling Strategies for Parallel Processing10.1007/3-540-63574-2_17(78-94)Online publication date: 12-Jul-2005
https://doi.org/10.1007/3-540-63574-2_17
Show More Cited By

Index Terms

Coordinated allocation of memory and processors in multiprocessors

Recommendations

Coordinated allocation of memory and processors in multiprocessors
SIGMETRICS '96: Proceedings of the 1996 ACM SIGMETRICS international conference on Measurement and modeling of computer systems

An important issue in multiprogrammed multiprocessor systems is the scheduling of parallel jobs. Most research in the area has focussed solely on the allocation of processors to jobs. However, since memory is also a critical resource for many parallel ...
Comparing Processor Allocation Strategies in Multiprogrammed Shared-Memory Multiprocessors

Small-scale shared-memory multiprocessors are commonly used in a workgroup environment where multiple applications, both parallel and sequential, are executed concurrently while sharing the processors and other system resources. To utilize the ...
The convergence of massively parallel processors and multiprocessors

Comments

Information & Contributors

Information

Published In

cover image ACM SIGMETRICS Performance Evaluation Review

ACM SIGMETRICS Performance Evaluation Review Volume 24, Issue 1

May 1996

273 pages

ISSN:0163-5999

DOI:10.1145/233008

Editors:
Blaine E. Gaither
Hewlett-Packard, Fort Collins, CO
,
Daniel A. Reed
Univ. of Illinois, Urbana

Issue’s Table of Contents

SIGMETRICS '96: Proceedings of the 1996 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
May 1996
279 pages
ISBN:0897917936
DOI:10.1145/233013
Chairman:
Daniel A. Reed
Univ. of Illinois, Urbana
,
Editor:
Blaine D. Gaither
Hewlett-Packard, Fort Collins, CO

Copyright © 1996 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]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 15 May 1996

Published in SIGMETRICS Volume 24, Issue 1

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

27
Total Citations
View Citations
313
Total Downloads

Downloads (Last 12 months)13
Downloads (Last 6 weeks)3

Reflects downloads up to 06 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

Ghasemi MLubin B(2015)Modeling multi-attribute demand for sustainable cloud computing with copulaeProceedings of the 24th International Conference on Artificial Intelligence10.5555/2832581.2832612(2596-2602)Online publication date: 25-Jul-2015
https://dl.acm.org/doi/10.5555/2832581.2832612
Ghumman WLópez-Garcia P(2010)Optimized parallelization heuristic for task schedulingProceedings of the 4th WSEAS international conference on Computational intelligence10.5555/1844299.1844322(122-128)Online publication date: 20-Apr-2010
https://dl.acm.org/doi/10.5555/1844299.1844322
Feitelson D(2005)Memory usage in the LANL CM-5 workloadJob Scheduling Strategies for Parallel Processing10.1007/3-540-63574-2_17(78-94)Online publication date: 12-Jul-2005
https://doi.org/10.1007/3-540-63574-2_17
Feitelson DRudolph LSchwiegelshohn USevcik KWong P(2005)Theory and practice in parallel job schedulingJob Scheduling Strategies for Parallel Processing10.1007/3-540-63574-2_14(1-34)Online publication date: 12-Jul-2005
https://doi.org/10.1007/3-540-63574-2_14
Rubab SHassan MMahmood AShah S(2015)Adoptability Study of Bin-Packing for Scheduling Jobs on Volunteer Grid ResourcesProcedia Computer Science10.1016/j.procs.2015.10.00169(2-12)Online publication date: 2015
https://doi.org/10.1016/j.procs.2015.10.001
Lin YLin YLai Y(2010)Thread allocation in CMP-based multithreaded network processorsParallel Computing10.1016/j.parco.2010.01.00136:2-3(104-116)Online publication date: 1-Feb-2010
https://dl.acm.org/doi/10.1016/j.parco.2010.01.001
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
Weinberg JSnavely A(2007)Symbiotic Space-Sharing on SDSC’s DataStar SystemJob Scheduling Strategies for Parallel Processing10.1007/978-3-540-71035-6_10(192-209)Online publication date: 2007
https://doi.org/10.1007/978-3-540-71035-6_10
Weinberg JSnavely A(2006)Symbiotic space-sharing on SDSC's datastar systemProceedings of the 12th international conference on Job scheduling strategies for parallel processing10.5555/1757044.1757054(192-209)Online publication date: 26-Jun-2006
https://dl.acm.org/doi/10.5555/1757044.1757054
Weinberg JSnavely AEgan GMuraoka Y(2006)User-guided symbiotic space-sharing of real workloadsProceedings of the 20th annual international conference on Supercomputing10.1145/1183401.1183450(345-352)Online publication date: 28-Jun-2006
https://dl.acm.org/doi/10.1145/1183401.1183450
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

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 Issue’s Table of Contents