Dynamic load balancing in parallel and distributed networks by random matchings (extended abstract)

Proceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1994

Volumn , Issue , 1994, Pages 226-235

  Ghosh, Bhaskar ^a   Muthukrishnan, S ^b  

^a YALE UNIVERSITY   (United States)

^b NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FINITE ELEMENT METHOD; MEMORY ARCHITECTURE; MESH NETWORKING; NETWORK ARCHITECTURE; PARALLEL ALGORITHMS; PARALLEL ARCHITECTURES; PARALLEL PROCESSING SYSTEMS;

ARBITRARY TOPOLOGY; ASYMPTOTICALLY OPTIMAL; DISTRIBUTED NETWORKS; DYNAMIC GENERATION; EXTENDED ABSTRACTS; LOAD DISTRIBUTIONS; PROCESSOR NETWORKS; TASK REALLOCATION;

PROBLEM SOLVING;

EID: 45449103550     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/181014.181366     Document Type: Conference Paper

References (29)

1. [AA+93] W. Aiello, B. Awerbuch, B. Maggs, and S. Rao. Approximate Load Balancing on Dynamic and Asynchronous Networks. In Proc. of 25th ACM Symp on Theory of Computing, 632-641, May 1993.
2. [AB92] Y. Aumann and M. Ben-Or. Computing with Faulty Arrays. In Proc of 24th ACM Symp on Theory of Computing, 162-169, May 1992.
3. [AHS91] J. Aspnes, M. Herlihy and N. Shavit. Counting Networks and Multiprocessor coordination. In Proc of 23rd ACM Symp on Theory of Computing, 348-358, May 1991.
4. [B87] B. Bollobas. Random Graphs. Academic Press, New York. 1987.
5. [BB87] M. J. Berger and S. H. Bokhari. A Partitioning Strategy for Nonuniform Problems on Multiprocessors. IEEE Trans, on Computers, Vol. C-36, No. 5, 570-580, 1987.
6. [CA87] G. Cybenko and T. G. Allen. Parallel Algorithms for Classification and Clustering. In Proc. SPIE Conference on Advanced Architectures and Algorithms for Signal Processing, San Diego, CA 1987.
7. [C89] G. Cybenko. Dynamic Load Balancing for Distributed Memory Multiprocessors. Journal of Parallel and Distributed Computing, Vol. 2, No. 7, 279-301, 1989.
8. [F93] R. Feldmann. Game Tree Search on Massively Parallel Systems. PhD Thesis, Dept. of Mathematics and Computer Science, University of Paderborn. August 1993.
9. [FG91] M. Factor and D. Gelernter. Software Backplanes, Realtime Data Fusion and the Process Trellis. Research Report YALEU/DCS/TR-852, Yale Computer Science Department, March 1991.
10. [GH89] B. Goldberg and P. Hudak. Implementing Functional Programs on a Hypercube Multiprocessor. In Proc. of the 4th Conference on Hypercubes, Concurrent Computers and Applications, Vol. 1, 489-503, 1989.
11. [HCT89] J. Hong, M. Chen and X. Tan. Dynamic Cyclic Load Balancing on Hypercubes. In Proc. of the 4th Conference on Hypercubes, Concurrent Computers and Applications, Vol. 1, 595-598, 1989.
12. [HLS92] M. Herlihy, B. Lim, and N. Shavit. Low contention load balancing on large-scale multiprocessors. In Proc. of 4th ACM Symp on Parallel Algorithms and Architectures, 219-227, 1992.
13. [HT93] A. Heirich and S. Taylor. A Parabolic Theory of Load Balance. Research Report Caltech-CS-TR-93-25, Caltech Scalable Concurrent Computation Lab, March 1993.
14. [K88] L. V. Kale. Comparing the Performance of Two Dynamic Load Distribution Methods. In Proc. of International Conference on Parallel Processing, Vol. 1, August 1988.
15. [KZ88] R. Karp and Y. Zhang. A randomized parallel branch-and-bound procedure. In Proc. of 20th ACM Symp on Theory of Computing, 290-300, 1988.
16. [LK87] F. C. H. Lin and R. M. Keller. The Gradient Model Load Balancing Method. IEEE Transactions on Software Engineering, Vol. 13, No. 1, 32-38, 1987.
17. [LM93] R. Lueling and B. Monien. A Dynamic Distributed Load Balancing Algorithm with Provable Good Performance. In Proc. of 5th ACM Symp on Parallel Algorithms and Architectures, 164-172, 1993.
18. [LMR91] R. Lueling, B. Monien and F. Ramme. Load Balancing in Large Networks: A Comparative Study. In Proc. of IEEE Symp on Parallel and Distributed Computing, Dallas, 1991.
19. [LN+89] T. Leighton, M. Newman, A. Ranade and E. Schwabe. Dynamic tree embeddings on butterflies and hypercubes. In Proc. of 1st ACM Symp on Parallel Algorithms and Architectures, 224-234, 1989.
20. [M89] M. Mihail. Conductance and Convergence of Markov Chains - A Combinatorial Treatment of Expanders. In Proc. of 30th IEEE Symp on Foundations of Computer Science, 526-531, October 1989.
21. [MP92] B. Mohar and S. Poljak. Eigenvalues in Combinatorial Optimization. Research Report 92752, IMA, Minneapolis, 1992.
22. [N92] D. Nicol. Communication Efficient Global Load Balancing. In Proc. of Scalable High Performance Computing Conference, 292299. Williamsburg, VA. April 1992.
23. [NX+85] L. M. Ni, C. W. Xu and T. B. Gendreau. Drafting Algorithm - A Dynamic Process Migration Protocol for Distributed Systems. In Proc. of Int. Conf. on Distributed Computing Systems, 539-546, 1985.
24. [P89] C. G. Plaxton. Load Balancing, Selection and Sorting on the Hypercube. Proc. of 1st ACM Symp on Parallel Algorithms and Architectures, 64-73, 1989.
25. [PU89] D. Peleg and E. Upfal. The token distribution problem. SIAM J. on Computing, Volume 18, 229-243, 1989.
26. [R89] M. O. Rabin. Efficient dispersal of information for security, load balancing and fault tolerance. Journal of the ACM, Vol. 36, No. 3, 335-348, 1989.
27. [R91] A. Ranade. Optimal speedup for backtrack search on a butterfly network. In Proc. 3rd ACM Symp on Parallel Algorithms and Architectures, 40-49, 1991.
28. [RSU91] L. Rudolph, M. Slivkin-Allalouf, and E. Upfal. A simple load balancing scheme for task allocation in parallel machines. In Proc. 3rd ACM Symp on Parallel Algorithms and Architectures, 237-243, 1991.
29. [W91] R. D. Williams. Performance of dynamic load balancing algorithms for unstructured mesh calculations. Concurrency: Pracice and Experience, Vol. 3, No. 5, 457-481, 1991.