Article

Free access

Parallel continuous randomized load balancing (extended abstract)

Authors:

Petra Berenbrink,

Tom Friedetzky,

Ernst W. MayrAuthors Info & Claims

SPAA '98: Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures

Pages 192 - 201

https://doi.org/10.1145/277651.277685

Published: 01 June 1998 Publication History

PDF eReader

References

[1]

Y. Azar, A. Z. Broder, A. R. Karlin, and E. Upfai. Balanced allocations (extended abstract). In Proceedings of the Twenty-Sixth Annual A CM Symposium on Theory of Computing, pages 593- 602, Montreal, Quebec, Canada, 23-25 May 1994.

Digital Library

Google Scholar

[2]

Micah Adler, Soumen Chakrabarti, Michael Mitzenmacher, and Lars Rasmussen. Parallel randomized load balancing. In Proceedings of the 27th Annual Symposium on Theory of Computing, pages 238-247, New York, NY, USA, May 29-June 1 1995. ACM Press.

Digital Library

Google Scholar

[3]

P. Berenbrink, F. Meyer auf der Heide, and K. Schr5der. Allocating weighted balls in parallel. In Proceedings of the 9th annual Symphosium on Parallel Algorithms and Architectures. ACM, 1997.

Digital Library

Google Scholar

[4]

Artur Czumaj and Volker Stemann. Randomized allocation processes. In Proceedings of the 38th IEEE Symposium on Foundations of Computer Science. IEEE, 1997.

Digital Library

Google Scholar

[5]

S.K. Das, D. J. Harvey, and R. Biswas. Design of novel load balancing algorithms with implementations on an ibm sp2. In Proc. o/the 3rd EURO-PAR Conference, 1997.

Digital Library

Google Scholar

[6]

C.-J. Hou and K. G. Shin. Implementation of decentralized load sharing in networked workstations using the Condor package. Journal of Parallel and Distributed Computing, 40:173-184, 1997.

Digital Library

Google Scholar

[7]

Thomas Lauer. Adaptive Dynamische Lastbalancierung. PhD thesis, Universit#it des Saarlandes, 1995.

Google Scholar

[8]

Reinhard Liiling and Burkhard Monien. A dynamic distributed load balancing algorithm with provable good performance, in Proceedings of the 5th Annual A CM Symposium on Parallel Algorithms and Architectures, pages 164-172. ACM Press, 1993.

Digital Library

Google Scholar

[9]

N.R. Mahapatra and S. Dutt. Random seeking: A general, efficient, and informed randomized scheme for dynamic load balancing. In Proc. o/ the 10th International Parallel Processing Symposium (IPPS), pages pages 881-885, 1996.

Digital Library

Google Scholar

[10]

M. Mitzenmacher. Load balancing and density dependent jump markov processes, in Proceedings of 37th Annual Symposium on Foundations o/Computer Science, pages 213-223. IEEE, oct 1996.

Digital Library

Google Scholar

[11]

Michael Mitzenmacher. On the analysis of randomized load balancing schemes. In Proceedings of the 9th annual Symphosium on Parallel Algorithms and Architectures. ACM, 1997.

Digital Library

Google Scholar

[12]

Friedhelm Meyer auf der Heide, Christian Scheideler, and Volker Stemann. Exploiting storage redundancy to speed up randomized shared memory simulations. In Proceedings of the 12th Annual Symposium on Theoretical Aspects of Computer Science, pages 267-278. Springer, 1995.

Google Scholar

[13]

L. Rudolph, M. Slivkin-Allalouf, and E. Upfal. A simple load balancing scheme for task allocation in parallel machines. In Proceedings o/the 3rd Annual A CM Symposium on Parallel Algorithms and Architectures, pages 237-245. ACM Press, 1991.

Digital Library

Google Scholar

[14]

T. Schnekenburger and G. Stellner. Dynamic Load Distribution .for Parallel Applications. Teubner, 1997.

Crossref

Google Scholar

[15]

