Abstract
In this paper we investigate the optimization of state machine based representations of access sequence and local iteration set (LIS) information. Two state machine based representations are shown to have complementary strengths. We develop a third representation, the hybrid state machine, that utilizes the strengths of the other two methods. A new optimization is presented that allows state machine reuse across references, reducing the cost of state machine based accesses. Experimental data is presented to support the approach taken.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
S. Chatterjee, J. R. Gilbert, F. J. E. Long, R. Schreiber, and S-H. Teng. Generating local addresses and communication sets for data-parallel programs. In Proc. 4th annual ACM Symposium on Principles and Practice of Parallel Programming, San Diego, CA, May 1993.
S.K.S. Gupta, S.D. Kaushik, C.-H. Huang, and P. Sadayappan. On compiling array expressions for efficient execution on distributed memory machines. Journal of Parallel and Distributed Computing, Apr 1996.
K. Kennedy, N. Nedeljković, and A. Sethi. A linear time algorithm for computing the memory access sequence in data-parallel programs. Technical report, Center for Research on Parallel Computation, Rice Univ., 1994. Tech Report CRPC-TR94485-S.
C. Koelbel and P. Mehrotra. Compiling global name-space parallel loops for distributed execution. IEEE Trans. Parallel and Distributed Systems, 2(4):440–451, Oct. 1991.
S. P. Midkiff. Local iteration set computation for block-cyclic distributions. In C. Polychronopoulos, editor, Proceedings of the 24 'th International Conference on Parallel Processing, pages 77–84. CRC Press, Aug. 1995.
C.-H. Huang S.D. Kaushik and P. Sadayappan. Incremental generation of index sets for array statement execution on distributed memory machines. In K. Pingali, U. Banerjee, D. Gelernter, A. Nicolau, and D. P adua, editors, Languages and Compilers for Parallel Computing, 7th Internationa l Workshop, pages 251–265, Ithaca, NY, USA, August 1994.
A. Thirumalai and J. Ramanujam. Efficient computation of address sequences in data-parallel programs using closed forms for basis vectors. Journal of Parallel and Distributed Computing, 1996. To appear.
L. Wang, J.M. Stichnoth, and S. Chatterjee. Runtime performance of parallel array asignment: An empirical study. In Proceedings of the 1996 ACM/IEEE Supercomputing Conference, Nov. 1996. To Appear.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Midkiff, S.P. (1997). Optimizing the representation of local iteration sets and access sequences for block-cyclic distributions. In: Sehr, D., Banerjee, U., Gelernter, D., Nicolau, A., Padua, D. (eds) Languages and Compilers for Parallel Computing. LCPC 1996. Lecture Notes in Computer Science, vol 1239. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0017267
Download citation
DOI: https://doi.org/10.1007/BFb0017267
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63091-3
Online ISBN: 978-3-540-69128-0
eBook Packages: Springer Book Archive