A Caltech Library Service

The Composition of Concurrent Programs

Chandy, K. Mani and Taylor, Stephen (1989) The Composition of Concurrent Programs. In: Supercomputing '89 Proceedings of the 1989 ACM/IEEE conference on Supercomputing. ACM , New York, NY, pp. 557-561. ISBN 0-89791-341-8.

Full text is not posted in this repository. Consult Related URLs below.

Use this Persistent URL to link to this item:


This paper describes a notation for concurrent programs called PCN for Program Composition Notation. The notation is being implemented at Caltech on multicomputers (a network of computers that communicate by sending and receiving messages). A fragment of this notation has been implemented on a data-parallel computer - the Connection Machine - by Rajive Bagrodia at UCLA. PCN is an outgrowth of research on UNITY (1) and Strand (2). The central ideas underlying PCN axe discussed next.

Item Type:Book Section
Related URLs:
URLURL TypeDescription
Additional Information:© 1989 ACM. This work was supported in part by JTFPMO grant coordinated by JPL and by DARPA, order numer 6202, monitored by ONR, N0001487-K-0745.
Funding AgencyGrant Number
Joint Tactical Fusion Program Management Office (JTFPMO)UNSPECIFIED
Defense Advanced Research Projects Agency (DARPA)6202
Office of Naval Research (ONR)N0001487-K-0745
Record Number:CaltechAUTHORS:20160819-105930876
Persistent URL:
Official Citation:K. M. Chandy and S. Taylor. 1989. The composition of concurrent programs. In Proceedings of the 1989 ACM/IEEE conference on Supercomputing (Supercomputing '89). ACM, New York, NY, USA, 557-561. DOI=
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:69785
Deposited On:22 Aug 2016 23:37
Last Modified:11 Nov 2021 04:19

Repository Staff Only: item control page