Unified compilation techniques for shared and distributed address space machines

Proceedings of the International Conference on Supercomputing

Volumn Part F129361, Issue , 1995, Pages 67-76

  Tseng, Chau Wen ^a   Anderson, Jennifer M ^a   Amarasinghe, Saman P ^a   Lam, Monica S ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PROGRAM COMPILERS; BUFFER STORAGE; COMPUTER HARDWARE; COMPUTER SIMULATION; DATA COMMUNICATION SYSTEMS; DATA STORAGE EQUIPMENT; DATA TRANSFER; DISTRIBUTED COMPUTER SYSTEMS; OPTIMIZATION; PARALLEL PROCESSING SYSTEMS; SYNCHRONIZATION;

BARRIER SYNCHRONIZATION; COMMUNICATION ANALYSIS; COMPILATION TECHNIQUES; DATA DECOMPOSITION; DATA REORGANIZATION; SCALABLE PERFORMANCE; SHARED ADDRESS SPACES; SIMULATION STUDIES;

PROGRAM PROCESSORS; PROGRAM COMPILERS;

AUTOMATIC DATA DECOMPOSITION; CACHE EFFECTS; COMMUNICATION ANALYSIS; COMPILATION TECHNIQUES; DATA REORGANIZATION TRANSFORMATIONS; DISTRIBUTED ADDRESS SPACE MACHINES; NON-LOCAL DATA; PROFILING;

EID: 0029194311     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/224538.224546     Document Type: Conference Paper

References (33)

