Article

Free access

Vectorization beyond data dependences

Authors:

Peiyi Tang,

Nianshu GaoAuthors Info & Claims

ICS '95: Proceedings of the 9th international conference on Supercomputing

Pages 434 - 443

https://doi.org/10.1145/224538.224652

Published: 03 July 1995 Publication History

PDF eReader

References

[1]

R. Allen and K. Kennedy, "Automatic Translation of Fortran Programs to Vector Form," A CM Transactions on Programming Languages and Systems, vol. 9, no. 4, pp. 491-541, October 1987.

Digital Library

Google Scholar

[2]

M. Wolfe, Optimizing Compilers for Supercomputers. Cambridge, MA, MIT Press, 1989.

Digital Library

Google Scholar

[3]

D. J. Kuck, The Structure of Computers and Computations., John Wiley and Sons, Inc., 1978.

Digital Library

Google Scholar

[4]

H. Zima and B. Chapman, Supercompilers for Parallel and Vector Computers. New York, NY, ACM Press, 1990.

Crossref

Google Scholar

[5]

W. Pugh and D. Wonnacott, "Eliminating False Data Dependences Using the Omega Test," in Proceedings ot' ihe 1992 ACM SlGPLAN Conference on Programming Language Design and Implementation, San Francisco, California, June 17-19, 1992, pp. 140- 151.

Digital Library

Google Scholar

[6]

"Static Analysis of Upper and Lower Bounds on Dependences and Parallelism," ACM Transactions on Programming Languages and Systems, vol. 16, no. 4, pp. 1248-1278, July 1994.

Digital Library

Google Scholar

[7]

W. Kelly and W. Pugh, "A Framework for Unifying Reordering Transformations," University of Maryland, Technical Report CS-TR-3193, April 1993.

Digital Library

Google Scholar

[8]

W. Pugh, "Uniform Techniques for Loop Optimization,'' in Proceedings of 1991 ACM International Conference on Supercomputing, Cologne, Germany, June 1991, pp. 341-352.

Digital Library

Google Scholar

[9]

D. E. Maydan, J. L. Hennessy and M. S. Lam, "Effectiveness of Data Dependence Analysis," in Proceedings of the NSF-NCRD Workshop on Advanced Compilation Techniques for Novel Architectures, 1992.

Google Scholar

[10]

M. Wolfe, "Doany: Not Just Another Parallel Loop," in Proceedings of the 5th Workshop on Languages and Compilers for Parallel Computing, New Havem August 1992, pp. 277-282.

Digital Library

Google Scholar

Cited By

View all

Scott KDavidson J(2000)Exploring the limits of sub-word level parallelismProceedings 2000 International Conference on Parallel Architectures and Compilation Techniques (Cat. No.PR00622)10.1109/PACT.2000.888333(81-91)Online publication date: 2000
https://doi.org/10.1109/PACT.2000.888333
Suganuma TKomatsu HNakatani TYew P(1996)Detection and global optimization of reduction operations for distributed parallel machinesProceedings of the 10th international conference on Supercomputing10.1145/237578.237581(18-25)Online publication date: 1-Jan-1996
https://dl.acm.org/doi/10.1145/237578.237581

Index Terms

Recommendations

Outer-loop vectorization: revisited for short SIMD architectures
PACT '08: Proceedings of the 17th international conference on Parallel architectures and compilation techniques

Vectorization 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 Symposium

Flattening 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 '12

Flattening 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

ICS '95: Proceedings of the 9th international conference on Supercomputing

July 1995

448 pages

ISBN:0897917286

DOI:10.1145/224538

Chairman:
Mateo Valero
Univ. Polite`cnica de Catalunya

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: 03 July 1995

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

ICS95

Sponsor:

Univ Politecnica del Catalunya
SIGARCH
Oregon Graduate Institute

ICS95: 1995 International Conference on Supercomputing

July 3 - 7, 1995

Barcelona, Spain

Acceptance Rates

ICS '95 Paper Acceptance Rate 49 of 120 submissions, 41%;

Overall Acceptance Rate 629 of 2,180 submissions, 29%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
271
Total Downloads

Downloads (Last 12 months)25
Downloads (Last 6 weeks)6

Reflects downloads up to 12 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Scott KDavidson J(2000)Exploring the limits of sub-word level parallelismProceedings 2000 International Conference on Parallel Architectures and Compilation Techniques (Cat. No.PR00622)10.1109/PACT.2000.888333(81-91)Online publication date: 2000
https://doi.org/10.1109/PACT.2000.888333
Suganuma TKomatsu HNakatani TYew P(1996)Detection and global optimization of reduction operations for distributed parallel machinesProceedings of the 10th international conference on Supercomputing10.1145/237578.237581(18-25)Online publication date: 1-Jan-1996
https://dl.acm.org/doi/10.1145/237578.237581

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Outer-loop vectorization: revisited for short SIMD architectures

Vectorisation avoidance

Vectorisation avoidance