Analyzing an infinite parallel job allocation process

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1461 LNCS, Issue , 1998, Pages 417-428

  Adler, Micah ^a   Berenbrink, Petra ^b   Schröder, Klaus ^b  

^a UNIVERSITY OF TORONTO   (Canada)

^b UNIVERSITY OF PADERBORN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ARRIVAL PROCESS; FIXED TIME; INFINITE TIME; JOB ALLOCATION; MAXIMUM LOAD; SIMPLE ALGORITHM; WAITING TIME;

PROBABILITY DISTRIBUTIONS;

EID: 84896744682     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-68530-8_35     Document Type: Conference Paper

References (14)

1. 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.
2. 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.
3. 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.
4. 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.
5. 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.
6. 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.
7. 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.
8. Thomas G. Kurtz. Approximation of Population Processes. Regional Conference Series in Applied Mathematics. CMBS-NSF, 1981.
9. 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.
10. 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.
11. 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.
12. 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.
13. Christian Scheideler and Berthold Voecking. Continuous Routing Strategies. In Proceedings of the 8th Annual ACM Symposium on Parallel Algorithms and Architectures, 1996.
14. 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.