Toward automatic partitioning of arrays on distributed memory computers

Proceedings of the International Conference on Supercomputing

Volumn Part F129670, Issue , 1993, Pages 175-184

  Feautrier, Paul ^a  

^a LABORATOIRE DES SCIENCES DU CLIMAT ET DE L ENVIRONNEMENT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

DATA FLOW ANALYSIS; MEMORY ARCHITECTURE; SUPERCOMPUTERS;

AUTOMATIC PARTITIONING; DISTRIBUTED MEMORY; DISTRIBUTED-MEMORY COMPUTERS; GAUSSIAN ELIMINATION; LEVEL DISTRIBUTION; VIRTUAL PROCESSOR;

INTELLIGENT CONTROL;

EID: 85027408420     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/165939.165968     Document Type: Conference Paper

References (25)

1. Michael Barnett and Christian Lengauer. Loop parallelization and unimodularity. In Michel Cosnard, Maurice Nivat, and Yves Robert, editors, Algorithmique Parallele, Paris, May 1992. Masson.
2. Zbigniew Chamski. Environnement logiciel de programmation d'un accélérateur de calcul parallèle. PhD thesis, IFSIC, Rennes I, February 1993.
3. Thinking Machine Corp., Cambridge, MA. CM Fortran Reference Manual, Version 5.2, 1989.
4. Alain Darte and Yves Robert. Affine-by-statement scheduling of uniform loop nest over parametric domains. Technical Report 92-16, LIP-IMAG, April 1992.
5. Paul Feautrier. Parametric integer programming. RAIRO Recherche Opérationnelle, 22:243-268, September 1988.
6. Paul Feautrier. Asymptotically efficent algorithms for parallel architectures. In M. Cosnard and C. Girault, editors, Decentralized System, pages 273-284. IFIP WG 10.3, North-Holland, December 1989.
7. Paul Feautrier. Dataflow analysis of scalar and array. Int. Journal of Parallel Programming, 20(1):23-53, February 1991.
8. Paul Feautrier. Some efficient, solution to the affine scheduling problem, part i, one-dimensional time, to appear in Int. J. of Parallel Programming. 1992. also available as IBP/MASI Research Report 92.28.
9. Manish Gupta and Prithviraj Banerjee. Demonstration of automatic data partionning techniques for parallelizing compilers on multicomputers. IEEE Trans, on Parallel and Distributed Systems, 3:179-193. March 1992.
10. S. Hirandani, Ken Kennedy, Charles Koelbel, Ulrike Kremer, and C-W. Teng. An overview of the fortran d programming system. Technical Report 91121, CRPC. Rice University, September 1991.
11. Li Jinke and Marina Chen. Index domain alignment: Minimizing cost of cross-referencing between distributed arrays. In Proc. Third Symp. on the Frontiers of Massively Parallel Computation, pages 424-433. IEEE, October 90.
12. Kathleen Knobe, Joan D. Lukas, and Guy L. Steele Jr. Data optimization: Allocation of arrays to reduce communication on simd machines. J. of Parallel and Distributed Computing, 8, 1990.
13. Kathleen Knobe and Natarajan Venkataraman. Data optimization: Minimizing residual interprocessor data motion on simd machines. In Proc. Third Symp. on the Frontiers of Massively Parallel Computation. pages 416-423. IEEE, October 1990.
14. David Loveman. High performance fortran. In Hans P. Zima, editor. Proceedings of the Third Workshop on Compilers for Parallel Computers, Vienna, July 1992.
15. Mary E. Mace. Memory Storage Patterns in Paralell Processing. Kluwer. 1987.
16. Christophe Mauras, Patrice Quinton, Sanjay Rajopadhye, and Yannick Saouter. Scheduling affine parameterized recurrences by means of variable dependent timing functions. Technical Report 1204, INRIA, April 1990.
17. Patrice Quinton and Yves Robert. Algorithmes et Architectures Systoliques. Masson, Paris, 1981.
18. Patrice Quinton. The systematic design of systolic arrays. In F. Fogelman, Y. Robert, and M. Tschuente, editors, Automata networks in Computer Science, pages 229-260. Manchester University Press, December 1987.
19. J. Ramanujan and P. Sadayappan. Compile-time techniques for data distribution in distributed memory machines. IEEE Trans, on Paralell and Distributed Systems, 2:472-482, October 1991.
20. Mourad Raji-Werth and P. Feautrier. On parallel program generation for massively parallel architectures. In M. Durand and F. El Dabaghi, editors, High Performance Computing II. North-Holland, October 1991.
21. Yannick Saouter and Patrice Quinton. Computability of recurrence equations. TCS, 1992. To appear.
22. Nadia Tawbi. Parallélisation Automatique: Estimation des Durées d'Exécution et Allocation Statique de Processeurs. PhD thesis, Université P. et M. Curie, Paris, 1991. 19 Avril 1991.
23. Skef Wholey. Automatic data mapping for distributed-memory computers. In ICS'92, pages 25-34. ACM, 1992.
24. Hans Zima, Peter Brezany, Barbara Chapman, Piyush Mehrotra, and A. Schawald. Vienna fortran - a language specification. Technical Report 21, ICASE, 1992.
25. H. P. Zima, H. J. Bast, and M. Gemdt. Superb: A tool for semi-automatic mimd/simd parallelization. Parallel Computing, 6:1-18, 1988.