Allocating weighted jobs in parallel

Theory of Computing Systems

Volumn 32, Issue 3, 1999, Pages 281-300

  Berenbrink, P ^a   Meyer Auf Der Heide, F ^a   Schroder K ^a  

^a UNIVERSITY OF PADERBORN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; MATHEMATICAL TECHNIQUES;

COMMUNICATION ROUNDS; COMPUTING-TASK; CONSTANT FACTORS; HIGH PROBABILITY; LOAD BALANCING PROBLEM; MULTIMEDIA SERVERS; RESOURCE REQUIREMENTS; WEIGHTED BALLS;

BINS;

EID: 0033432589     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s002240000119     Document Type: Article

References (19)

1. Y. Azar, A. Z. Broder, and A. R. Karlin. On-line load balancing. Theoretical Computer Science, 130:73-84, 1994. Preliminary version in FOCS 92.
2. Y. Azar, A. Z. Broder, A. R. Karlin, and E. Upfal. Balanced allocations (extended abstract). In Proceedings of the 26th ACM Symposium on Theory of Computing, pages 593-602, 1994.
3. M. Adler, P. Berenbrink, and K. Schröder. Analyzing an infinite parallel job allocation process. In Proceedings of the 6th Annual European Symposium on Algorithms, pages 417-428, 1998.
4. M. Adler, S. Chakrabarti, M. Mitzenmacher, and L. Rasmussen. Parallel randomized load balancing. In Proceedings of the 27th ACM Symposium on Theory of Computing, pages 238-247, 1995.
5. Y. Azar, B. Kakyanasundaram, S. Plotkin, K. R. Pruhs, and O. Waarts. On-line load balancing of temporary tasks. In Proceedings of the 3rd Workshop on Algorithms and Data Structures, pages 119-130, 1993.
6. P. Berenbrink, F. Meyer auf der Heide, and K. Schröder. Allocating weighted balls in parallel. In Proceedings of the 9th Annual ACM Symposium on Parallel Algorithms and Architectures, pages 302-310, 1997.
7. A. Czumaj. Recovery time of dynamic allocation processes. In Proceedings of the 10th Annual ACM Symposium on Parallel Algorithms and Architectures, pages 202-211, 1998.
8. A. Czumaj and V. Stemann. Randomized allocation processes. In Proceedings of the 37th IEEE Symposium on Foundations on Computer Science, pages 194-203, 1997.
9. M. Dietzfelbinger and F. Meyer auf der Heide. Simple efficient shared memory simulations. In Proceedings of the 5th Annual Symposium on Parallel Algorithms and Architectures, pages 110-119, 1993.
10. T. Hagerub and C. Rüb. A guided tour of Chernoff bounds. Information Processing Letters, 33:305-308, 1989.
11. R. Karp, M. Luby, and F. Meyer auf der Heide. Efficient PRAM simulations on a distributed memory machine. In Proceedings of the 24th ACM Symposium on Theory of Computing, pages 318-326, 1992.
12. M. Mitzenmacher. Density dependent jump Markov processes and applications to load balancing. In Proceedings of the 36th IEEE Symposium on Foundations of Computer Science, pages 213-222, 1996.
13. M. D. Mitzenmacher. The Power of Two Random Choices in Randomized Load Balancing. Ph.D. thesis, Graduate Division of the University of California at Berkley, 1996.
14. M. 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, 1997.
15. F. Meyer auf der Heide, C. Scheideler, and V. Stemann. Exploiting storage redundancy to speed up randomized shared memory simulations. Journal of Theoretical Computer Science, 162:245-281, 1996. Also appeared in Proceedings of the 12th Symposium on Theoretical Aspects of Computer Science, 1995.
16. F. Meyer auf der Heide, C. Scheideler, and V. Stemann. Exploiting storage redundancy to speed up randomized shared memory simulations. Journal of Theoretical Computer Science, 162:245-281, 1996. Also appeared in Proceedings of the 12th Symposium on Theoretical Aspects of Computer Science, 1995.
17. 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, 1993.
18. V. Stemann. Contention Resolution in Hashing Based Shared Memory Simulations. Ph.D. thesis, Heinz Nixdorf Institute, University of Paderborn, 1995. Appears in: HNI Verlagsschriftenreihe, Vol. 3.
19. V. Stemann. Parallel balanced allocations (extended abstract). In Proceedings of the 8th Symposium on Parallel Algorithms and Architectures, pages 261-269, 1996.