Generating Indexing Functions of Regularly Sparse Arrays for Array Compilers

Author

• Scott Thibault, University of Missouri - Rolla
• Lenore Mullin, University of Missouri - Rolla
• Matt Insall, University of Missouri - RollaFollow

Abstract

There are many applications involving arrays that contain non-zero components in regular geometric partitions. These include triangular, diagonal, tridiagonal, banded, etc. When computing with this type of arrays, they are usually stored in a packed form and computations are performed with only the non-zero components. This packed form requires an indexing function that maps an index of the array to an index of the packed lexico-graphically stored array. This paper presents a method of describing regular partitions and of automatically generating an indexing function from that description. These methods enable an array compiler to compile array operations on these type of arrays in an efficient manner.

Recommended Citation

Thibault, Scott; Mullin, Lenore; and Insall, Matt, "Generating Indexing Functions of Regularly Sparse Arrays for Array Compilers" (1994). Computer Science Technical Reports. 157.
https://scholarsmine.mst.edu/comsci_techreports/157

Department(s)

Computer Science

Second Department

Mathematics and Statistics

Comments

The first Author is a Graduate Student

Report Number

CSc-94-08

Document Type

Technical Report

Document Version

Final Version

File Type

text

Language(s)

English

Rights

© 1994 University of Missouri - Rolla, All rights reserved

Publication Date

5 April, 1994