Implementing shared memory on clustered machines

Proceedings - 15th International Parallel and Distributed Processing Symposium, IPDPS 2001

Volumn , Issue , 2001, Pages

  Fantozzi, C ^a   Pietracaprina, A ^a   Pucci, G ^a  

^a UNIVERSITY OF PADOVA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

BANDWIDTH;

BANDWIDTH LIMITATION; CLUSTERED STRUCTURE; DISTRIBUTED MEMORY MACHINES; DISTRIBUTION STRATEGIES; HIERARCHICAL DECOMPOSITIONS; IMPORTANT FEATURES; INDEPENDENT CLUSTERS; NATURAL BANDWIDTH;

MEMORY ARCHITECTURE;

EID: 84981276181     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2001.925007     Document Type: Conference Paper

References (16)

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(5):808-835, 1987.
2. G. Bilardi, A. Pietracaprina, and G. Pucci. A quantitative measure of portability with application to bandwidth-latency models for parallel computing. In Proc. of EUROPAR 99, LNCS 1685, pages 543-551, Sept. 1999.
3. A. Czumaj, F. Meyer auf der Heide, and V. Stemann. Contention resolution in hashing based shared memory simulations. SIAM J. Comput., 29(5):1703-1739, 2000.
4. P. De la Torre and C. P. Kruskal. Submachine locality in the bulk synchronous setting. In Proc. of EUROPAR 96, LNCS 1124, pages 352-358, Aug. 1996.
5. M. Hall Jr. Combinatorial Theory. John Wiley & Sons, New York, NY, second edition, 1986.
6. K. T. Herley. Space-efficient representations of shared data for parallel computers. In Proc. of the 2nd ACM Symp. on Parallel Algorithms and Architectures, pages 407-416, 1990.
7. K. T. Herley and G. Bilardi. Deterministic simulations of PRAMs on bounded-degree networks. SIAM J. Comput., 23(2):276-292, Apr. 1994.
8. K. T. Herley, A. Pietracaprina, and G. Pucci. Implementing shared memory on multi-dimensional meshes and on the fat-tree. In Proc. of the 3rd European Symposium on Algorithms, LNCS 979, pages 60-74, Corfu, GR, Sept. 1995.
9. K. T. Herley, A. Pietracaprina, and G. Pucci. Implementing shared memory on mesh-connected computers and on the fat-tree. Information and Computation, 2000. To appear.
10. F. T. Leighton. Introduction to Parallel Algorithms and Architectures: Arrays • Trees • Hypercubes. Morgan Kaufmann, San Mateo, CA, 1992.
11. F. T. Leighton, B. M. Maggs, and A. W. Richa. Fast algorithms for finding O(congestion + dilation) packet routing schedules. Combinatorica, 19(3):375-401, 1999.
12. F. T. Leighton and S. Rao. Multicommodity max-flow mincut theorems and their use in designing approximation algorithms. J. ACM, 46(6):787-832, 1999.
13. A. Pietracaprina, G. Pucci, and J. Sibeyn. Constructive, deterministic implementation of shared memory on meshes. SIAM J. Comput., 30(2):625-648, 2000.
14. A. G. Ranade. How to emulate shared memory. J. Comput. Syst. Sci., 42:307-326, 1991.
15. E. Upfal and A. Widgerson. How to share memory in a distributed system. J. ACM, 34(1):116-127, 1987.
16. L. G. Valiant. A bridging model for parallel computation. Commun. ACM, 33(8):103-111, Aug. 1990.