An effective load balancing policy for geometric-decaying algorithms

Journal of Parallel and Distributed Computing

Volumn 36, Issue 2, 1996, Pages 185-188

  Gil, Joseph ^a   Matias, Yossi ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030210608     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1006/jpdc.1996.0098     Document Type: Article

References (19)

1. 1. O. Berkman, P. B. Gibbons, and Y. Matias, On the power of randomization for the Common PRAM. Proc. 4th Israel Symp. on Theory of Comp. and Sys., Jan 1995, pp. 229-240.
2. 2. A. Borodin, J. E. Hopcroft, M. S. Paterson, W. L. Ruzzo, and M. Tompa, Observations concerning synchronous parallel models of computation. Manuscript, 1980.
3. 3. R. P. Brent, The parallel evaluation of general arithmetic expressions. J. Assoc. Comput. Mach. 21, 201-208 (1974).
4. 4. R. Cole and U. Vishkin, Faster optimal parallel prefix sums and list ranking. Inform. and Comput. 81, 334-352 (1989).
5. 5. P. B. Gibbons, Y. Matias, and V. Ramachandran, Efficient low-contention parallel algorithms. 6th ACM Symp. on Parallel Algorithms and Architectures, June 1994, pp. 236-247.
6. 6. J. Gil, Renaming and dispersing: Techniques for fast load balancing. J. Parallel Distrib. Comput. 23(2), 149-157 (Nov. 1994).
7. 7. J. Gil and Y. Matias, Fast hashing on a PRAM - Designing by expectation. Proc. 2nd ACM-SIAM Symp. on Discrete Algorithms, Jan. 1991, pp. 271-280.
8. 8. J. Gil and Y. Matias, Designing algorithms by expectations. Inform. Process. Lett. 51(1), 31-34 (1994).
9. 9. J. Gil, Y. Matias, and U. Vishkin, Towards a theory of nearly constant time parallel algorithms. Proc. 32nd IEEE Symp. on Foundations of Computer Science, Oct. 1991, pp. 698-710.
10. 10. M. T. Goodrich, Using approximation algorithms to design parallel algorithms that may ignore processor allocation. Proc. 32nd IEEE Symp. on Foundations of Computer Science, 1991, pp. 711-722.
11. 11. T. Hagerup, Fast deterministic processor allocation. Proc. 4th ACM-SIAM Symp. on Discrete Algorithms, 1993, pp. 1-10.
12. 12. T. Hagerup and T. Radzik, Every robust CRCW PRAM can efficiently simulate a Priority PRAM. 2nd ACM Symp. on Parallel Algorithms and Architectures, 1990, pp. 117-124.
13. 13. J. JáJá, Introduction to Parallel Algorithms. Addison-Wesley, Reading, MA, 1992.
14. 14. R. M. Karp and V. Ramachandran, Parallel algorithms for shared-memory machines. In J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, Vol. A, pp. 869-941. North-Holland, Amsterdam, 1990.
15. 15. R. E. Ladner and M. J. Fischer, Parallel prefix computation. J. Assoc. Comput. Mach. 27, 831-838 (1980).
16. 16. Y. Matias, Highly parallel randomized algorithmics. Ph.D. thesis, Tel Aviv Univ., Tel Aviv 69978, Israel, 1992.
17. 17. Y. Matias and U. Vishkin, Converting high probability into nearly-constant time - With applications to parallel hashing. Proc. 23rd ACM Symp. on Theory of Computing, May 1991, pp. 307-316.
18. 18. J. H. Reif (Ed.), A Synthesis of Parallel Algorithms. Morgan-Kaufmann, San Mateo, CA, 1993.
19. 2 lg n) parallel Max-Flow algorithm. J. Algorithms 3, 128-146 (1982).