Runtime Composition of Iterations for Fusing Loop-carried Sparse Dependence

Cheshmi, Kazem; Strout, Michelle; Mehri Dehnavi, Maryam

doi:10.1145/3581784.3607097

Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis 2023

DOI: 10.1145/3581784.3607097

|View full text |Cite

Runtime Composition of Iterations for Fusing Loop-carried Sparse Dependence

Kazem Cheshmi,

Michelle Strout,

Maryam Mehri Dehnavi

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2024

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

References 37 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

CoNST: Code Generator for Sparse Tensor Networks

Raje,

Xu,

Rountev

et al. 2024

ACM Trans. Archit. Code Optim.

View full text Add to dashboard Cite

Sparse tensor networks represent contractions over multiple sparse tensors. Tensor contractions are higher-order analogs of matrix multiplication. Tensor networks arise commonly in many domains of scientific computing and data science. Such networks are typically computed using a tree of binary contractions. Several critical inter-dependent aspects must be considered in the generation of efficient code for a contraction tree, including sparse tensor layout mode order, loop fusion to reduce intermediate tensors, and the mutual dependence of loop order, mode order, and contraction order. We propose CoNST, a novel approach that considers these factors in an integrated manner using a single formulation. Our approach creates a constraint system that encodes these decisions and their interdependence, while aiming to produce reduced-order intermediate tensors via fusion. The constraint system is solved by the Z3 SMT solver and the result is used to create the desired fused loop structure and tensor mode layouts for the entire contraction tree. This structure is lowered to the IR of the TACO compiler, which is then used to generate executable code. Our experimental evaluation demonstrates significant performance improvements over current state-of-the-art sparse tensor compiler/library alternatives.

show abstract

CoNST: Code Generator for Sparse Tensor Networks

Raje,

Xu,

Rountev

et al. 2024

ACM Trans. Archit. Code Optim.

View full text Add to dashboard Cite

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

Runtime Composition of Iterations for Fusing Loop-carried Sparse Dependence

Cited by 1 publication

References 37 publications

CoNST: Code Generator for Sparse Tensor Networks

CoNST: Code Generator for Sparse Tensor Networks

Contact Info

Product

Resources

About