Fast load balancing on a PRAM

Proceedings of the 3rd IEEE Symposium on Parallel and Distributed Processing 1991

Volumn , Issue , 1991, Pages 10-17

  Gil, J ^a  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

PROBABILITY DISTRIBUTIONS;

CONSTANT TIME; INDEPENDENT TASKS; LOAD BALANCING ALGORITHMS; MODEL OF COMPUTATION; PRAM MODELS; SINGLE PROCESSORS; WRITE OPERATIONS;

PARALLEL PROCESSING SYSTEMS;

EID: 33947153168     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SPDP.1991.218302     Document Type: Conference Paper

References (27)

1. P. Beame and J. Hastad. Optimal bounds foi decision problems on the CRCW PRAM. In STOC '87, pages 83-93, 1987.
2. O. Berkman, D. Breslauer, Z. Galil, B. Schieber, and U. Vishkin. Highly paiallelizable problems. In STOC '89, 1989.
3. O. Berkman and U. Vishkin. Recursive-tree parallel data-structure. In FOCS '89, pages 196-202, 1989.
4. R. P. Brent. The parallel evaluation of general arithmetic expressions./. A CM, 21:302-206, 1974.
5. B. S. Chlebus, K. Diks, T. Hagerup, and T. Radzik. Efficient simulations between concurrent-read concurrent-write PRAM models. In MFCS '88, pages 231-239, 1988.
6. B. S. Chlebus, K. Diks, T. Hagerup, and T. Radzik. New simulations between CRCW PRAMs. In FCT '89, pages 95-104, 1989.
7. R. Cole. Parallel merge sort. In FOCS '86, pages 511-516, 1986.
8. R. Cole and U. Vishkin. Approximate and exact parallel scheduling with applications to list, tree and graph problems. In FOCS '86, pages 478-491, 1986.
9. R. Cole and U. Vishkin. Deterministic coin tossing with applications to optimal parallel list ranking. Information and Control, 70:32-53, 1986.
10. R. Cole and U. Vishkin. Faster optimal parallel prefix sums and list ranking. Info. Comp., 81:334-352, 1989.
11. S. A. Cook, C. Dwork, and R. Reischuk. Upper and lower time bounds for parallel random access machines without simultaneous writes. SIAM J. Corn-put., 15:87-97, 1986.
12. F. E. Fich, P. L. Ragde, and A. Wigderson. Relations between concurrent-write models of parallel computation. SIAM J. Comput, 17:606-627, June 1988.
13. M. J. Fisher and R. E. Ladner. Parallel prefix computation. J. ACM, 27:831-838, 1980.
14. J. Gil. Lower Bounds and Algorithms for Hashing and Parallel Processing. PhD thesis, The Hebrew University of Jerusalem, Israel, Nov. 1990.
15. J. Gil and Y. Matias. Fast hashing on a PRAM. In SODA '91, pages 271-280, Jan. 1991.
16. J. Gil, Y. Matias, and U. Vishkin. Towards a theory of nearly constant time parallel algorithms. In FOCS '91, Oct. 1991.
17. J. Gil, F. Meyer, D Heide, and A. Wigderson. Not all keys can be hashed in constant time. In STOC '90, pages 244-253, 1990.
18. J. Gil and L. Rudolph. Counting and packing in parallel. In ICPP '86, pages 1000-1002, 1986.
19. V. Grolmusz and P. L. Ragde. Incomparability in parallel computation. In FOCS '87, pages 89-98, 1987.
20. T. Hagerup. Private communication, Nov. 1990.
21. T. Hagerup and T. Radzik. Every robust CRCW PRAM can efficiently simulate a Priority PRAM. In SPAA '90, pages 117-124, 1990.
22. C. Kruskal. Searching, merging, and sorting in parallel computation. IEEE Trans, on Comp, C-32:942-946, 1983.
23. Y. Matias and U. Vishkin. On parallel hashing and integer sorting. In ICALP '90, pages 729-743, 1990. Also to appear in Journal of Algorithms.
24. P. L. Ragde. The parallel simplicity of compaction and chaining. In ICALP '90, pages 744-751, 1990.
25. Y. Shiloach and U. Vishkin. Finding the maximum, merging, and sorting in a parallel computation model./. Algorithms, 2:88-102, 1981.
26. L. Valiant. Parallelism in comparison problems. SIAM J. Comput., 4:348-355, 1975.
27. D. Willard. Log-logarithmic selection resolution protocols in a multiple access channel. SIAM J. Comput., 15:468-477, 1986.