Combining Compile-Time and Run-Time Support for Efficient Software Distributed Shared Memory

Proceedings of the IEEE

Volumn 87, Issue 3, 1999, Pages 476-486

  Dwarkadas, Sandhya ^a   Honghui, L U ^b   Cox, Alan L ^b   Rajamony, Ramakrishnan ^c   Zwaenepoel, Willy ^a  

^a University of Rochester   (United States)

^b Rice University   (United States)

^c IBM AUSTIN RESEARCH LABORATORY   (United States)

Author keywords

Automatic aggregation of data transfer; Distributed shared memory; Integrated compiler and run time system; Optimizing compiler for irregular parallel programs

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SYSTEMS PROGRAMMING; DATA ACQUISITION; DATA COMMUNICATION SYSTEMS; DATA RECORDING; DATA TRANSFER; MATHEMATICAL MODELS; OPTIMIZATION; PARALLEL PROCESSING SYSTEMS; PROGRAM COMPILERS; RESPONSE TIME (COMPUTER SYSTEMS);

SOFTWARE DISTRIBUTED SHARED MEMORY (DSM);

BUFFER STORAGE;

EID: 0033100871     PISSN: 00189219     EISSN: None     Source Type: Journal    
DOI: 10.1109/5.747868     Document Type: Article

References (34)

