Article

Free access

Advanced compiler optimizations for sparse computations

Authors:

A. J. C. Bik,

H. A. G. WijshoffAuthors Info & Claims

Supercomputing '93: Proceedings of the 1993 ACM/IEEE conference on Supercomputing

Pages 430 - 439

https://doi.org/10.1145/169627.169765

Published: 01 December 1993 Publication History

PDF eReader

References

[1]

U. Banerjee. Dependence Analysis }or Supercomputing. Kluwer Academic Publishers, Boston, 1988.

Digital Library

Google Scholar

[2]

U. Banerjee. Loop Transformations }or Restructuring Compilers: The Foundations. Kluwer Academic Publishers, Boston, 1993.

Digital Library

Google Scholar

[3]

Aart J.C. Bik. A prototype restructuring compiler. Master's thesis, Utrecht University, 1992. INF/SCR-92-11.

Google Scholar

[4]

Aart J.C. Bik and Harry A.G. Wijshoff. Advanced compiler optimizations for sparse computations. Technical Report no. 92-24, Dept. of Computer Science, Leiden University, 1992.

Google Scholar

[5]

Aart J.C. Bik and Harry A.G. Wijshoff. Compilation techniques for sparse matrix computations. In Proceedings of the International Conference on Supercomputing, pages 416-424, 1993.

Digital Library

Google Scholar

[6]

Aart J.C. Bik and Harry A.G. Wijshoff. On automatic data structure selection and code generation for sparse computations. In Proceedings o} the Sixth Annual on Languages and Compilers for Parallelism Workshop, 1993.

Digital Library

Google Scholar

[7]

Ron G. Cytron. Doacross, beyond vectorization for multiprocessors. In Proceedings of the 1986 International Con- }erence on Parallel Processing, pages 836-844, 1986.

Google Scholar

[8]

Ron G. Cytron. Limited processor scheduling of doacross loops. In Proceedings of the 1987 International Conference on Parallel Processing, pages 226-234, 1987.

Google Scholar

[9]

E.W. Dijkstra. Cooperating sequential processes. In F. Genuys, editor, Programming Languages. Academic Press, New York, 1968.

Google Scholar

[10]

I.S. Duff, A.M. Erisman, and J.K. Reid. Direct Methods }or Sparse Matrices. Oxford Science Publications, 1990.

Digital Library

Google Scholar

[11]

Alan George and Joseph W. Liu. Computer Solution of Large Sparse Positive Definite Systems. Prentice-Hall Inc., 1981.

Digital Library

Google Scholar

[12]

David J. Kuck. The Structure of Computers and Computations. John Wiley and Sons, New York, 1978. Volume 1.

Digital Library

Google Scholar

[13]

Zhiyuan Li and Walid Abu-Sufah. On reducing data synchronization in multiprocessed loops. IEEE Transactions on Computers, pages 105-109, 1987.

Digital Library

Google Scholar

[14]

Samuel P. Midldff. The Dependence Analysis and Synchronization o:f Parallel Programs. PhD thesis, C.S.R.D., 1993.

Google Scholar

[15]

Samuel P. Midldff and David A. Padua. Compiler generated synchronization for do loops. In Proceedings of the 1986 International Conference on Parallel Processing, pages 544- 551, 1986.

Google Scholar

[16]

Samuel P. Midldff and David A. Padua. Compiler algorithms for synchronization. IEEE Transactions on Computers, pages 1485-1495, 1987.

Digital Library

Google Scholar

[17]

David A. Padua and Michael J. Wolfe. Advanced compiler optimizations for supercomputers. Communications of the A CM, pages 1184-1201, 1986.

Digital Library

Google Scholar

[18]

Sergio Pissanetsky. Sparse Matrix Technology. Academic Press, London, 1984.

Google Scholar

[19]

C.D. Polychronoupolos. Parallel Programming and Compilers. Kluwer Academic Publishers, Boston, 1988.

Digital Library

