Constraint based vectorization
Pages 195 - 204
Abstract
The constraint tree provides a uniform framework for representing many loop transformations. It allows us to estimate the performance of several alternative execution methods before committing to any of the transformations.
We introduce the constraint tree, show how it is built, and demonstrate its use for vectorization and parallel decomposition. We show how unconstrained loops can be moved to reduce the costs of memory accesses.
References
[1]
J.R. Allen, "Dependence analysis for subscripted variables and its application to program transformations", Ph.D. Dissertation, Department of Mathematical Sciences, Rice University, Houston, TX, April 1983.
[2]
J.R. Allen, D. C~llahan, and K. Kennedy, "Automatic Decomposition of Scientific Programs for Parallel Execution", Report TR86-42, Department of Oomputer Science, Rice University, Houston, TX, November, 1986.
[3]
R. Allen, K. Kennedy, "Automatic Translation of FORTRAN Programs to Vector Form", Transactions or~ Proqramming Lar~gua~tes and Systems, 9,4 October 1987. pp. 491-542.
[4]
U. Banerjee, "D~ta dependence in ordinary programs", Report 76-837, Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, II, 1979.
[5]
D. Callahan,"Dependence testing in PFC: Weak Separability", Supercomputer Software Newsletter ~2, Rice University, August 1986.
[6]
W. L. Cohagen, "Vector Optimization for the ASC", Proc. Sever~th Annual Princeton Conferer~ce on Informatio~ Sciences and Systems, Department of Electrical Engineering, Princeton, N J, 1973.
[7]
J. Ferrante, K. Ottenstein, J. Warren, "Tile Program dependence graph and its Use in Optimization", Transactions or~ Programmin9 Languages and Systems, 9,3 July 1987. pp. 319-349.
[8]
F. Irigoin, R. Triolet, "Computing Dependence Direction Vectors and Dependence Cones with Linear Systems," EBSNP-CAt-87-E94, Ecole des Mines de Paris, Fontainebleau, France. August 1986.
[9]
D.J. Kuck, The Structure of Computers and Computatior~s, Volume 1, John Wiley and Sons, New York, 1978.
[10]
D. J. Kuck, R. H. Kuhn, B. Leasure, M. Wolfe, "The structure of an advanced vectorizer for pipelined processors'', Proc. IEEE Computer Society Fourth In.t'l Computer Software and Applications Conference, IEEE, Chicago, II, October 1980.
[11]
D. J. Kuck, R. H. Kuhn, B. Leasure, M. Wolfe, "Analysis and transform;rtion of programs for parallel computation", Proc. IEEE Computer Society Fourth Int'l Computer Software and Applications Conference, IEEE, Chicago, II, October 1980.
[12]
L. Lamport, "The parallel execution of DO loops", CACM 17, February 1974, pp. 83-93.
[13]
D. Padua, M. Wolfe, "Advanced Compiler Optimizations for Supercomputers,' CACM 29,12 December 1986, pp. 1184-1201.
[14]
R. Sc~rborough, H. Kolsky, "A Vectorizing Fortran Compiler", IBM Journal of Research and Development, 30,2 March 1986. pp. 163-171.
[15]
R. Tarjan "Depth first search and linear graph algorithms", SIAM Journal of Computinq, 1,2 1972. pp. 146-160.
[16]
M.J. Wolfe, "Techniques for improving the inherent, parallelism in programs", Repor~ 78-929, Dep~rtlnent: of Computer Science, University of Illinois at Urbana- Champaign, Urbana, I1, July 1978.
Index Terms
- Constraint based vectorization
Recommendations
Outer-loop vectorization: revisited for short SIMD architectures
PACT '08: Proceedings of the 17th international conference on Parallel architectures and compilation techniquesVectorization has been an important method of using data-level parallelism to accelerate scientific workloads on vector machines such as Cray for the past three decades. In the last decade it has also proven useful for accelerating multi-media and ...
Vectorisation avoidance
Haskell '12: Proceedings of the 2012 Haskell SymposiumFlattening nested parallelism is a vectorising code transform that converts irregular nested parallelism into flat data parallelism. Although the result has good asymptotic performance, flattening thoroughly restructures the code. Many intermediate data ...
Vectorisation avoidance
Haskell '12Flattening nested parallelism is a vectorising code transform that converts irregular nested parallelism into flat data parallelism. Although the result has good asymptotic performance, flattening thoroughly restructures the code. Many intermediate data ...
Comments
Information & Contributors
Information
Published In
June 1989
484 pages
Copyright © 1989 ACM.
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]
Sponsors
- AICA: Assoc Italianai de Calcolo Automatico
- Computer Tech Inst.: Computer Technology Institute
- SIGARCH: ACM Special Interest Group on Computer Architecture
- SIAM: Society for Industrial and Applied Mathematics
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 June 1989
Check for updates
Qualifiers
- Article
Conference
ICS89
Sponsor:
- AICA
- Computer Tech Inst.
- SIGARCH
- SIAM
Acceptance Rates
Overall Acceptance Rate 629 of 2,180 submissions, 29%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 248Total Downloads
- Downloads (Last 12 months)39
- Downloads (Last 6 weeks)7
Reflects downloads up to 12 Nov 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in