Compiling communication-efficient programs for massively parallel machines
- 1 July 1991
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 2 (3) , 361-376
- https://doi.org/10.1109/71.86111
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Index domain alignment: minimizing cost of cross-referencing between distributed arraysPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Process decomposition through locality of referencePublished by Association for Computing Machinery (ACM) ,1989
- A methodology for parallelizing programs for multicomputers and complex memory multiprocessorsPublished by Association for Computing Machinery (ACM) ,1989
- Compiling parallel programs by optimizing performanceThe Journal of Supercomputing, 1988
- Compiling programs for distributed-memory multiprocessorsThe Journal of Supercomputing, 1988
- Compiling C* programs for a hypercube multicomputerPublished by Association for Computing Machinery (ACM) ,1988
- SUPERB: A tool for semi-automatic MIMD/SIMD parallelizationParallel Computing, 1988
- Communication efficient basic linear algebra computations on hypercube architecturesJournal of Parallel and Distributed Computing, 1987
- Advanced compiler optimizations for supercomputersCommunications of the ACM, 1986
- A Scheme for Fast Parallel CommunicationSIAM Journal on Computing, 1982