Reducing data communication overhead for DOACROSS loop nests

Proceedings of the International Conference on Supercomputing

Volumn Part F129421, Issue , 1994, Pages 44-53

  Tang, Peiyi ^a   Zigman, John N ^a  

^a AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

CACHE MEMORY; CONVOLUTIONAL CODES;

COMMUNICATION OVERHEADS; COMPILER ALGORITHMS; DATA DEPENDENCE; DATA-COMMUNICATION; DISTRIBUTED MEMORY MULTICOMPUTERS; INDEPENDENT TASKS; MULTICOMPUTERS; PARALLEL MACHINE;

MESSAGE PASSING;

EID: 0012652657     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/181181.181261     Document Type: Conference Paper

References (11)

1. P. Tang, "Chain-Based Scheduling: Part I-Loop Transformations and Code Generation," Department of Computer Science, The Australian National University, Technical Report TR-CS-92-09, June 1992.
2. C. Ancourt and F. Irigoin, "Scanning Polyhedra with DO Loops," in Proceedings of the 'lkird ACM SIGPLAN Symposium on Principle and Practice of Parallel Programming, Williamsburg, Virginia, April 21-24.1991, pp. 39-50.
3. M. E. Wolf and M. S. Lam, "A Loop Transformation Theory and an Algorithm to Maximize IE'arallelism," IEEE Transactions on Parallel and Distributed Systems, vol. 2. no. 4, pp. 452-471, October 1991.
4. L. Lamport. "The Parallel Execution of DO Loops," Communications of the ACM. vol. 17, no. 2, pp. 83-93. February 1974.
5. D. A. Padua and M. J. Wolfe, "Advanced Compiler Optimization for Supercomputers," Communications of the ACM. vol. 29, no. 12, pp. 1184-1201, December 1986.
6. H. Zima and B. Chapman, Supercompilers for Parallel and Vector Computers. Addison-Wesley Publishing Company, 1991.
7. E. H. D'Hollanlder, "Partitioning and Labeling of Loops By Unimo dular Transformations," IEEE Transactions on Parallel and Distributed Systems, vol. 3, no. 4, pp. 465-476, July 1992.
8. J-K. Peir and R. Cytron, "Minimum Distance: A Method for Partitioning Recurrences for Multiprocessors," IEEE Transactions on Computers, vol. 38, no. 8, pp. 1203-1211, August 1989.
9. P. Feautrier, "Array Expansion," in Proceedings of the 1988 ACM International Conference on Supercomputing, Malo France, July 1988, pp. 429-441.
10. -"Dataflow Analysis for Array and Scalar References," International Journal of Parallel Programming, vol. 20, no, 1, pp. 23-53, 1991.
11. P. Tang and J. N. Zigman. "Reducing Data Communication Overhead for Doacross Loop Nests,)' Department of Computer Science, The Australian National University, Technical Report TR-CS-93-16, December 1993.