[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
article
Free access

A unified framework for systematic loop transformations

Published: 01 April 1991 Publication History
First page of PDF

References

[1]
J.l#. Allen. Dependence Analysis for Subscript Variables and Its Application to Program Transformation.PhD thesis, Rice University, Apr. 1983.
[2]
J.R. Allen and K. Kennedy. Automatic translation of fortran programs to vector form. A CM Transactions on Programming Languages and Systems., 9(4):491-542, Oct. 1987.
[3]
U. Banerjee. A theory of loop permutation. Technical report, Intel Corporation, 1989.
[4]
U. Banerjee. Unimodular transformations of double loops, in Proc. 3rd Workshop on Programming Languages and Compilers for Parallel Computing. U C. Irvine, 1990.
[5]
M.C. Chen. A design methodology for synthesizing parallel algorithms and architectures. Journal of Parallel and Distributed Computing, Dec. 1986.
[6]
M.C. Chen, Y. Choo, and J. Li. Compiling parallel programs by optimizing performance. The Journal of Supercomputing, 1(2):171-207, July 1988.
[7]
J.M. Delosme and I.C.F. Ipsen. Systolic array synthesis: Computability and time cones. Technical Report RR-474, Yale University, 1986.
[8]
F. Fernandez and P. Quinton. Extension of Chernikova's algorithm for solving general mixed linear programming problems. Technical Report 437, INRIA-Rennes, Oct. 1988.
[9]
R.M. Karp, R.E. Miller, and S. Winograd. The organization of computations for uniform recurrence equations. Journal of the ACM, 14(3):563-590, July 1967.
[10]
S.Y. Kung, K.S. Arun, I#.J. Gal-Ezer, and D.V.B. Rao. Wavefront array processor: Language, architecture, and applications. IEEE Transactions on Computer, 31(11):1054-1066, Nov. 1982.
[11]
L. Lamport. The parallel execution of DO loops. Communications of the A CM, 17(2):83-93, Feb. 1974.
[12]
L.C. Lu and M.C. Chen. New loop transformation techniques for massive parallelism. TechnicM Report TR-833, Yale University, Oct. 1990.
[13]
W.L. Miranker and A. Winkler. Spacetime representations of computational structures. In Computing, volume 32, pages 93- 114, 1984.
[14]
D.I. Moldovan. On the design of algorithms for VLSI systolic arrays. Proceedings of the IEEE, 71(1), 1983.
[15]
P. Quinton and V.V. Dongen. The mapping of linear recurrence equations on regular arrays. Technical Report 485, INRIA-Rennes, July 1989.
[16]
M.E. Wolf and M.S. Lain. Maximizing parallelism via loop transformations. In Proc. 3rd Workshop on Programming Languages and Compilers for Parallel Computing. U C. Irvine, 1990.
[17]
M. Wolfe. Optimizing Supercompilers for Supercomputers. PhD thesis, University of Illinois at Urbana-Champaign, Oct. 1982.
[18]
M. Wolfe. More iteration space tiling. In Proc. Supercomputing '89, Nov. 1989.
[19]
M. Wolfe. Optimizing Supercompilers for Supercomputers. The MIT Press, 1989.

Cited By

View all
  • (2020)Optimizing the Linear Fascicle Evaluation Algorithm for Multi-core and Many-core SystemsACM Transactions on Parallel Computing10.1145/34180757:4(1-45)Online publication date: 25-Nov-2020
  • (2016)Optimizing sparse matrix computations through compiler-assisted programmingProceedings of the ACM International Conference on Computing Frontiers10.1145/2903150.2903157(100-109)Online publication date: 16-May-2016
  • (2005)Automatic parallelization in the polytope modelThe Data Parallel Programming Model10.1007/3-540-61736-1_44(79-103)Online publication date: 4-Jun-2005
  • Show More Cited By

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM SIGPLAN Notices
ACM SIGPLAN Notices  Volume 26, Issue 7
July 1991
223 pages
ISSN:0362-1340
EISSN:1558-1160
DOI:10.1145/109626
Issue’s Table of Contents
  • cover image ACM Conferences
    PPOPP '91: Proceedings of the third ACM SIGPLAN symposium on Principles and practice of parallel programming
    April 1991
    223 pages
    ISBN:0897913906
    DOI:10.1145/109625
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 April 1991
Published in SIGPLAN Volume 26, Issue 7

Check for updates

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)67
  • Downloads (Last 6 weeks)13
Reflects downloads up to 18 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2020)Optimizing the Linear Fascicle Evaluation Algorithm for Multi-core and Many-core SystemsACM Transactions on Parallel Computing10.1145/34180757:4(1-45)Online publication date: 25-Nov-2020
  • (2016)Optimizing sparse matrix computations through compiler-assisted programmingProceedings of the ACM International Conference on Computing Frontiers10.1145/2903150.2903157(100-109)Online publication date: 16-May-2016
  • (2005)Automatic parallelization in the polytope modelThe Data Parallel Programming Model10.1007/3-540-61736-1_44(79-103)Online publication date: 4-Jun-2005
  • (2021)Verified code generation for the polyhedral modelProceedings of the ACM on Programming Languages10.1145/34343215:POPL(1-24)Online publication date: 4-Jan-2021
  • (2016)An approach for code generation in the Sparse Polyhedral FrameworkParallel Computing10.1016/j.parco.2016.02.00453:C(32-57)Online publication date: 1-Apr-2016
  • (2005)A singular loop transformation framework based on non-singular matricesLanguages and Compilers for Parallel Computing10.1007/3-540-57502-2_60(391-405)Online publication date: 3-Jun-2005
  • (2005)A new program transformation to minimise communication in distributed memory architecturesPARLE '92 Parallel Architectures and Languages Europe10.1007/3-540-55599-4_98(345-362)Online publication date: 14-Jul-2005
  • (2003)Compile-time composition of run-time data and iteration reorderingsProceedings of the ACM SIGPLAN 2003 conference on Programming language design and implementation10.1145/781131.781142(91-102)Online publication date: 9-Jun-2003
  • (2003)Compile-time composition of run-time data and iteration reorderingsACM SIGPLAN Notices10.1145/780822.78114238:5(91-102)Online publication date: 9-May-2003
  • (1995)Beyond unimodular transformationsThe Journal of Supercomputing10.1007/BF012062739:4(365-389)Online publication date: 1-Dec-1995
  • Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media