Abstract
A technique is presented to implement a UNITY program [CM88] as a set of processes on a MIMD-architecture. The approach is based on the identification of specific data access patterns between statements. They give hints on the decomposition of the program into processes.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
R. Allen and K. Kennedy. Automatic Translation of FORTRAN Programs to Vector Form. ACM Transactions on Programming Languages and Systems, 9(4):491–542, October 1987.
V. Balasundaram and K. Kennedy. A Technique for Summarizing Data Access and Its Use in Parallelism Enhancing Transformations. In Proceedings of SIGPLAN '89, pages 41–53, New York, July 1989. ACM-SIGPLAN, ACM. SIGPLAN Notices 24(7), July 1989.
K.M. Chandy and J. Misra. Parallel Program Design — A Foundation. Addison-Wesley, 1988.
D.E. Goldberg. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, 1989.
B. Kruatrachue and T. Lewis. Grain Size Determination for Parallel Processing. IEEE Software, 1:23–32, January 1988.
C. McCreary and H. Gill. Automatic Determination of Grain Size for Efficient Parallel Processing. Communications of the ACM, 32(9):1073–1078, September 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bieler, F. (1990). Partitioning programs into processes. In: Burkhart, H. (eds) CONPAR 90 — VAPP IV. VAPP CONPAR 1990 1990. Lecture Notes in Computer Science, vol 457. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53065-7_129
Download citation
DOI: https://doi.org/10.1007/3-540-53065-7_129
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53065-7
Online ISBN: 978-3-540-46597-3
eBook Packages: Springer Book Archive