A methodology for generating data distributions to optimize communication

Proceedings of the 4th IEEE Symposium on Parallel and Distributed Processing, SPDP 1992

Volumn , Issue , 1992, Pages 436-441

  Gupta, S K S ^a   Kaushik, S D ^a   Huang, C H ^a   Johnson, J R ^b   Johnson, R W ^c   Sadayappan, P ^a  

^a OHIO STATE UNIVERSITY   (United States)

^b DREXEL UNIVERSITY   (United States)

^c ST CLOUD STATE UNIVERSITY   (United States)

Author keywords

Data communication; Data distribution; Distributed memory multiprocessor; Fast Fourier transform; Tensor product

Indexed keywords

COMPUTATION THEORY; FORTRAN (PROGRAMMING LANGUAGE); MEMORY ARCHITECTURE; MULTIPROCESSING SYSTEMS; SEMANTICS; TENSORS;

ALGEBRAIC THEORIES; BLOCK RECURSIVE ALGORITHM; BLOCK-CYCLIC DISTRIBUTION; DATA DISTRIBUTION; DATA-COMMUNICATION; DISTRIBUTED-MEMORY MULTIPROCESSORS; HIGH PERFORMANCE FORTRANS; MASSIVELY PARALLEL COMPUTING; SHARED MEMORY; TENSOR PRODUCTS;

FAST FOURIER TRANSFORMS;

EID: 84976839993     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SPDP.1992.242712     Document Type: Conference Paper

References (14)

1. B. M. Chapman, H. Herbeck, and H. P. Zima. Automatic support for data distribution. In Sixth Distributed Memory Computer Conference, pages 51-57, 1991.
2. B . M . Chapman, P. Mehrotra, and H.P. Zima. V i - enna Fortran - a Fortran language extension for distributed memory multiprocessors. Int. Saltz and P. Mehrotra, editors. Language, Compilers and Runtime Environments for Distributed Memory Machines, pages 39-62. North-Holland, Amsterdam, 1992.
3. 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, Mar. 1992.
4. S. Hiranandani, K. Kennedy, and C.-W. Tseng. CompUer support for machine-independent parallel programming in Fortran D. In J. Saltz and P. Mehrotra, editors. Language, Compilers and Runtime Environments for Distributed Memory Machines, pages 139-176. North-Holland, Amsterdam, 1992.
5. R. A. Horn and C R . Johnson. Topics in Matrix Analysis. Cambridge University Press, Cambridge, 1991.
6. C.-H. Huang, J . R . Johnson, and R.W. Johnson. Generating parallel programs from tensor product formulas: a case study of Strassen's matrix multiplication algorithm. In International Conference on Parallel Processing, volume III, pages 104-108, 1992.
7. J . R . Johnson, R . W . Johnson, D. Rodriguez, and R. Tolimieri. A methodology for designing, modifying and implementing fourier transform algorithms on various architectures. Circuits Systems Signal Process, 9(4):450-500, 1990.
8. R.W. Johnson, C.-H. Huang, and J . R . Johnson. Multilinear algebra and parallel programming. Journal of Supercomputing, 5:189-218, 1991.
9. S.D. Kaushik, S. Sharma, C.-H. Huang, J . R . Johnson, R.W. Johnson, and P. Sadayappan. An algebraic theory for modelling direct interconnection networks. In Supercomputing '92, Nov. 1992.
10. K. Knobe, J. Lukas, and G. Steele. Data optimization: Allocation of arrays to reduce communciation on SIMD machines. J. Parallel and Distributed Computing, 8(2):102-118, 1990.
11. C. Koelbel. Compile-time generation of communication for scientific programs. In Supercomputing '91, pages 101-110, Nov. 1991.
12. J. Li and M. Chen. Index domain alignment: Minimizing cost of cross-referencing between distributed arrays. Technical Report YALEU/DCS/TR-725, Yale University, Dept. of Computer Science, Nov. 1989.
13. J. Li and M. Chen. Compiling communication-efficient programs for massively parallel machines. IEEE Transactions on Parallel and Distributed Systems, 2(3):361-376, July 1991.
14. C.V. Loan. Computational framework for the Fast Fourier Transform. SIAM, 1 edition, 1992.