Constructive, deterministic implementation of shared memory on meshes

SIAM Journal on Computing

Volumn 30, Issue 2, 2000, Pages 625-648

  Pietracaprina, Andrea ^a   Pucci, Geppino ^a   Sibeyn, Jop F ^b  

^a UNIVERSITY OF PADOVA   (Italy)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

Expander graphs; Meshes; Networks of processors; Parallel computation; PRAM simulation; Shared memory machines

Indexed keywords

COMPUTER SIMULATION; GRAPH THEORY; HIERARCHICAL SYSTEMS; INTERCONNECTION NETWORKS; NETWORK PROTOCOLS; PARALLEL PROCESSING SYSTEMS; RANDOM ACCESS STORAGE; STORAGE ALLOCATION (COMPUTER); TELECOMMUNICATION LINKS;

MESHES; SHARED MEMORY MACHINES;

DATA STORAGE EQUIPMENT;

EID: 0343773301     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S009753979732712X     Document Type: Article

References (21)

1. H. ALT, T. HAGERUP, K. MEHLHORN, AND F. P. PREPARATA, Deterministic simulation of idealized parallel computers on more realistic ones, SIAM J. Comput., 16 (1987), pp. 808-835.
2. P. BAY AND G. BILARDI, Deterministic on-line routing on area-universal networks, J. ACM, 42 (1995), pp. 614-640.
3. A. CZUMAJ, F. MEYER AUF DER HEIDE, AND V. STEMANN, Shared memory simulations with triple-logarithmic delay, in Proceedings of the 3rd European Symposium on Algorithms, Corfu, Greece, 1995, pp. 46-59.
4. M. HALL JR., Combinatorial Theory, John Wiley & Sons, New York, 1986.
5. K. T. HERLEY, Representing shared data on distributed-memory parallel computers, Math. Systems Theory, 29 (1996), pp. 111-156.
6. K. T. HERLEY AND G. BILARDI, Deterministic simulations of PRAMs on bounded-degree networks, SIAM J. Comput., 23 (1994), pp. 276-292.
7. K. T. HERLEY, A. PIETRACAPRINA, AND G. PUCCI, Implementing shared memory on multi-dimensional meshes and on the fat-tree, in Proceedings of the 3rd European Symposium on Algorithms, Corfu, Greece, 1995, pp. 60-74.
8. M. KUNDE, Block gossiping on grids and tori: Deterministic sorting and routing match the bisection bound, in Proceedings of the 1st European Symposium on Algorithms, Bad Hönnef, Germany, 1993, pp. 272-283.
9. F. T. LEIGHTON, Introduction to Parallel Algorithms and Architectures: Arrays • Trees • Hypercubes, Morgan Kaufmann, San Mateo, CA, 1992.
10. F. T. LEIGHTON, B. MAGGS, A. RANADE, AND S. RAO, Randomized routing and sorting on fixed-connection networks, J. Algorithms, 17 (1994), pp. 157-205.
11. C. E. LEISERSON, Fat-trees: universal networks for hardware-efficient supercomputing, IEEE Trans. Comput., C-34 (1985), pp. 892-901.
12. F. LUCCIO, A. PIETRACAPRINA, AND G. PUCCI, A new scheme for the deterministic simulation of PRAMs in VLSI, Algorithmica, 5 (1990), pp. 529-544.
13. K. MEHLHORN AND U. VISHKIN, Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories, Acta Inform., 21 (1984), pp. 339-374.
14. A. PIETRACAPRINA AND F. P. PREPARATA, An O(√n)-worst-case-time solution to the granularity problem, in Proceedings of the 10th Symposium on Theoretical Aspects of Computer Science, Würzburg, Germany, 1993, pp. 110-119.
15. A. PIETRACAPRINA AND F. P. PREPARATA, Practical constructive schemes for deterministic shared-memory access, Theory Comput. Syst., 30 (1997), pp. 3-37.
16. A. PIETRACAPRINA AND G. PUCCI, Improved deterministic PRAM simulation on the mesh, in Proceedings of the 22nd International Colloquium on Automata, Languages and Programming, Szeged, Hungary, 1995, pp. 372-383.
17. A. PIETRACAPRINA AND G. PUCCI, The complexity of deterministic PRAM simulation on distributed memory machines, Theory Comput. Syst., 30 (1997), pp. 231-247.
18. A. PIETRACAPRINA, G. PUCCI, AND J. F. SIBEYN, Constructive deterministic PRAM simulation on a mesh-connected computer, in Proceedings of the 6th Annual Symposium on Parallel Algorithms and Architectures, Cape May, NJ, 1994, pp. 248-256.
19. A. G. RANADE, How to emulate shared memory, J. Comput. System Sci., 42 (1991), pp. 307-326.
20. J. F. SIBEYN AND M. KAUFMANN, Deterministic 1-k routing on meshes with application to hot-potato worm-hole routing, in Proceedings of the 11th Symposium on Theoretical Aspects of Computer Science, Caen, France, 1994, pp. 237-248.
21. E. UPFAL AND A. WIGDERSON, How to share memory in a distributed system, J. ACM, 34 (1987), pp. 116-127.