Efficient low-contention parallel algorithms

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

Volumn , Issue , 1994, Pages 236-247

  Gibbons, Phillip B ^a   Matias, Yossi ^a   Ramachandran, Vijaya ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MEMORY ARCHITECTURE; PARALLEL ALGORITHMS;

COMPACTION ALGORITHMS; HIGH CONTENTIONS; LOAD BALANCING ALGORITHMS; LOGARITHMIC DEPENDENCE; MEMORY LOCATIONS; PARALLEL MACHINE; PROCESSOR ALLOCATION; RANDOM PERMUTATIONS;

PARALLEL ARCHITECTURES;

EID: 85027418327     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/181014.181382     Document Type: Conference Paper

References (37)

1. [AH92] S. Albers and T. Hageiup. Improved parallel integer sorting without concurrent writing. In Proc. of the Third ACM-SIAM Symposium on Discrete Algorithms, pages 463-472, January 1992.
2. [AKS83] M. Ajtai, J. Komlos, and E. Szemeredi. Sorting in clgn parallel steps. Combinatorica, 3(1):1-19, 1983.
3. [BCH+93] G. E. Blelloch, S. Chatterjee, J. C. Hardwick, J. Sipelstein, and M. Zagha. Implementation of a portable nested data-parallel language. In Proc. 4th ACM SIGPLAN Symp. on Principles and Practices of Parallel Programming, pages 102111, May 1993.
4. [BKK93] P. Beame, M. Kik, and M. Kutylowski. Information broadcasting by exclusive-write PRAMs. Parallel Processing Letters, 1993. To appear.
5. [Ble89] G. E. Blelloch. Scans as primitive parallel operations. IEEE Trans, on Computers, C- 38(11):1526-1538, 1989.
6. [BM76] J. A. Bondy and U. S. R. Murty. Graph Theory with Applications. Elsevier Science Publishing Co., Inc., New York, 1976.
7. [BMV92] O. Berkman, Y. Matias, and U. Vishkin. Randomized range-maxima in nearly-constant parallel time, computational complexity, 2:350-373, 1992.
8. [Bre74] R. P. Brent. The parallel evaluation of general arithmetic expressions. Journal of the ACM, 21(2):201-208, 1974.
9. [Chl89] B.S. Chlebus. Parallel iterated bucket sort. Information Processing Letters, 31:181-183, 1989.
10. [C0I88] R. Cole. Parallel merge sort. SIAM Journal on Computing, 17(4):770-785, 1988.
11. [CV89] R. Cole and U. Vishkin. Faster optimal parallel prefix sums and list ranking. Information and Computation, 81:334-352, 1989.
12. [DM90] M. Dietzfelbinger and F. Meyer auf der Heide. A new universal class of hash functions and dynamic hashing in real time. In Proc. of 11th International Colloquium on Automata Languages and Programming, Springer LNCS 443, pages 619, 1990.
13. [FKS84] M.L. Fredman, J. Komlos, and E. Szemeredi. Storing a sparse table with O(1) worst case access time. Journal of the ACM, 31(3):538-544, July 1984.
14. [GU91] J. GO. Fast load balancing on a PRAM. In Proc. of the 3rd IEEE Symposium on Parallel and Distributed Computing, pages 10-17, December 1991.
15. [GM91] J. Gil and Y. Matias. Fast hashing on a PRAM- designing by expectation. In Proc. of the Second ACM-SIAM Symposium on Discrete Algorithms, pages 271-280, 1991.
16. [GM94a] J. Gil and Y. Matias. Simple fast parallel hashing. In Proc. of Slst International Colloquium on Automata Languages and Programming, Springer LNCS, to appear, July 1994.
17. [GM94b] J. Gil and Y. Matias. Simple fast parallel hashing by oblivious execution. Technical report, AT&T Bell Laboratories, Murray Hill, NJ, 1994. Submitted for publication.
18. [GMR94] P. B. Gibbons, Y. Matias, and V. Ramachan- dran. The QRQW PRAM: Accounting for contention in parallel algorithms. In Proc. 5th ACM- SIAM Symp. on Discrete Algorithms, pages 638648, January 1994.
19. [GMV91] J. Gil, Y. Matias, and U. Vishkin. Towards a theory of nearly constant time parallel algorithms. In Proc. 32nd IEEE Symp. on Foundations of Computer Science, pages 698-710, October 1991.
20. [Hag89] T. Hagerup. Hybridsort revisited and parallelized. Information Processing Letters, 32:3539, 1989.
21. [Hag9l] T. Hagerup. Fast parallel generation of random permutations. In Proc. of 18th International Colloquium on Automata Languages and Programming, Springer LNCS 510, pages 405-416, 1991.
22. [JaJ92] J. Jaja. An Introduction to Parallel Algorithms. Addison-Wesley, Reading, MA, 1992.
23. [KR90] R. M. Karp and V. Ramachandran. Parallel algorithms for shared-memory machines. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Volume A, pages 869-941. Elsevier Science Publishers B.V., Amsterdam, The Netherlands, 1990.
24. [KRS90] C. P. Kruskal, L. Rudolph, and M. Snir. A complexity theory of efficient parallel algorithms. Theoretical Computer Science, 71:95-132, 1990.
25. [MA80] H. Meijer and S.G. Aid. The design and analysis of a new hybrid sorting algorithm. Information Processing Letters, 10:213-218, 1980.
26. MasPar Computer Corporation, 749 North Mary Avenue, Sunnyvale, CA 94086. MasPar Sys- tern Overview, document 9300-0100, revision A3, March 1991.
27. Y. Matias. Highly Parallel Randomized Algorith- mics. PhD thesis, Tel Aviv University, Israel, December 1992.
28. G. L. Miller and J. H. Reif. Parallel tree contraction part 1: Fundamentals. In S. Micali, editor, Randomness and Computation, volume 5, pages 47-72. JAI Press, 1989.
29. P.D. MacKenzie and Q.F. Stout. Ultra-fast expected time parallel algorithms. In Proc. of the Second ACM-SIAM Symposium on Discrete Algorithms, pages 414-423, 1991.
30. Y. Matias and U. Vishkin. Converting high probability into nearly-constant time-with applications to parallel hashing. In Proc. of the 23rd Ann. ACM Symp. on Theory of Computing, pages 307-316, May 1991.
31. Y. Matias and U. Vishkin. A note on simulations and integer sorting. Manuscript, 1992.
32. R. Reischuk. Probabilistic parallel algorithms for sorting and selection. SIAM Journal on Computing, 14(2):396-409, May 1985.
33. J. H. Reif, editor. A Synthesis of Parallel Algorithms. Morgan-Kaufmann, San Mateo, CA, 1993.
34. S. Rajasekaran and J. H. Reif. Optimal and snblogarithmic time randomized parallel sorting algorithms. SIAM J. of Computing, 18(3):594-607, 1989.
35. A. Siegel. On universal classes of fast high performance hash functions, their time-space tradeoff, and their applications. In Proc. of the 30th IEEE Symp. on Foundations of Computer Science, pages 20-25, 1989.
36. L. G. Valiant. A bridging model for parallel computation. Communications of the ACM, 33(8):103-111, 1990.
37. A.C. C. Yao. Probabilistic computations: Towards a unified measure of complexity. In Proc. of the 18th IEEE Symp. on Foundations of Computer Science, pages 222-227, 1977.