The ADDAP system on the iPSC/860: Automatic data distribution and parallelization

Journal of Parallel and Distributed Computing

Volumn 32, Issue 1, 1996, Pages 1-10

  Dierstein, Anne ^a   Hayer, Roman ^a   Rauber, Thomas ^a  

^a SAARLAND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030577536     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1006/jpdc.1996.0001     Document Type: Article

References (21)

1. 1. J. M. Anderson and M. S. Lam, Global optimizations for parallelism and locality on scalable parallel machines. ACM SIGPLAN Symposium on Programming Languages Design and Implementation. 1993, pp. 112-125.
2. 2. V. Balasundaram, G. Fox, K. Kennedy, and U. Kremer. A static performance estimator to guide data partitioning decisions. ACM Symp. on Princ. and Pract. of Parallel Progr. 1991, pp. 213-223.
3. 3. Parasoft Co. EXPRESS User Manual. Parasoft Co., 1989.
4. 4. R. Das, R. Ponnusamy, J. Saltz, and D. Mavriplis. Distributed memory compiler methods for irregular problems - Data copy reuse and runtime partitioning. In Languages, Compilers and Run-Time Environments for Distributed Memory Machines. North-Holland, Amsterdam, 1992, pp. 185-219.
5. 5. A. Dierstein, R. Hayer, and T. Rauber. The ADDAP system on the iPSC/860: Automatic data distribution and parallelization. Tech. Rep. 09-94, University Saarbrücken, 1994.
6. 6. J. T. Feo. An analysis of the computational and parallel complexity of the livermore loops. Parallel Comput. 7, (1988), 163-185.
7. 7. H. M. Gerndt. Automatic parallelization for distributed-memory multiprocessing systems. Ph.D. thesis, Universität Bonn, 1989.
8. 8. M. Gupta. Automatic data partitioning on distributed memory multicomputers. Ph.D. thesis, University of Illinois, Urbana-Champaign, IL, 1992.
9. 9. M. Gupta and P. Banerjee. PARADIGM: A compiler for automatic data distribution on multicomputers. Int. Conf. on Supercomputing 1993. 1993, pp. 87-96.
10. 10. S. Hiranandani, K. Kennedy, and C.-W. Tseng. Compiler-support for machine-independent parallel programming in Fortran-D. Tech. Rep. Rice COMP TR91-149, Rice University, Mar. 1991.
11. 11. K. Ikudome, G. C. Fox, A. Kolawa, and J. W. Flower. An automatic and symbolic parallelization system for distributed memory parallel computers. Proceedings of the 5th Distributed Memory Computing Conference. 1990, pp. 1105-1114.
12. 12. K. Knobe, J. D. Lukas, and G. L. Steele. Data optimization: Allocation of arrays to reduce communication on SIMD machines. J. Parallel Distrib. Comput. 8, (1990), 102-118.
13. 13. C. Koelbel, P. Mehrotra, and J. Rosendale. Supporting Shared Data Structures on Distributed Memory Architectures. ACM SIGPLAN Symposium on Principles and Practices of Parallel Programming. 1990, pp. 177-186.
14. 14. J. Li and M. Chen. Index domain alignment: Minimizing costs of cross-referencing between distributed arrays. Third Symposium on the Frontiers of Massively Parallel Computation. 1990, pp. 424-433.
15. 15. M. Mace. Memory Storage Patterns in Parallel Processing. Kluwer Academic, Boston, 1987.
16. 16. F. H. McMahon. L.L.N.L. FORTRAN kernels: MFLOPS. Lawrence Livermore National Laboratory, 1986.
17. 17. C. D. Polychronopoulos. Parallel Programming and Compilers. Kluwer Academic, Dordrecht/Norwell, MA, 1988.
18. 18. W. Press, S. Teukolsky, W. Vetterling, and B. Flannery, Numerical Recipes. Cambridge Univ. Press, New York, 1992.
19. 19. J. Ramanujan and P. Sadayappan. Compile-time techniques for data distribution in distributed memory machines. IEEE Trans. Parallel Distrib. Syst. 2(4), (1991), 472-481.
20. 20. M. Rosing, R. Schnabel, and R. Weaver. Scientific programming languages for distributed memory multiprocessors: Paradigms and research issues. In Languages, Compilers and Run-Time Environments for Distributed Memory Machines. North-Holland, Amsterdam, 1992, pp. 17-37.
21. 21. S. Wholey. Automatic data mapping for distributed-memory parallel computers. Ph.D. thesis, Carnegie Mellon University, Pittsburgh, PA, 1991.