Constraint based vectorization

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Constraint based vectorization

Full text

Pdf (925 KB)

Source

International Conference on Supercomputing archive
Proceedings of the 3rd international conference on Supercomputing table of contents

Crete, Greece

Pages: 195 - 204

Year of Publication: 1989

ISBN:0-89791-309-4

Authors

Brian D. Koblenz	Digital Equipment Corporation
William B. Noyce	Digital Equipment Corporation

Sponsors

Computer Tech Inst. : Computer Technology Institute
SIGARCH: ACM Special Interest Group on Computer Architecture
SIAM : Society for Industrial and Applied Mathematics
AICA : Assoc Italianai de Calcolo Automatico

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 8, Downloads (12 Months): 13, Citation Count: 0

Additional Information:

abstract references index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/318789.318811 What is a DOI?

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

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	Alle83	John Randal Allen, Dependence analysis for subscripted variables and its application to program transformations, 1983
	ACK86	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.
	AK87	Randy Allen , Ken Kennedy, Automatic translation of FORTRAN programs to vector form, ACM Transactions on Programming Languages and Systems (TOPLAS), v.9 n.4, p.491-542, Oct. 1987 [doi>10.1145/29873.29875]
	Bane76	U. Banerjee, "D~ta dependence in ordinary programs", Report 76-837, Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, II, 1979.
	Call86	D. Callahan,"Dependence testing in PFC: Weak Separability", Supercomputer Software Newsletter ~2, Rice University, August 1986.
	Coha73	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.
	FOW87	Jeanne Ferrante , Karl J. Ottenstein , Joe D. Warren, The program dependence graph and its use in optimization, ACM Transactions on Programming Languages and Systems (TOPLAS), v.9 n.3, p.319-349, July 1987 [doi>10.1145/24039.24041]
	IT86	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.
	Kuck78	David L. Kuck, Structure of Computers and Computations, John Wiley & Sons, Inc., New York, NY, 1978
	KKLW80a	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.
	KKLW80b	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.
	Lamp74	Leslie Lamport, The parallel execution of DO loops, Communications of the ACM, v.17 n.2, p.83-93, Feb. 1974 [doi>10.1145/360827.360844]
	PW86	David A. Padua , Michael J. Wolfe, Advanced compiler optimizations for supercomputers, Communications of the ACM, v.29 n.12, p.1184-1201, Dec. 1986 [doi>10.1145/7902.7904]
	SK86	Randolf G Scarborough , Harwood G Kolsky, A vectorizing Fortran compiler, IBM Journal of Research and Development, v.30 n.2, p.163-171, March 1986
	Tarj72	R. Tarjan "Depth first search and linear graph algorithms", SIAM Journal of Computinq, 1,2 1972. pp. 146-160.
	Wolf78	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.