Volker Stemann. Parallel balanced allocations. In Proceedings of the 8th Annual A CM Symposium on Parallel Algorithms and Architectures (SPAA '96), pages 261-269. ACM, 1996.

Digital Library

Google Scholar

[16]

G.S. Wolffe, S. H. Hosseini, and K. Vairavan. Performance of an adaptive algorithm for dynamic load balancing. In Proc. o/the ISCA International Conference on Parallel and Distributed Computing Systems, pages 613-618, 1995.

Google Scholar

Cited By

View all

Berenbrink PFriedetzky TMartin R(2007)On the Stability of Dynamic Diffusion Load BalancingAlgorithmica10.1007/s00453-007-9081-y50:3(329-350)Online publication date: 1-Nov-2007
https://doi.org/10.1007/s00453-007-9081-y
Charpentier MPadiou GQueinnec P(2005)Cooperative Mobile Agents to Gather Global InformationProceedings of the Fourth IEEE International Symposium on Network Computing and Applications10.1109/NCA.2005.13(271-274)Online publication date: 27-Jul-2005
https://dl.acm.org/doi/10.1109/NCA.2005.13
Berenbrink PFriedetzky TMartin R(2005)Dynamic diffusion load balancingProceedings of the 32nd international conference on Automata, Languages and Programming10.1007/11523468_112(1386-1398)Online publication date: 11-Jul-2005
https://dl.acm.org/doi/10.1007/11523468_112
Show More Cited By

Index Terms

Parallel continuous randomized load balancing (extended abstract)
1. Software and its engineering
  1. Software notations and tools
    1. General programming languages
      1. Language types
        Concurrent programming languages
        Distributed programming languages
        Parallel programming languages
  2. Software organization and properties
    1. Contextual software domains
      1. Operating systems
        Process management

Recommendations

Randomized Hydrodynamic Load Balancing Approach
ICPPW '08: Proceedings of the 2008 International Conference on Parallel Processing - Workshops

Load balancing is performed to achieve the optimal use of the existing computational resources as much as possible whereby none of the resources remains idle while some other resources are being utilized. Balanced load distribution can be achieved by ...
Parallel Randomized Load Balancing: A Lower Bound for a More General Model
SOFSEM '10: Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science

We extend the lower bound of Adler et. al [1] and Berenbrink [2] for parallel randomized load balancing algorithms.

The setting in these asynchronous and distributed algorithms is of n balls and n bins. The algorithms begin by each ball choosing d ...
Discrete load balancing is (almost) as easy as continuous load balancing
PODC '10: Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing

We consider the problem of diffusion-based load balancing on a distributed network with n processors. If the load is arbitrarily divisible, then the convergence is fairly well captured in terms of the second largest eigenvalue of the diffusion matrix. ...

Comments

Information & Contributors

Information

Published In

SPAA '98: Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures

June 1998

312 pages

ISBN:0897919890

DOI:10.1145/277651

Chairmen:
Gary Miller
Carnegie Mellon Univ., Pittsburgh, PA
,
Phillip B. Gibbons
Bell Labs

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 June 1998

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SPAA/PODC98

Sponsor:

SPAA/PODC98: 10th Annual ACM Symposium on Parallel Algorithms and Architectures/Symposium on Principles of Distributed Computing

June 28 - July 2, 1998

Puerto Vallarta, Mexico

Acceptance Rates

SPAA '98 Paper Acceptance Rate 30 of 84 submissions, 36%;

Overall Acceptance Rate 447 of 1,461 submissions, 31%

Upcoming Conference

SPAA '25

Sponsor:
sigact
sigact

37th ACM Symposium on Parallelism in Algorithms and Architectures

July 28 - August 1, 2025

Portland , OR , USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5
Total Citations
View Citations
403
Total Downloads

Downloads (Last 12 months)26
Downloads (Last 6 weeks)5

Reflects downloads up to 16 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Berenbrink PFriedetzky TMartin R(2007)On the Stability of Dynamic Diffusion Load BalancingAlgorithmica10.1007/s00453-007-9081-y50:3(329-350)Online publication date: 1-Nov-2007
https://doi.org/10.1007/s00453-007-9081-y
Charpentier MPadiou GQueinnec P(2005)Cooperative Mobile Agents to Gather Global InformationProceedings of the Fourth IEEE International Symposium on Network Computing and Applications10.1109/NCA.2005.13(271-274)Online publication date: 27-Jul-2005
https://dl.acm.org/doi/10.1109/NCA.2005.13
Berenbrink PFriedetzky TMartin R(2005)Dynamic diffusion load balancingProceedings of the 32nd international conference on Automata, Languages and Programming10.1007/11523468_112(1386-1398)Online publication date: 11-Jul-2005
https://dl.acm.org/doi/10.1007/11523468_112
Berenbrink PFriedetzky TGoldberg L(2001)The natural work-stealing algorithm is stableProceedings 42nd IEEE Symposium on Foundations of Computer Science10.1109/SFCS.2001.959892(178-187)Online publication date: 2001
https://doi.org/10.1109/SFCS.2001.959892
Berenbrink PFriedetzky TSteger AMiller GRamachandran V(1999)Randomized and adversarial load balancingProceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures10.1145/305619.305638(175-184)Online publication date: 1-Jun-1999
https://dl.acm.org/doi/10.1145/305619.305638

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

Randomized Hydrodynamic Load Balancing Approach

Parallel Randomized Load Balancing: A Lower Bound for a More General Model

Discrete load balancing is (almost) as easy as continuous load balancing