article

Free access

Exploiting process lifetime distributions for dynamic load balancing

Authors:

Mor Harchol-Balter,

Allen B. DowneyAuthors Info & Claims

ACM SIGMETRICS Performance Evaluation Review, Volume 24, Issue 1

Pages 13 - 24

https://doi.org/10.1145/233008.233019

Published: 15 May 1996 Publication History

Abstract

We measure the distribution of lifetimes for UNIX processes and propose a functional form that fits this distribution well. We use this functional form to derive a policy for preemptive migration, and then use a trace-driven simulator to compare our proposed policy with other preemptive migration policies, and with a non-preemptive load balancing strategy. We find that, contrary to previous reports, the performance benefits of preemptive migration are significantly greater than those of non-preemptive migration, even when the memory-transfer cost is high. Using a model of migration costs representative of current systems, we find that preemptive migration reduces the mean delay (queueing and migration) by 35 - 50%, compared to non-preemptive migration.

References

[1]

Rakesh Agrawal and Ahmed Ezzet. Location independent remote execution in NEST. IEEE Transactions on Software Engineering, 13(8):905-912, August 1987.

Digital Library

[2]

Y. Artsy and R. Finkel Designing a process migration facility: The Charlotte experience. IEEE Computer, pages 47-56, September 1989.

Digital Library

[3]

Raymond M. Bryant and Raphael A. Finkel. A stable distributed scheduling algorithm. In 2rid International Conference on Distributed Computing Systems, pages 314-323, 1981.

[4]

Havio Bonomi and Anurag Kumar. Adaptive optimal load balancing in a nonhomogeneous multiserver system with a central job scheduler. IEEE Transactions on Computers, 39(10): 1232-1250, October 1990.

Digital Library

[5]

Avner Braverman, 1995. Personal Communication.

[6]

Amnon Barak, Guday Shai, and Richard G. Wheeler. The MOSIX Distributed Operating System:Load Balancing for UNIX Springer Vedag, Berlin, 1993.

Digital Library

[7]

Jeremy Casas, Dan L. Clark, Ravi Konuru, Steve W. Otto, Robert M. Prouty, and Jonathan Walpole. Mpvm: A migration transparent version of pvm. Computing Systems, 8(2):171-216, Spring 1995.

[8]

Thomas L. Casavant and Jon G. Kuhl. Analysis of three dynamic distributed load-balancing strategies with varying global informataon requirements. In 7th International Conference on Distributed Computing Systems, pages 185-192, September 1987.

[9]

Allen B. Downey and Mor Harchol-Balter A note on "The limited performance benefits of migrating active processes for load sharing". Technical Report UCB//CSD-95-888, University of California, Berkeley, November 1995.

Digital Library

[10]

Fred Douglis and John Ousterhout. Transparent process rmgration: Design alternatives and the sprite implementation. Software- Praeuce and Experience, 21(8).757-785, August 1991.

Digital Library

[11]

D.J. Evans and W U. N. Butt Dynamic load balancing using tasktransfer probablilites. Parallel Computing, 19:897-916, August 1993.

Digital Library

[12]

Derek L. Eager, Edward D. Lazowska, and Joht~ Zahorjan. Adaptive load sharing in homogeneous distributed systems. IEEE Transactions on Software Engineering, 12(5)'662-675, May 1986.

Digital Library

[13]

Derek L. Eager, Edward D. Lazowska, and John Zahorjan. The limited performance benefits of migrating active processes for load sharing. In S1GMETRICS, pages 662-675, May 1988.

Digital Library

[14]

G.W. Gerrity, A. Goscinski, J. Indulska, W. Toomey, and W. Zhu. RHODOS-a testbed for studying design issues in distributed operating systems, in Towards Network Globalization (SICON 91): 2nd intert~tional Conference on Networks, pages 268-274, September 1991.

[15]

Anna Ha6 and Xiaowei Jin. Dynamic load balancing in a distributed system using a sender-initiated algorithm. Journal of Systems Software, 11'79-94, 1990

Digital Library

[16]

John L Hennessy and David A. Patterson. Computer Architecture A Quantitative Approach. Morgan Kaufmann Publishers, San Mateo, CA, 1990

Digital Library

[17]

Phillip Krueger and Miron Livny. A comparison of preemptive and non-preemptive load distributing In 8th International Conference on Distributed Computing Systems, pages 123-130, June 1988.

[18]

Thomas Kunz. The influence of different workload descriptions on a heuristic load balancing scheme. IEEE Transactions on Software Engineering, I7(7):725-730, July 1991.

Digital Library

[19]

M. Litzkow and M. Livny. Experience with the Condor distributed batch system. In IEEE Workshop on Experimental Distributed Systems, pages 9%101, 1990.

