Abstract
Current programming languages and models fix the structure of concurrent programs. This hinders the portability of programs across architectures. In this paper, we propose flexible program structures through which the synchrony relation of a program can be changed in accordance with the underlying architecture without compromising correctness.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Work supported in part by NSF Grant CCR-9008628 and a grant from Lawrence Livermore National Laboratory.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Chandy, K. M., and J. Misra, Parallel Program Design: A Foundation, Reading, Massachusetts: Addison-Wesley, 1988.
Cunningham, H. C., and Roman, G., A Unity-Style Programming Logic for Shared Dataspace Programs, IEEE Transactions on Parallel and Distributed System, 1(3), 1990.
Dijkstra, E. W., A Discipline of Programming, Englewood Cliffs, New Jersey: Prentice-Hall, 1976.
Gries, D., The Science of Programming, New York: Springer-Verlag, 1982.
Liu, Y., and Singh, A. K., Parallel Programming: Achieving Portability Through Abstraction, 11th International Conference on Distributed Computing Systems, 1991.
Meseguer, José, Conditional Rewriting Logic as a Unified Model of Concurrency, SRI International Technique Report, Feb. 1991.
Pratt, V., Modeling Concurrency with Partial Orders, International Journal of Parallel Programming, 15(1), Feb. 1986, pp. 33–71.
Singh, A. K., and Overbeek, Ross, Derivation of Efficient Parallel Programs: An Example From Genetic Sequence Analysis, International Journal of Parallel Programming, 18(6), December 1989.
Winskel, G., An Introduction to Event Structures, Workshop on Linear Time, Branching Time, and Partial Orders in Logics and Models for Concurrency, Lecture Notes in Computer Science 354, 1989, PP 364–397.
Wirth, N., Program Development by Stepwise Refinement, Communications of the ACM, 14(4), April 1971, pp. 221–227.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Singh, A.K., Liu, Y. (1992). Flexible program structures for concurrent programming. 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_34
Download citation
DOI: https://doi.org/10.1007/3-540-55160-3_34
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