Abstract
This paper describes the use of the UNITY [6] notation and the UC compiler [2] in the design of parallel programs for execution on the Connection Machine CM2 (CM). We illustrate our ideas in the context of a computer simulation of particle diffusion and aggregation in a porous media.
We begin with a UNITY specification, progressively refine the specification to derive a UNITY program, translate the program to UC abstractions, which may be further refined to improve efficiency, and finally implement the program on the CM. Performance results on the efficiency of the program constructed using this approach are also included.
The work of this author was partially supported by NSF under grant CCR 9157610 and by ONR under grant N00014-91-J-1605
This article was processed using the IIEX macro package with LMAMULT style
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J. R. Allen and K. Kennedy, “A Parallel Programming Environment”, IEEE Software, 2:4, 22–29, July, (1985)
R. Bagrodia, K.M. Chandy and E. Kwan, UC: A Language for the Connection Machine, Supercomputing '90, New York, NY, November, (1990), 525–534
R. Bagrodia and S. Mathur, Efficient Implementation of High-Level Parallel Programs, ASPLOS-IV, April (1991)
J.C. Browne, M. Azam and S. Sobek, “The Computationally Oriented Display Environment (CODE) — A Unified Approach to Parallel Programming”, IEEE Software, July, 1989)
I. Chakravarty, M. Kleyn, T. Woo, R. Bagrodia and V. Austel, UNITY to UC: Case Studies in Parallel Program Construction, Schlumberger Laboratory for Computer Science, TR-90-21, November, (1990)
K. M. Chandy and J. Misra, Parallel Program Design — A Foundation, Addison Wesley, Reading, MA, (1989)
Marina C. Chen, Very-high-level Parallel Programming in Crystal, Yale University,Dec, 1986, YALEU/DCS/RR-506
Connection Machine Fortran, Thinking Machines Corporation, Cambridge, MA (1989)
Robin Milner, Communication and Concurrency, Prentice Hall, Englewood Cliffs, New Jersey, (1989)
Edgar Knapp, An Excercise in the Formal Derivation of Parallel Programs: Maximum Flows in Graphs, ACM Transactions on Programming Languages and Systems, 12: 2, April, (1990) 203–223
T.A. Witten and L.M. Sander, Diffusion Limited Aggregation, Physical Review, 27:9, (1983)5686–5697
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chakravarty, I., Kleyn, M., Woo, T.Y.C., Bagrodia, R., Austel, V. (1992). UNITY to UC: A case study in the derivation of parallel programs. In: Banâtre, J., Le Métayer, D. (eds) Reasearch Directions in High-Level Parallel Programming Languages. HLPPP 1991. Lecture Notes in Computer Science, vol 574. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55160-3_30
Download citation
DOI: https://doi.org/10.1007/3-540-55160-3_30
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55160-7
Online ISBN: 978-3-540-46762-5
eBook Packages: Springer Book Archive