Google Scholar

[20]

William Pugh and David Wonnacott. An evaluation of exact methods for analysis of value-based array data dependences. In Proceedings of the Sixth Annual Workshop on Languages and Compilers }or Parallel Computing, 1993.

Digital Library

Google Scholar

[21]

Michael J. Quinn. Designing E.O~cient Algorithms }or Parallel Computers. McGraw-Hill, 1987.

Digital Library

Google Scholar

[22]

Joel H. Saltz, Ravi Mirchandaney, and Kathleen Crowley. The doconsider loop. In A CM Conference Proceedings, 3th international Conference of Supercomputing, pages 29-40, 1989.

Digital Library

Google Scholar

[23]

Joel H. Saltz, Ravi Mirchandaxmy, and Kathleen Crowley. Run-time parallelization and scheduling of loops. IEEE Transactions on Computers, pages 603-612, 1991.

Digital Library

Google Scholar

[24]

Gerard Tel. Introduction to distributed algorithms, volume 1. Course Notes INF/DOC-92-05, Utrecht University, 1992.

Digital Library

Google Scholar

[25]

Michael J. Wolfe. Optimizing Supercompilers }or Supercomputers. Pitman, London, 1989.

Digital Library

Google Scholar

[26]

Chuan-Qi Zhu and Pen-Chung Yew. A scheme to enforce data dependence on large multiprocessor systems. IEEE Transactions on Software Engineering, Volume SE-13:726- 739, 1987.

Digital Library

Google Scholar

[27]

H. Zima. Supercompilers }or Parallel and Vector Computers. ACM Press, New York, 1990.

Crossref

Google Scholar

[28]

Zahari Zlatev. Computational Methods :for General Sparse Matrices. Kluwer Academic Publishers, 1991.

Google Scholar

Cited By

View all

Puhan SPanda SLenka SSharma R(2021)Application of Data Structure Algorithm For Sparse Matrix Computation in Power System2021 International Conference in Advances in Power, Signal, and Information Technology (APSIT)10.1109/APSIT52773.2021.9641231(1-5)Online publication date: 8-Oct-2021
https://doi.org/10.1109/APSIT52773.2021.9641231
Strout MHall MOlschanowsky C(2018)The Sparse Polyhedral Framework: Composing Compiler-Generated Inspector-Executor CodeProceedings of the IEEE10.1109/JPROC.2018.2857721106:11(1921-1934)Online publication date: Nov-2018
https://doi.org/10.1109/JPROC.2018.2857721
Ahmad KVenkat AHall M(2017)Optimizing LOBPCG: Sparse Matrix Loop and Data Transformations in ActionLanguages and Compilers for Parallel Computing10.1007/978-3-319-52709-3_17(218-232)Online publication date: 24-Jan-2017
https://doi.org/10.1007/978-3-319-52709-3_17
Show More Cited By

Index Terms

Advanced compiler optimizations for sparse computations

Recommendations

Compiler Support for Sparse Tensor Computations in MLIR
Sparse tensors arise in problems in science, engineering, machine learning, and data analytics. Programs that operate on such tensors can exploit sparsity to reduce storage requirements and computational time. Developing and maintaining sparse software by ...
Compiler Optimizations for I/O-Intensive Computations
ICPP '99: Proceedings of the 1999 International Conference on Parallel Processing

This paper describes transformation techniques for out-of-core programs (i.e., those that deal with very large quantities of data) based on exploiting locality using a combination of loop and data transformations. Writing efficient out-of-core program ...
Compiler Analysis of Sparse and Irregular Computations

Comments

Information & Contributors

Information

Published In

Supercomputing '93: Proceedings of the 1993 ACM/IEEE conference on Supercomputing

December 1993

935 pages

ISBN:0818643404

DOI:10.1145/169627

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 December 1993

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SC '93

Sponsor:

SIGARCH
IEEE-CS

SC '93: International Conference for High Performance Computing, Networking, Storage and Analysis