[20]

M.J. Litzkow, M. Livny, and M.W. Mutka. Condor - a hunter of idle workstations. In 8th International Conference on Distributed Computing Systems, June 1988.

[21]

Miron Livny and Myron Melman. Load balancing in homogeneous broadcastdistributed systems In ACM Computer Network Perfor. mance Symposium, pages 47-55, April 1982.

Digital Library

[22]

W.E. Leland and T. J. Ott. Load-balancing heuristics and process behavior. In Proceedings of Performance and ACM Sigmetrics, volume 14, pages 54--69, 1986.

Digital Library

[23]

Hwa-Chun Lin and C.S. Raghavendra. A state-aggregation method for analyzing dynamic load-balancing policies. In IEEE 13th International Conference on Distributed Computing Systems, pages 482--489, May 1993.

[24]

Raw Mirchandaney, Don Towsley, and John A. Stankovic. Adaptive load sharing in heterogeneous distributed systems. Journal of Parallel and Distributed Computing, 9:331-346, 1990.

Digital Library

[25]

Mark Nuttall. Survey of systems providing process or object migration. Technical Report DOC94/10, Imperial College Research Report, 1994.

[26]

M.L. Powell and B.P. Miller. Process migrations in DEMOS/MP In ACM-SIGOPS 6th ACM Symposium on Operating Systems Principles, pages I 10-119, November 1983.

Digital Library

[27]

S'piridon Pulidas, Don Towsley, and John A. Stankovic. Imbedding gradient estimators in load balancing algorithms. In 8th International Conference on Distributed Computing Systems, pages 482-490, June 1988.

[28]

C Gary Rommel. The probability of load balancing success in a homogeneous network. IEEE Transactions on Software Engineering, 17:922-933, 1991.

Digital Library

[29]

Robert E Rosin. Determining a computing center environment. Communications of the ACM, 8(7), 1965.

Digital Library

[30]

A. Silberschatz, J.L. Peterson, and P.B. Galvin. Operating System Concepts, 4th Edition. Addison-Wesley, Reading, MA, 1994.

Digital Library

[31]

Anders Svensson. History, an intelligent load sharing filter. In IEEE lOth International Conference on Distributed Computing Systems, pages 546-553, 1990.

[32]

G. Thiel. Locus operating system, a transparent system. Computer Communications, 14(6):336-346, 1991.

Digital Library

[33]

Marvin M. Theimer, Keith A. Lantz, and David R Cheriton. Preemptable remote execution facilities for the V-System. In ACM-SIGOPS lOth ACM Symposium on Operating Systems Principles, pages 2-I2, December 1985.

Digital Library

[34]

A.S. Tanenbaum, R. van Renesse adn H. van Staveren, and G.J. Sharp. Experiences with the Amoeba distributed operating system. Communications of the ACM, pages 336-346, December 1990.

Digital Library

[35]

Amin Vahdat, 1995. Personal Communication

[36]

Amin M. Vahdat, Douglas P. Ghormtey, and Thomas E Anderson. Eftieient,portable, and robust extension of operating system functionality. Technical Report UCB//CSD-94-842, University of California, Berkeley, 1994.

Digital Library

[37]

Yung-Terng Wang and Robert J.T. Morris. Load sharing in distributed systems. IEEE Transactions on Computers, c-94(3):204-217, March 1985.

[38]

J. Wang, S. Zhou, K.Ahmed, and W. Long. LSBATCH: A distributed load ~hafing batch system. Tochnical Roport C8RI-286, Computer Systems Research Institute, University of Toronto, April 1993.

[39]

E.R. Zayas. Attacking the process migration bottleneck. In ACM- SIGOPS llth ACM Symposium on Operating Systems Principles, pages 13-24, 1987.

Digital Library

[40]

Songnian Zhou. Performance studies for dynamic load balancing in distributed systems. PhD Dissertation, University of California, Berkeley, 1989.

[41]

S Zhou, J. Wang, X. Zheng, and P. Delisle. Utopia: a load-sharing faeitlity for large heterogeneous distributed computing systems. Software - Practice and Expeience, 23(2): 1305-1336, December 1993.

Digital Library

Cited By