1. S. P. Amarasinghe and M. S. Lam. Communication optimization and code generation for distributed memory machines. In Proceedings of the SIGPLAN '93 Conference on Programming Language Design and Implementation, pages 126-138, Albuquerque, NM, June 1993.
2. J. M. Anderson, S. P. Amarasinghe, and M. S. Lam. Data and computation transformations for multiprocessors. In Proceedings of the Fifth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, July 1995.
3. J. M. Anderson and M. S. Lam. Global optimizations for parallelism and locality on scalable parallel machines. In Proceedings of the SIGPLAN '93 Conference on Programming Language Design and Implementation, pages 112-125, Albuquerque, NM, June 1993.
4. B. Bixby, K. Kennedy, and U. Kremer. Automatic data layout using 0-1 integer programming. In Proceedings of the International Conference on Parallel Architectures and Compilation Techniques (PACT), pages 111-122, Montreal, Canada, August 1994.
5. W. Blume et al. Polaris: The next generation in parallelizing compilers. In Proceedings of the Seventh Workshop on Languages and Compilers for Parallel Computing, Ithaca, NY, August 1994.
6. W. J. Bolosky and M. L. Scott. False sharing and its effect on shared memory performance. In Proceedings of the USENLX Symposium on Experiences with Distributed and Multiprocessor Systems (SEDMS IV), pages 57-71, San Diego, CA, September 1993.
7. R. Cytron, J. Lipkis, and E. Schonberg. A compiler-assisted approach to SPMD execution. In Proceedings of Supercomputing '90, pages 398-406, New York, NY, November 1990.
8. S. J. Eggers and T. E. Jeremiassen. Eliminating false sharing. In Proceedings of the 1991 InternationalConference on Parallel Processing, pages 377-381, St. Charles, IL, August 1991.
9. J. Fang and M. Lu. A solution of cache ping-pong problem in RISC based parallel processing systems. In Proceedings of the 1991 International Conference on Parallel Processing, St. Charles, EL, August 1991.
10. E. D. Granston and H. Wishoff. Managing pages in shared virtual memory systems: Getting the compiler into the game. In Proceedings of the 1993 ACM International Conference on Supercomputing, Tokyo, Japan, July 1993.
11. M. Gupta and P. Banerjee. Demonstration of automatic data partitioning techniques for parallelizing compilers on multicomputers. IEEE Transactions on Parallel and Distributed Systems, 3(2): 179-193, March 1992.
12. M. W. Hall, S. Amarasinghe, and B. Murphy. Interprocedural analysis for parallelization: Design and experience. In Proceedings of the Seventh SIAM Conference on Parallel Processing for Scientific Computing, pages 650-655, San Francisco, CA, February 1995.
13. M. Heinrich, J. Kuskin, D. Ofelt, J. Heinlein, J. P. Singh, R. Simoni, K. Gharachorloo, J. Baxter, D. Nakahira, M. Horowitz, A. Gupta, M. Rosenblum, and J. Hennessy. The performance impact of flexibility in the Stanford FLASH multiprocessor. In Proceedings of the Sixth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-VI), pages 274-284, October 1994.
14. High Performance Fortran Forum. High Performance Fortran language specification. Scientific Programming, 2(1-2):1-170, 1993.
15. S. Hiranandani, K. Kennedy, and C.-W. Tseng. Compiling Fortran D for MIMD distributed-memory machines. Communications of the ACM, 35(8):66-80, August 1992.
16. c Kinley. Optimizing for parallelism and data locality. In Proceedings of the 1992 ACM International Conference on Sj/percompyftng, Washington, DC, July 1992.
17. D. Kranz, K. Johnson, A. Agarwal, J. Kubiatowicz, and B. H. Lim. Integrating message-passing and shared-memory: Early experience. In Proceedings of the Fourth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pages 54-63, San Diego, CA, May 1993.
18. Kuck & Associates, Inc. KAP User's Guide. Champaign, EL 61820, 1988.
19. J. Larus. Compiling for shared-memory and message-passing computers. ACM Letters on Programming Languages and Systems, 2(1-4):165-180, March-December 1993.
20. D. Lenoski, J. Laudon, T Joe, D. Nakahira, L. Stevens, A. Gupta, and J. Hennessy. The DASH prototype: Implementation and performance. In Proceedings of the 19th International Symposium on Computer Architecture, pages 92-105, Gold Coast, Australia, May 1992.
21. H. Li and K. C. Sevcik. NUMACROS: Data parallel programming on NUMA multiprocessors. In Proceedings of the USENLX Symposium on Experiences with Distributed and Multiprocessor Systems (SEDMS TV), pages 247-263, San Diego, CA, September 1993.
22. E. Markatos and T. LeBlanc. Using processor affinity in loop scheduling on shared-memory multiprocessors. IEEE Transactions on Parallel and Distributed Systems, 5(4):379-400, April 1994.
23. T. Mowry, M. S. Lam, and A. Gupta. Design and evaluation of a compiler algorithm for prefetching. In Proceedings of the Fifth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-V), pages 62-73, Boston, MA, October 1992.
24. T. J. Sheffler, R. Schreiber, J. R. Gilbert, and S. Chatterjee. Aligning parallel arrays to reduce communication. In Frontiers '95: The 5th Symposium on the Frontiers of Massively Parallel Computation, pages 324-331, McLean, VA, February 1995.
25. J.P. Singh, T. Joe, A. Gupta, and J. L. Hennessy. An empirical comparison of the Kendall Square Research KSR-1 and Stanford DASH multiprocessors. In Proceedings of Supercomputing '93, pages 214-225, Portland, OR, November 1993.
26. O. Temam, E. D. Granston, and W. Jalby. To copy or not to copy: A compile-time technique for assessing when data copying should be used to eliminate cache conflicts. In Proceedings of Supercomputing '93, pages 410-419, Portland, OR, November 1993.
27. J. Torrellas, M. S. Lam, and J. L. Hennessy. False sharing and spatial locality in multiprocessor caches. IEEE Transactions on Computers, 43(6):651-663, June 1994.
28. E. Torrie, C-W. Tseng, M. Martonosi, and M. W. Hall. Evaluating the impact of advanced memory systems on compiler-parallelized codes. In Proceedings of the International Conference on Parallel Architectures and Compilation Techniques (PACT), June 1995.
29. C-W. Tseng. Compiler optimizations for eliminating barrier synchronization. In Proceedings of the Fifth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, July 1995.
30. P. Tu and D. Padua. Automatic array privatization. In Proceedings of the Sixth Workshop on Languages and Compilers for Parallel Computing, Portland, OR, August 1993.
31. R. P. Wilson, R. S. French, C. S. Wilson, S. P. Amarasinghe, J. M. Anderson, S. W. K. Tjiang, S.-W. Liao, C.-W. Tseng, M. W. Hall, M. S. Lam, and J. L. Hennessy. SUIF: An infrastructure for research on parallelizing and optimizing compilers. ACM SIGPLAN Notices, 29(12):31-37, December 1994.
32. M. E. Wolf and M. S. Lam. A loop transformation theory and an algorithm to maximize parallelism. IEEE Transactions on Parallel and Distributed Systems, 2(4):452-471, October 1991.
33. M. J. Wolfe. Optimizing Supercompilers for Supercomputers. The MIT Press, Cambridge, MA, 1989.