November 15 - 19, 1993

Oregon, Portland, USA

Acceptance Rates

Supercomputing '93 Paper Acceptance Rate 72 of 300 submissions, 24%;

Overall Acceptance Rate 1,516 of 6,373 submissions, 24%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

18
Total Citations
View Citations
272
Total Downloads

Downloads (Last 12 months)27
Downloads (Last 6 weeks)2

Reflects downloads up to 12 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Puhan SPanda SLenka SSharma R(2021)Application of Data Structure Algorithm For Sparse Matrix Computation in Power System2021 International Conference in Advances in Power, Signal, and Information Technology (APSIT)10.1109/APSIT52773.2021.9641231(1-5)Online publication date: 8-Oct-2021
https://doi.org/10.1109/APSIT52773.2021.9641231
Strout MHall MOlschanowsky C(2018)The Sparse Polyhedral Framework: Composing Compiler-Generated Inspector-Executor CodeProceedings of the IEEE10.1109/JPROC.2018.2857721106:11(1921-1934)Online publication date: Nov-2018
https://doi.org/10.1109/JPROC.2018.2857721
Ahmad KVenkat AHall M(2017)Optimizing LOBPCG: Sparse Matrix Loop and Data Transformations in ActionLanguages and Compilers for Parallel Computing10.1007/978-3-319-52709-3_17(218-232)Online publication date: 24-Jan-2017
https://doi.org/10.1007/978-3-319-52709-3_17
Zhang HVenkat AHall M(2016)Compiler transformation to generate hybrid sparse computationsProceedings of the Sixth Workshop on Irregular Applications: Architectures and Algorithms10.5555/3018843.3018849(34-41)Online publication date: 13-Nov-2016
https://dl.acm.org/doi/10.5555/3018843.3018849
Zhang HVenkat AHall M(2016)Compiler Transformation to Generate Hybrid Sparse Computations2016 6th Workshop on Irregular Applications: Architecture and Algorithms (IA3)10.1109/IA3.2016.011(34-41)Online publication date: Nov-2016
https://doi.org/10.1109/IA3.2016.011
Venkat AHall MStrout M(2015)Loop and data transformations for sparse matrix codeACM SIGPLAN Notices10.1145/2813885.273800350:6(521-532)Online publication date: 3-Jun-2015
https://dl.acm.org/doi/10.1145/2813885.2738003
Leung ASarracino JLerner S(2015)Interactive parser synthesis by exampleACM SIGPLAN Notices10.1145/2813885.273800250:6(565-574)Online publication date: 3-Jun-2015
https://dl.acm.org/doi/10.1145/2813885.2738002
Samak MRamanathan MJagannathan S(2015)Synthesizing racy testsACM SIGPLAN Notices10.1145/2813885.273799850:6(175-185)Online publication date: 3-Jun-2015
https://dl.acm.org/doi/10.1145/2813885.2737998
Tassarotti JDreyer DVafeiadis V(2015)Verifying read-copy-update in a logic for weak memoryACM SIGPLAN Notices10.1145/2813885.273799250:6(110-120)Online publication date: 3-Jun-2015
https://dl.acm.org/doi/10.1145/2813885.2737992
Park DStefănescu ARoşu G(2015)KJS: a complete formal semantics of JavaScriptACM SIGPLAN Notices10.1145/2813885.273799150:6(346-356)Online publication date: 3-Jun-2015
https://dl.acm.org/doi/10.1145/2813885.2737991
Show More Cited By

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

Compiler Support for Sparse Tensor Computations in MLIR

Compiler Optimizations for I/O-Intensive Computations

Compiler Analysis of Sparse and Irregular Computations

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Upcoming Conference

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

References

Cited By

Index Terms

Recommendations

Compiler Support for Sparse Tensor Computations in MLIR

Compiler Optimizations for I/O-Intensive Computations

Compiler Analysis of Sparse and Irregular Computations

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Upcoming Conference

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations