The complexity of deterministic PRAM simulation on distributed memory machines

Theory of Computing Systems

Volumn 30, Issue 3, 1997, Pages 231-247

  Pietracaprina, A ^a   Pucci, G ^a  

^a UNIVERSITY OF PADOVA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

MEMORY ARCHITECTURE;

DETERMINISTIC SIMULATION; DISTRIBUTED MEMORY MACHINES; LOWER AND UPPER BOUNDS; PARALLEL RANDOM ACCESS MACHINES;

RANDOM ACCESS STORAGE;

EID: 0031504208     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/BF02679461     Document Type: Article

References (17)

1. H. Alt, T. Hagerup, K. Mehlhorn, and F. P. Preparata. Deterministic simulation of idealized parallel computers on more realistic ones. SIAM Journal on Computing, 16(5):808-835, 1987.
2. G. Baudet and D. Stevenson. Optimal sorting algorithms for parallel computers. IEEE Transactions on Computers, 27(1):84-87, January 1978.
3. A. Czumaj, F. Meyer auf der Heide, and V. Stemann. Shared memory simulations with triple-logarithmic delay. Proceedings of the 3rd European Symposium on Algorithms, Corfu, September 1995. LNCS, volume 979, pages 46-59, 1995.
4. K.T. Herley. Representing shared data on distributed-memory parallel computers. Mathematical Systems Theory, 29:111-156, 1996.
5. K. Herley and G. Bilardi. Deterministic simulations of PRAMs on bounded-degree networks. SIAM Journal on Computing, 23(2):276-292, April 1994.
6. K. Herley, A. Pietracaprina, and G. Pucci. Implementing shared memory on multi-dimensional meshes and on the fat-tree. Proceedings of the 3rd European Symposium on Algorithms, Corfu, September 1995. LNCS, volume 979, pages 60-74, 1995.
7. A.R. Karlin and E. Upfal. Parallel hashing: An efficient implementation of shared memory. Journal of the ACM, 35(4):876-892, October 1988.
8. F. T. Leighton. Tight bounds on the complexity of parallel sorting. IEEE Transactions on Computers, 34(4):344-354, April 1985.
9. F. Luccio, A. Pietracaprina, and G. Pucci. A new scheme for the deterministic simulation of PRAMs in VLSI. Algorithmica, 5(4):529-544, 1990.
10. K. Mehlhorn and U. Vishkin. Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories. Acta Informatica, 21:339-374, 1984.
11. D. Peleg and E. Upfal. The token distribution problem. SIAM Journal on Computing, 18(2):229-243, April 1989.
12. A. Pietracaprina and F. P. Preparata. An O(√n)-worst-case-time solution to the granularity problem. Proceedings of the 10th Symposium on Theoretical Aspects of Computer Science, Würzburg, February 1993. LNCS, volume 665, pages 110-119.
13. A. Pietracaprina and F. P. Preparata. A practical constructive scheme for deterministic shared-memory access. Proceedings of the 5th ACM Symposium on Parallel Algorithms and Architectures, Velen, July 1993, pages 100-109.
14. A. Pietracaprina and G. Pucci. Tight bounds on deterministic PRAM emulations with constant redundancy. Proceedings of the 2nd European Symposium on Algorithms, Papendal, September 1994. LNCS, volume 855, pages 391-400.
15. A. Pietracaprina and G. Pucci. Improved deterministic PRAM simulation on the mesh. Proceedings of the 22nd International Colloquium on Automata, Languages and Programming, Szeged, July 1995. LNCS, volume 944, pages 372-383.
16. A. Pietracaprina, G. Pucci, and J. Sibeyn. Constructive deterministic PRAM simulation on a mesh-connected computer. Proceedings of the 6th ACM Symposium on Parallel Algorithms and Architectures, Cape May, NJ, June 1994, pages 248-256.
17. E. Upfal and A. Wigderson. How to share memory in a distributed system. Journal of the ACM, 34(1): 116-127, 1987.