1. G. Agarwal and J. Saltz, " Interprocedural compilation of irregular applications for distributed memory machines," in Proc. Siipercomputing'95, Dec. 1995.
2. C. Amza, A. L. Cox, S. Dwarkadas, P. Keleher, H. Lu, R. Rajamony, and W. Zwaenepoel, " TreadMarks: Shared memory computing on networks of workstations," IEEE Coinpnt., vol. 29, pp.18-28, Feb. 1996.
3. Applied Parallel Research, FORGE Higli-Perforinance Fortran User's Guide, version 2.0 ed, Jan. 1995.
4. D. Bailey, J. Barton, T. Lasinski, and H. Simon, " The NAS parallel benchmarks," NASA, Tech. Rep. 103863, July 1993.
5. B. R. Brooks, R. E. Bruccoleri, B. D. Olafson, D. J. States, S. Swaminathan, and M. Karplus, " Charmm: A program for macromolecular energy, minimization, and dynamics calculations," J. Computational Chemistry, vol. 4, p. 187, 1983.
6. J. B. Carter, J. K. Bennett, and W. Zwaenepoel, " Techniques for reducing consistency-related information in distributed shared memory systems," ACM Trans. Coinpnt. Syst., vol. 13, no. 3, pp.205-243, Aug. 1995.
7. S. Chandra and J. R. Larus, " Optimizing communication in hpf programs for fine-grain distributed shared memory," in Proc. 6th Symp. Principles and Practice of Parallel Programming, June 1997, pp.100-111.
8. R. Das, P. Havlak, J. Saltz, and K. Kennedy, " Index array flattening through program transformation," in Proc. Supercomputing'95, Dec. 199S7
9. K. M. Dixit, " The SPEC benchmarks," Parallel Comput., vol. 17, nos. 10-11, pp.1195-1209, Dec. 1991.
10. S. Dwarkadas, A. L. Cox, and W. Zwaenepoel, " An integrated compile-time/run-time software distributed shared memory system," in Proc. 7th Symp. Architectural Support for Programming Languages and Operating Systems, Oct. 1996, pp.186-197.
11. K. Gharachorloo, D. Lenoski, J. Laudon, P. Gibbons, A. Gupta, and J. Hennessy, " Memory consistency and event ordering in scalable shared-memory multiprocessors," in Proc. 17th Annii. Int. Symp. Computer Architecture, May 1990, pp.15-26.
12. W. F. van Gunsteren and H. J. C. Berendsen, " GROMOS: GROningen MOlecular Simulation software," Lab. Phys. Chemistry, Univ. Gronineen, The Netherlands, Tech. Rep., 1988.
13. P. Havlak and K. Kennedy, " An implementation of interprocedural bounded regular section analysis," IEEE Trans. Parallel Distrib. Syst., vol. 2, pp.350-360, July 1991.
14. S. Hiranandani, K. Kennedy, and C. Tseng, " Compiling Fortran D for MIMD distributed-memory machines," Commun. ACM, vol. 35, no. 8, pp.66-80, Aug. 1992.
15. S. loannidis and S. Dwarkadas, " Compiler and run-time support for adaptive load balancing in software distributed shared memory systems," in Proc. 4th Workshop Languages, Compilers, and Run-Time Systems for Scalable Computers, May 1998, pp.107-122.
16. T. E. Jeremiassen and S. Eggers, " Computing per-process summary side-effect information," in Proc. 5th Workshop Languages and Compilers for Parallelism, Aug. 1992, pp.175-191.
17. P. Keleher, A. L. Cox, and W. Zwaenepoel, " Lazy release consistency for software distributed shared memory," in Proc. 19th Annii. Int. Symp. Computer Architecture, May 1992, pp.13-21.
18. P. Keleher and C. Tseng, " Enhancing software DSM for compiler-parallelized applications," in Proc. llth Int. Parallel Processing Symp., Apr. 1997, pp.490-499.
19. K. Kennedy, K. S. McKinley, and C. Tseng, " Analysis and transformation in an interactive parallel programming tool," Concurrency: Practice and Experience, vol. 5, no. 7, pp.575-602, Oct. 1993.
20. D. Kranz, K. Johnson, A. Agarwal, J. Kubiatowicz, and B. Lim, " Integrating message-passing and shared-memory: Early experience," in Proc. 1993 Conf. Principles and Practice of Parallel Programming, May 1993, pp.54-63.
21. J. Kuskin, D. Ofelt, M. Heinrich, J. Heinlein, R. Simoni, K. Gharacherloo, J. Chapin, D. Nakahira, J. Baxter, M. Horowitz, A. Gupta, M. Rosenblum, and J. Hennessy, " The Stanford FLASH multiprocessor," in Proc. 21st Anmi. Int. Symp. Computer Architecture, Apr. 1994, pp.302-313.
22. K. Li and P. Hudak, " Memory coherence in shared virtual memory systems," ACM Trans. Comput. Syst., vol. 7, no. 4, pp.321-359, Nov. 1989.
23. H. Lu, A. L. Cox, S. Dwarkadas, R. Rajamony, and W. Zwaenepoel, " Compiler and software distributed shared memory support for irregular applications," in Proc. 6th Symp. Principles and Practice of Parallel Programming, June 1997, pp.48-56.
24. H. Lu, S. Dwarkadas, A. L. Cox, and W. Zwaenepoel, " Quantifying the performance difference between PVM and TreadMarks," J. Parallel Distrib. Comput., vol. 43, no. 2, pp.65-78, June 1997.
25. T. C. Mowry, C. Q. C. Chan, and A. K. W. Lo, " Comparative evaluation of latency tolerance techniques for software distributed shared memory," in Proc. 4th High Performance Computer Architecture Symp., Feb. 1998, pp.300-311.
26. S. S. Mukherjee, S. D. Sharma, M. D. Hill, J. R. Larus, A. Rogers, and J. Saltz, " Efficient support for irregular applications on distributed memory machines," in Proc. 5th ACM Symp. Principles and Practice of Parallel Programming, July 1995, pp.68-79.
27. S. K. Reinhard!, J. R. Larus, and D. A. Wood, " Tempest and typhoon: User-level shared memory," in P roc. 21st Annu. Int. Symp. Computer Architecture, Apr. 1994, pp.325-336.
28. D. J. Scales, K. Gharachorloo, and C. A. Thekkalh, " Shasta: A low overhead, software-only approach for supporting fine-grain shared memory," in Proc. 7th Symp. Architectural Support for Programming Languages and Operating Systems, Oct. 1996, pp.174-185.
29. S. D. Sharma, R. Ponnusamy, B. Moon, Y. Hwang, R. Das, and J. Saltz, " Run-time and compile-time support for adaptive irregular problems," in Proc. Siipercomputing, 1994.
30. R. Stets, S. Dwarkadas, N. Hardavellas, G. Hunt, L. Kontothanassîs, S. Parthasarathy, and M. L. Scott, " Cashmere- 21: Software coherent shared memory on a clustered remotewrite network," in Proc. 16th ACM Symp. Operating Systems Principles, Oct. 1997, pp.170-183.
31. R. von Hanxleden and K. Kennedy, " Give-N-Take-A balanced code placement framework," in Proc. ACM SIGPLAN 94 Conf. Programming Language Design and Implementation, Mar. 1994, pp.107-120.
32. R. von Hanxleden, K. Kennedy, C. Koelbel, R. Das, and J. Saltz, " Compiler analysis for irregular problems in Fortran D," in Proc. 5th Workshop Languages and Compilers for Parallel Computing, Aug. 1992, pp.97-111.
33. S. C. Woo, J. P. Singh, and J. L. Hennessy, " The performance advantages of integrating block data transfer in cache-coherent multiprocessors," in Proc. 6th Symp. Architectural Support for Programming Languages and Operating Systems, Oct. 1994, pp.219-231.
34. Y. Zhou, L. Iftode, and J. P. Singh, " Performance evaluation of two home-based lazy release consistency protocols for shared virtual memory systems," in Proc. 2nd USENIX Symp. Operating System Design and Implementation, Oct. 1996, pp.75-88.