Behrouzi-Far ASoljanin E(2022)Balanced Nonadaptive Redundancy SchedulingIEEE Journal on Selected Areas in Information Theory10.1109/JSAIT.2022.31976753:2(422-430)Online publication date: Jun-2022
https://doi.org/10.1109/JSAIT.2022.3197675
Harchol-Balter M(2021)Open problems in queueing theory inspired by datacenter computingQueueing Systems: Theory and Applications10.1007/s11134-020-09684-697:1-2(3-37)Online publication date: 27-Jan-2021
https://dl.acm.org/doi/10.1007/s11134-020-09684-6
Ghalami LGrosu D(2019)Scheduling parallel identical machines to minimize makespan:A parallel approximation algorithmJournal of Parallel and Distributed Computing10.1016/j.jpdc.2018.05.008133(221-231)Online publication date: Nov-2019
https://doi.org/10.1016/j.jpdc.2018.05.008
Show More Cited By

Index Terms

Exploiting process lifetime distributions for dynamic load balancing

Recommendations

Exploiting process lifetime distributions for dynamic load balancing

We consider policies for CPU load balancing in networks of workstations. We address the question of whether preemptive migration (migrating active processes) is necessary, or whether remote execution (migrating processes only at the time of birth) is ...
Exploiting process lifetime distributions for dynamic load balancing
SIGMETRICS '96: Proceedings of the 1996 ACM SIGMETRICS international conference on Measurement and modeling of computer systems

We measure the distribution of lifetimes for UNIX processes and propose a functional form that fits this distribution well. We use this functional form to derive a policy for preemptive migration, and then use a trace-driven simulator to compare our ...
Exploiting Process Lifetime Distributions for Dynamic Load Balancing

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

95
Total Citations
View Citations
769
Total Downloads

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

Reflects downloads up to 09 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

Behrouzi-Far ASoljanin E(2022)Balanced Nonadaptive Redundancy SchedulingIEEE Journal on Selected Areas in Information Theory10.1109/JSAIT.2022.31976753:2(422-430)Online publication date: Jun-2022
https://doi.org/10.1109/JSAIT.2022.3197675
Harchol-Balter M(2021)Open problems in queueing theory inspired by datacenter computingQueueing Systems: Theory and Applications10.1007/s11134-020-09684-697:1-2(3-37)Online publication date: 27-Jan-2021
https://dl.acm.org/doi/10.1007/s11134-020-09684-6
Ghalami LGrosu D(2019)Scheduling parallel identical machines to minimize makespan:A parallel approximation algorithmJournal of Parallel and Distributed Computing10.1016/j.jpdc.2018.05.008133(221-231)Online publication date: Nov-2019
https://doi.org/10.1016/j.jpdc.2018.05.008
Chung APark JGanger G(2018)StratusProceedings of the ACM Symposium on Cloud Computing10.1145/3267809.3267819(121-134)Online publication date: 11-Oct-2018
https://dl.acm.org/doi/10.1145/3267809.3267819
Khan SWilkerson CWang ZAlameldeen ALee DMutlu OHunter HMoreno JEmer JSanchez D(2017)Detecting and mitigating data-dependent DRAM failures by exploiting current memory contentProceedings of the 50th Annual IEEE/ACM International Symposium on Microarchitecture10.1145/3123939.3123945(27-40)Online publication date: 14-Oct-2017
https://dl.acm.org/doi/10.1145/3123939.3123945
Meza JWu QKumar SMutlu O(2015)Revisiting Memory Errors in Large-Scale Production Data CentersProceedings of the 2015 45th Annual IEEE/IFIP International Conference on Dependable Systems and Networks10.1109/DSN.2015.57(415-426)Online publication date: 22-Jun-2015
https://dl.acm.org/doi/10.1109/DSN.2015.57
Harchol‐Balter MCochran JCox LKeskinocak PKharoufeh JSmith J(2011)Queueing DisciplinesWiley Encyclopedia of Operations Research and Management Science10.1002/9780470400531.eorms0699Online publication date: 15-Feb-2011
https://doi.org/10.1002/9780470400531.eorms0699
Kochut ABeaty KShaikh HShea D(2010)Desktop workload study with implications for desktop cloud resource optimization2010 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum (IPDPSW)10.1109/IPDPSW.2010.5470723(1-8)Online publication date: Apr-2010
https://doi.org/10.1109/IPDPSW.2010.5470723
Yoongu Kim Dongsu Han Mutlu OHarchol-Balter M(2010)ATLAS: A scalable and high-performance scheduling algorithm for multiple memory controllersHPCA - 16 2010 The Sixteenth International Symposium on High-Performance Computer Architecture10.1109/HPCA.2010.5416658(1-12)Online publication date: Jan-2010
https://doi.org/10.1109/HPCA.2010.5416658
Kochut A(2009)Power and performance modeling of virtualized desktop systems2009 IEEE International Symposium on Modeling, Analysis & Simulation of Computer and Telecommunication Systems10.1109/MASCOT.2009.5366785(1-10)Online publication date: Sep-2009
https://doi.org/10.1109/MASCOT.2009.5366785
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