Representing shared data on distributed-memory parallel computers

Theory of Computing Systems

Volumn 29, Issue 2, 1996, Pages 111-156

  Herley, K T ^a,b  

^a School of Operations Research and Information Engineering   (United States)

^b UNIVERSITY COLLEGE CORK   (Ireland)

Author keywords

[No Author keywords available]

Indexed keywords

MEMORY ARCHITECTURE;

DISTRIBUTED-MEMORY PARALLEL COMPUTERS; MESH OF TREES; SHARED DATA;

DIGITAL STORAGE;

EID: 0013359524     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/BF01305311     Document Type: Article

References (27)

1. H. Alt, T. Hagerup, K. Mehlhom, and E E Preparata. Deterministic simulation of idealized parallel computers on more realistic ones. SIAM Journal on Computing, 16(5):808-835, November 1987.
2. M. Ajtai, J. Komlos, and E. Szemeredi. An O(n logn) sorting network. Proceedings of the 15th Annual Symposium on the Theory of Computing, Boston, Massachusetts, pages 1-9, April 1983. See also Combinatorica 3(1):1-19, 1983.
3. G. Baudet and D. Stevenson. Optimal sorting algorithms for parallel computers. IEEE Transactions on Computers, 27(1):84-87, January 1978.
4. 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.
5. T. Hagemp. A lower bound for the emulation of PRAM memories on processor networks. Technical Report 13/1990, Fachbereich 14, Informatik, Universitat des Saarlandes, June 1990.
6. K. T. Herley. Efficient simulations of small shared memories on bounded-degree networks. Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, pages 390-395, October 1989.
7. K.T. Herley. Space-efficient representations of shared data for parallel computers. Proceedings of the 2nd Annual ACM Symposium on Parallel Algorithms and Architectures, Crete, pages 407-416, July 1990.
8. K. T. Herley. Improved bounds for the token distribution problem. Information Processing Letters, 38:329-334, June 1991.
9. K. T. Herley and G. Bilardi. Deterministic simulations of PRAMs on bounded-degree networks. SIAM Journal on Computing, 23(2):276-292, April 1994.
10. T. Hagerup, K. Mehlhorn, and B. Parker. Unpublished notes communicated by K. Mehlhom.
11. S. W. Hornick and F. P. Preparata. Deterministic PRAM simulations with constant redundancy. Proceedings of the 1989 ACM Symposium on Parallel Algorithms and Architectures, Sante Fe, New Mexico, pages 103-109, June 1989.
12. R. M. Karp and V. Ramachandran. Parallel algorithms for shared-memory machines. In Handbook of Theoretical Computer Science, J. van Leeuwen, editor, pages 869-941. North-Holland, Amsterdam, 1990.
13. C. P. Kruskal, L. Rudolph, and M. Snir. The power of parallel prefix. 1EEE Transactions on Computers, 34(10):965-968, October 1985.
14. A. R. Karlin and E. Upfal. Parallel hashing: an efficient implementation of shared memory. Journal of the ACM, 35(4):876-892, October 1988.
15. F. T. Leighton. New lower bound techniques for VLSI. Mathematical Systems Theory, 17:47-70, 1984.
16. F. T. Leighton. Tight bounds on the complexity of parallel sorting. 1EEE Transactions on Computers, 34(4):344-354, April 1985.
17. F. Luccfo, A. Pietracaprina, and G. Pucci. A probabilistic simulation of PRAMs on a bounded degree network. Information Processing Letters, 28(3):141-147, July 1988.
18. F. Luccio, A. Pietracaprina, and G. Pucci. A new scheme for the deterministic simulation of PRAMs in VLSI. Algorithmica, 5:529-544, 1990.
19. F. Meyer auf der Heide. Efficient simulations among several models of parallel computers. SIAM Journal on Computing, 15(1):106-119, February 1986.
20. K. Mehlhom and U. Vishkin. Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories. Acta Informatica, 21(4):339-374, November 1984.
21. D. D. Nath, S. N. Maheshwari, and P. C. P. Bhatt. Efficient VLSI networks for parallel processing based on orthogonal trees. IEEE Transactions on Computers, 32(6):569-581, June 1983.
22. D. Peleg and E. Upfal. The generalized packet routing problem. Theoretical Computer Science, 53:569-581, June 1987.
23. D. Peleg and E. Upfal. The token distribution problem. SlAM Journal on Computing, 18(2):229-243, April 1989.
24. A. G. Ranade. How to emulate shared memory. Journal of Computer and System Sciences, 42:307-326, 1991.
25. J. D. Ullman. ComputationaIAspects of VLSI. Computer Science Press, Rockville, Maryland, 1983.
26. E. Upfal. A probabilistic relation between desirable and feasible models of parallel computation. Proceedings of the 16th Annual ACM Symposium on the Theory of Computing, Washington, DC, pages 258-265, May 1984.
27. E. Upfal and A. Wigderson. How to share memory in a distributed system. Journal of the ACM, 34(1):116-127, January 1987.