Efficient low-contention parallel algorithms

Journal of Computer and System Sciences

Volumn 53, Issue 3, 1996, Pages 417-442

  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

COMPUTER NETWORKS; DATA STORAGE EQUIPMENT; PARALLEL PROCESSING SYSTEMS; QUEUEING THEORY; RANDOM ACCESS STORAGE; SORTING;

HYPERCUBE TYPE NONCOMBINING NETWORKS; LOAD BALANCING; PARALLEL RANDOM ACCESS MACHINES (PRAM);

PARALLEL ALGORITHMS;

EID: 0030398560     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1996.0079     Document Type: Article

References (50)

1. R. Alverson, D. Callahan, D. Cummings, B. Klobenz, A. Porterfield, and B. Smith., The Tera computer system, in "Proceedings, 1990 International Conf. on Supercomputing, June 1990," pp. 1-6.
2. S. Albers and T. Hagerup, Improved parallel integer sorting without concurrent writing, in "Proceedings, 3rd ACM-SIAM Symp. on Discrete Algorithms, January 1992," pp. 463-472.
3. M. Ajtai, J. Komlos, and E. Szemeredi, Sorting in c lg n parallel steps, Combinatorica 3, No. 1 (1983), 1-19.
4. K. E. Batcher, Sorting networks and their applications, in "Proceedings, AFIPS Spring Joint Summer Computer Conference, 1968," pp. 307-314.
5. G. E. Blelloch, P. B. Gibbons, Y. Matias, and M. Zagha, Accounting for memory bank contention and delay in high-bandwidth multiprocessors, in "Proceedings, 7th ACM Symp. on Parallel Algorithms and Architectures, July 1995," pp. 84-94.
6. A. Borodin and J. E. Hopcroft, Routing, merging, and sorting on parallel models of computation, J. Comput. System Sci. 30, No. 1 (1985), 130-145
7. R. P. Brent, The parallel evaluation of general arithmetic expressions, J. Assoc. Comput. Mach. 21, No. 2 (1974), 201-208.
8. B. S. Chlebus, Parallel iterated bucket sort, Inform. Process. Lett. 31 (1989), 181-183.
9. R. Cole, Parallel merge sort, SIAM J. Comput. 17, No. 4 (1988), 770-785.
10. R. Cole and U. Vishkin, Faster optimal parallel prefix sums and list ranking, Inform. and Comput. 81 (1989), 334-352.
11. M. Dietzfelbinger and F. Meyer auf der Heide, A new universal class of hash functions and dynamic hashing in real time, in "Proceedings, 17th Int. Colloquium on Automata Languages and Programming," Lect. Notes in Comput. Sci., Vol. 443, Springer-Verlag, New York/Berlin, 1990.
12. S. Frank, H. Burkhardt III, and J. Rothnie, The KSR1: Bridging the gap between shared memory and MPPs, in "Proceedings, IEEE Compcon Spring, February 1993," pp. 285-294.
13. M. L. Fredman, J. Komlós, and E. Szemerédi, Storing a sparse table with O(1) worst case access time, J. Assoc. Comput. Mach. 31, No. 3 (1984), 538-544.
14. A. Gottlieb, R. Grishman, C. P. Kruskal, K. P. McAuliffe, L. Rudolph, and M. Snir, The NYU Ultracomputer - designing an MIMD shared memory parallel computer, IEEE Trans. Comput. C-32, No. 2 (1983), 175-189.
15. J. Gil, Fast load balancing on a PRAM, in "Proceedings, 3rd IEEE Symp. on Parallel and Distributed Computing, December 1991," pp. 10-17.
16. J. Gil, Renaming and dispersing: Techniques for fast load balancing, J. Parallel Distribut. Comput. 23, No. 2 (1994), 149-157.
17. J. Gil And Y. Matias, Fast hashing on a PRAM - designing by expectation, in "Proceedings, 2nd ACM-SIAM Symp. on Discrete Algorithms, 1991," pp. 271-280.
18. J. Gil and Y. Matias, Simple fast parallel hashing, in "Proceedings, 21st Int. Colloquium on Automata Languages and Programming, July 1994," Lect. Notes in Comput. Sci., Vol. 280, Springer-Verlag, New York/Berlin, 1994.
19. J. Gil and Y. Matias, Simple fast parallel hashing by oblivious execution, Technical report, AT&T Bell Laboratories, Murray Hill, NJ, 1994; SIAM J. Comput., to appear.
20. J. Gil and Y. Matias, Simple fast parallel hashing by oblivious execution, Technical report, AT&T Bell Laboratories, Murray Hill, NJ, 1994; SIAM J. Comput., to appear.
21. P. B. Gibbons, Y. Matias, and V. Ramachandran, QRQW: Accounting for concurrency in PRAMs and asynchronous PRAMs, Technical report, AT&T Bell Laboratories, Murray Hill, NJ, 1993.
22. P. B. Gibbons, Y. Matias, and V. Ramachandran, Efficient low-contention parallel algorithms, in "Proceedings, 6th ACM Symp. on Parallel Algorithms and Architectures, June 1994," pp. 236-247.
23. P. B. Gibbons, Y. Matias, and V. Ramachandran, The QRQW PRAM: Accounting for contention in parallel algorithms, in "Proceedings, 5th ACM-SIAM Symp. on Discrete Algorithms, January 1994," pp. 638-648.
24. P. B. Gibbons, Y. Matias, and V. Ramachandran, The Queue-Read Queue-Write PRAM model: Accounting for contention in parallel algorithms, SIAM J. Comput., to appear.
25. P. B. Gibbons, Y. Matias, and V. Ramachandran, The queueread queue-write asynchronous PRAM model, in "Proceedings, EURO-PAR'96," Lect. Notes in Comput. Sci., Vol. 124, pp. 279-292, Springer-Verlag, New York, 1996.
26. P. B. Gibbons, Y. Matias, and U. Vishkin, Towards a theory of nearly constant time parallel algorithms, in "Proceedings, 32nd IEEE Symp. on Foundations of Computer Science, October 1991," pp. 698-710.
27. T. Hagerup, Hybridsort revisited and parallelized, Inform. Process. Lett. 32 (1989), 35-39.
28. T. Hagerup, Fast parallel generation of random permutations, in "Proceedings, 18th Int. Colloquium on Automata Languages and Programming," Lect. Notes in Comput. Sci., Vol. 510, pp. 405-416, Springer-Verlag, New York/Berlin, 1991.
29. J. Jájá, "An Introduction to Parallel Algorithms," Addison-Wesley, Reading, MA, 1992.
30. R. M. Karp and V. Ramachandran, Parallel algorithms for shared-memory machines, in "Handbook of Theoretical Computer Science" (J. van Leeuwen, Ed.), Vol. A, pp. 869-941, Amsterdam, 1990.
31. C. P. Kruskal, L. Rudolph, and M. Snir, A complexity theory of efficient parallel algorithms, Theoret. Comput. Sci. 71 (1990), 95-132.
32. C. E. Leiserson, Fat-trees, Universal networks for hardware-efficient supercomputing, IEEE Trans. Comput. C-34, No. 10 (1985), 892-901.
33. F. T. Leighton, Methods for message routing in parallel machines, in "Proceedings, 24th ACM Symp. on Theory of Computing, May 1992," pp. 77-96.
34. R. E. Ladner and M. J. Fisher, Parallel prefix computation, Assoc. Comput. Mach. 27, No. 4 (1980), 831-838.
35. H. Meijer and S. G. Akl, The design and analysis of a new hybrid sorting algorithm, Inform. Process. Lett. 10 (1980), 213-218.
36. MasPar Computer Corp. 749 N. Mary Ave., Sunnyvale, CA 94086, "MasPar System Overview," Document 9300-0100, Revision A3, March 1991.
37. Y. Matias, "Highly Parallel Randomized Algorithmics," Ph. D. thesis, Tel Aviv University, 1992.
38. G. L. Miller and J. H. Reif, Parallel tree contraction, Part 1. Fundamentals, in "Randomness and Computation" (S. Micali, Ed.), Vol. 5, pp. 47-72, JAI Press, London, 1989.
39. P. D. MacKenzie and Q. F. Stout, Ultra-fast expected time parallel algorithms, in "Proceedings, 2nd ACM-SIAM Symp. on Discrete Algorithms, 1991," pp. 414-423.
40. Y. Matias and U. Vishkin, Converting high probability into nearly-constant time - with applications to parallel hashing, in "Proceedings, 23rd ACM Symp. on Theory of Computing, May 1991," pp. 307-316.
41. Y. Matias and U. Vishkin, On parallel hashing and integer sorting, J. Algorithms 12, No. 4 (1991), 573-606.
42. Y. Matias and U. Vishkin, A note on reducing parallel model simulations to integer sorting, in "Proceedings, 9th IEEE Int. parallel processing Symp., 1995," pp. 208-212.
43. R. Reischuk, Probabilistic parallel algorithms for sorting and selection, SIAM J. Comput. 14, No. 2 (1985), 396-409.
44. J. H. Reif (Ed.), "A Synthesis of Parallel Algorithms," Morgan-Kaufmann, San Mateo, CA, 1993.
45. S. Rajasekaran and J. H. Reif, Optimal and sublogarithmic time randomized parallel sorting algorithms, SIAM J. Comput. 18, No. 3 (1989), 594-607.
46. J. H. Reif and L. G. Valiant, A logarithmic time sort for linear size networks, J. Assoc. Comput. Mach. 34, No. 1 (1987), 60-76.
47. A. Siegel, On universal classes of fast high performance hash functions, their time-space tradeoff and their applications, in "Proceedings, 30th IEEE Symp. on Foundations of Computer Science, 1989," pp. 20-25.
48. L. G. Valiant, Parallelism in comparison problems, SIAM J. Comput. 4, No. 3 (1975), 348-355.
49. L. G. Valiant, A bridging model for parallel computation, Commun. ACM 33, No. 8 (1990), 103-111.
50. U. Vishkin, "On Choice of a Model of Parallel Computation," Technical Report 61, Department of Computer Science, Courant Institute of Mathematical Sciences, New York University, New York, 1983.