Optimal reordering and mapping of a class of nested-loops for parallel execution

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1239, Issue , 1997, Pages 315-329

  Lam, Chi Chung ^a   Sadayappan, P ^a   Wenger, Rephael ^a  

^a OHIO STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; MULTIPROCESSING SYSTEMS; PROGRAM COMPILERS;

COMPUTATIONAL PHYSICS; DISTRIBUTIVE LAWS; FORMAL DESCRIPTION; INTER PROCESSOR COMMUNICATION; MINIMIZATION PROBLEMS; OPTIMAL DISTRIBUTIONS; OPTIMAL SOLUTIONS; PARALLEL EXECUTIONS;

PARALLEL PROCESSING SYSTEMS;

EID: 84957628596     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0017261     Document Type: Conference Paper

References (11)

1. C. N. Fischer and R. J. Leblanc Jr. Crafting a Compiler. Menlo Park, CA: Benjamin/ Cummings, 1991.
2. Michael R. Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. New York: W. H. Freeman, 1979.
3. Ken Kennedy and Kathryn S. McKinley. Maximizing Loop Parallelism and Improving Data Locality via Loop Fusion and Distribution. In Languages and Compilers for Parallel Computing, August 1993, 301-320.
4. Ken Kennedy and Kathryn S. McKinley. Optimizing for Parallelism and Data Locality. In Proceedings of the 1992 ACM International Conference on Supercomputing, July 1992, 323-334.
5. V. Kumar, A. Grama, A. Gupta, and G. Karypis. Introduction to Parallel Computing: Design and Analysis of Algorithms. RedWood City, CA: Benjamin/Cummings, 1994.
6. C. C. Lu and W. C. Chew. Fast Algorithm for Solving Hybrid Integral Equations. In IEE Proceedings-H, 140(6): 455-460, December 1993.
7. Edmund K. Miller. Solving Bigger Problems- By Decreasing the Operation Count and Increasing the Computation Bandwidth. In Proceedings of the IEEE, 79(10): 1493-1504, October 1991.
8. M. Potkonjak, M. B. Srivastava, and A. P. Chandrakasan. Multiple Constant Multiplications: Efficient and Versatile Framework and Algorithms for Exploring Common Subexpression Elimination. IEEE Transactions on Computer-aided Design of Integrated Circuits and Systems, 15(2): 151-164, February 1996.
9. S. Winograd. Arithmetic complexity of computations. Philadelphia: Society for Industrial and Applied Mathematics, 1980.
10. M. Wolfe. High Performance Compilers for Parallel Computing. Addison Wesley, 1996.
11. Michael E. Wolf and Monica S. Lam. A Data Locality Algorithm. In Proceedings of the SIGPLAN '91 Conference on Programming Language Design and Implementation, June 1991, 30-44.