Abstract
In recent years the task of allocating jobs to servers has been studied with the “balls and bins” abstraction. Results in this area exploit the large decrease in maximum load that can be achieved by allowing each job (ball) a very small amount of choice in choosing its destination server (bin). The scenarios considered can be divided into two categories: sequential, where each job can be placed at a server before the next job arrives, and parallel, where the jobs arrive in large batches that must be dealt with simultaneously. Another, orthogonal, classification of load balancing scenarios is into fixed time and infinite. Fixed time processes are only analyzed for an interval of time that is known in advance, and for all such results thus far either the number of rounds or the total expected number of arrivals at each server is a constant. In the infinite case, there is an arrival process and a deletion process that are both defined over an infinite time line.
In this paper, we present an algorithm for allocating jobs arriving in parallel over an infinite time line. While there have been several results for the infinite sequential case, no analogous results exist for the infinite parallel case. We consider the process where m jobs arrive in each round to n servers, and each server is allowed to remove one job per round. We introduce a simple algorithm, where it is sufficient for each job to choose between 2 random servers, that obtains the following result: if m ≤ 6en , then for any given round, the probability that any job has to wait more than \( \mathcal{O} \)(log log n) rounds before being processed is at most 1=n α for any constant α. Furthermore, we analyze the distribution on waiting times: with the same probability, the number of jobs of any given round that have to wait t + c rounds to be processed is at most \( \mathcal{O} \) for a small constant c. These results are comparable with existing results for the infinite sequential case.
Supported by an operating grant from the Natural Sciences and Engineering Research Council of Canada, and by ITRC, an Ontario Centre of Excellence. This research was conducted in part while he was at the Heinz Nixdorf Institute Graduate College, Paderborn, Germany.
Supported by DFG-SFB 376 “Massive Parallelität”, and by EU ESPRIT Long Term Reseach Project 20244 (ALCOM-IT).
Supported by the DFG-Graduiertenkolleg “Parallele Rechnernetzwerke in der Produktionstechnik”, by DFG-SFB 376 “Massive Parallelität”, and by EU ESPRIT Long Term Reseach Project 20244 (ALCOM-IT).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Yossi Azar, Andrei Z. Broder, and Anna R. Karlin. On-line load balancing. Theoretical Computer Science, 130:73–84, 1994. A preliminary version appeared in FOCS 92.
Y. Azar, A. Z. Broder, A. R. Karlin, and E. Upfal. Balanced allocations. In Proceedings of the 26th ACM Symposium on Theory of Computing, pages 593–602, New York, 1994. ACM, ACM Press.
Micah Adler, Soumen Chakrabarti, Michael Mitzenmacher, and Lars Rasmussen. Parallel randomized load balancing. In Proceedings of the 27th ACM Symposium on Theory of Computing, pages 238–247, New York, USA, 1995. ACM, ACM Press.
AKP+93._Yossi Azar, Bala Kakyanasundaram, Serge Plotkin, Kirk R. Pruhs, and Orli Waarts. On-line load balancing of temporary tasks. In Proceedings of the 3rd Workshop on Algorithms and Data Structures, pages 119–130, 1993.
Petra Berenbrink, Friedhelm Meyer auf der Heide, and Klaus Schröder. Allocating weighted jobs in parallel. In Proceedings of the 9th Annual ACM Symposium on Parallel Algorithms and Architectures, pages 302–310, 1997.
Artur Czumaj and Volker Stemann. Randomized allocation processes. In Proceedings of the 38th IEEE Symposium on Foundations of Computer Science, pages 194–203, Miami Beach, FL, 1997. IEEE Computer Society Press, Los Alamitos.
Richard M. Karp, Michael Luby, and Friedhelm Meyer auf der Heide. Efficient PRAM simulation on a distributed memory machine. In Proceedings of the 24th ACM Symposium on Theory of Computing, 1992.
Thomas G. Kurtz. Approximation of Population Processes. Regional Conference Series in Applied Mathematics. CMBS-NSF, 1981.
Michael Mitzenmacher. Density dependent jump markov processes and applications to load balancing. In Proceedings of the 37th IEEE Symposium on Foundations of Computer Science, pages 213–223, 1996.
Michael Mitzenmacher. On the analysis of randomized load balancing schemes. In Proceedings of the 9th Annual ACM Symposium on Parallel Algorithms and Architectures, pages 292–301, Newport, Rhode Island, 1997.
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, 1995.
S. Phillips and J. Westbrook. Online load balancing and network flow. In Proceedings of the 25th ACM Symposium on Theory of Computing, pages 402–411. ACM, 1993.
Christian Scheideler and Berthold Voecking. Continuous Routing Strategies. In Proceedings of the 8th Annual ACM Symposium on Parallel Algorithms and Architectures, 1996.
Volker Stemann. Parallel balanced allocations. In Proceedings of the 8th Annual ACM Symposium on Parallel Algorithms and Architectures, pages 261–269, New York, USA, 1996. ACM.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Adler, M., Berenbrink, P., Schröder, K. (1998). Analyzing an Infinite Parallel Job Allocation Process. In: Bilardi, G., Italiano, G.F., Pietracaprina, A., Pucci, G. (eds) Algorithms — ESA’ 98. ESA 1998. Lecture Notes in Computer Science, vol 1461. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-68530-8_35
Download citation
DOI: https://doi.org/10.1007/3-540-68530-8_35
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64848-2
Online ISBN: 978-3-540-68530-2
eBook Packages: Springer Book Archive