Abstract
Ownership sets are fundamental to the partitioning of program computations across processors by the owner-computes rule. These sets arise due to the mapping of data arrays onto processors. In this paper, a we focus on how ownership sets can be efficiently determined in the context of the HPF language, and show how the structure of these sets can be symbolically characterized in the presence of arbitrary data alignment and data distribution directives. Our starting point is a system of equalities and inequalities due to Ancourt et al. that captures the array mapping problem in HPF. We arrive at a refined system that enables us to efficiently solve for the ownership set using the Fourier-Motzkin Elimination technique, and which requires the course vector as the only auxiliary vector. We develop b important and general properties pertaining to HPF alignments and distributions, and show how they can be used to eliminate redundant communication due to array replication. We also show how the generation of communication code can be avoided when pairs of array references are ultimately mapped onto the same processors. Experimental data demonstrating the improved code performance that the latter optimization enables is presented and discussed.
This research was partially supported by the National Science Foundation under Grant NSF CCR–9526325, and in part by DARPA under Contract F30602–98–2–0144.
A longer version of this paper has been submitted to the IEEE Transactions on Parallel and Distributed Processing.
The proofs for all lemmas and theorems are available in [9].
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
C. Ancourt, F. Coelho, F. Irigoin, and R. Keryell. “A Linear Algebra Framework for Static HPF Code Distribution”. Technical Report A-278-CRI, Centre de Recherche en Informatique, École Nationale Supérieure des Mines de Paris, 35, rue Saint-Honoroé, F-77305 Fontainebleau cedex, France, November 1995.
V. Balasundaram. “A Mechanism for keeping Useful Internal Information in Parallel Programming Tools-The Data Access Descriptor”. Journal of Parallel and Distributed Computing, 9(2):154–170, June 1990.
U. Banerjee. Loop Transformations for Restructuring Compilers: The Foundations. Kluwer Academic Publishers, Norwell, MA 02061, USA, January 1993. ISBN 0-7923-9318-X.
P. Banerjee, J. A. Chandy, M. Gupta, E. W. Hodges IV, J. G. Holm, A. Lain, D. J. Palermo, S. Ramaswamy, and E. Y.-H. Su. “The PARADIGM Compiler for Distributed-Memory Multicomputers”. IEEE Computer, 28(10):37–47, October 1995.
S. Chatterjee, J. R. Gilbert, F. J. E. Long, R. S. Schreiber, and S.-H. Teng. “Generating Local Addresses and Communication Sets for Data-Parallel Programs”. In the 4th ACM SIGPLAN Symposium on Principles Exploiting Ownership Sets in HPF 273 and Practices of Parallel Programming, pages 149–158, San Diego, CA, USA, May 1993.
D. Callahan and K. Kennedy. “Analysis of Interprocedural Side Effects in a Parallel Programming Environment”. In the 1st ACM International Conference on Supercomputing, pages 138–171, Athens, Greece, May 1987.
S. K. S. Gupta, S. D. Kaushik, S. Mufti, S. Sharma, C.-H. Huang, and P. Sadayappan. “On Compiling Array Expressions for Efficient Execution on Distributed-Memory Machines”. In 22nd International Conference on Parallel Processing; Editors: A. Choudhary and P. B. Berra, volume II of Software, pages 301–305, St. Charles, IL, USA, August 1993. The Pennsylvania State University, CRC Press, Inc., Boca Raton, FL, USA.
M. Gupta. “Automatic Data Partitioning on Distributed Memory Multicomputers”. Ph.D. dissertation, University of Illinois at Urbana-Champaign, Department of Electrical and Computer Engineering, September 1992.
P. G. Joisha and P. Banerjee. “Analyzing Ownership Sets in HPF”. Technical Report CPDC-TR-9906-012, Center for Parallel and Distributed Computing, Department of Electrical and Computer Engineering, Northwestern University, 2145 Sheridan Road, Evanston, IL, USA, January 1999.
C. H. Koelbel, D. B. Loveman, R. S. Schreiber, G. L. Steele Jr., and M. E. Zosel. The High Performance Fortran Handbook. Scientific and Engineering Computation Series. The MIT Press, Cambridge, MA 02142, USA, 1994. ISBN 0-262-61094-9.
S. P. Midkiff. “Local Iteration Set Computation for Block-Cyclic Distributions”. In 24th International Conference on Parallel Processing; Editor: C. D. Polychronopoulos, volume II of Software, pages 77–84, Oconomowoc, WI, USA, August 1995. The Pennsylvania State University, CRC Press, Inc., Boca Raton, FL, USA.
A. Schrijver. Theory of Linear and Integer Programming. Wiley-Interscience Series in Discrete Mathematics. John Wiley & Sons, Inc., New York City, NY 10158, USA, 1986. ISBN 0-471-90854-1.
E. Y.-H. Su, D. J. Palermo, and P. Banerjee. “Processor Tagged Descriptors: A Data Structure for Compiling for Distributed-Memory Multicomputers”. In the 1994 International Conference on Parallel Architectures and Compilation Techniques, pages 123–132, Montréal, Canada, August 1994.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Joisha, P.G., Banerjee], P. (2001). Exploiting Ownership Sets in HPF. In: Midkiff, S.P., et al. Languages and Compilers for Parallel Computing. LCPC 2000. Lecture Notes in Computer Science, vol 2017. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45574-4_17
Download citation
DOI: https://doi.org/10.1007/3-540-45574-4_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42862-6
Online ISBN: 978-3-540-45574-5
eBook Packages: Springer Book Archive