A Caltech Library Service

UC: a language for the connection machine

Bagrodia, R. and Chandy, K. M. and Kwan, E. (1990) UC: a language for the connection machine. In: Proceedings of Supercomputing '90. IEEE , Piscataway, NJ, pp. 525-534. ISBN 0-8186-2056-0.

[img] PDF - Published Version
See Usage Policy.


Use this Persistent URL to link to this item:


n designing parallel languages, the concern for defining a simple virtual machine must be balanced against the need to efficiently map a program on a specific architecture. UC addresses this problem by separating the programming task from efficiency considerations. UC programs are designed using a small set of constructs that include reduction, parallel assignment, and fixed-point computation. The language also provides a map section that may optionally be used by a programmer to specify data mappings for the program. The authors describe the UC constructs and their implementation on the Connection Machine. They also present measurements of the compiler for simple benchmarks.

Item Type:Book Section
Related URLs:
URLURL TypeDescription
Additional Information:© 1990 IEEE. We are grateful to Jay Misra and Indranil Chakravarty for their helpful comments on an earlier version of the language. The developmental work was conducted on the Connection Machines at UCLA, which is funded by the NSF Biological Facilities Award (BBS 87 14206), and at ISI. We are grateful to the Cognitive Science Program at UCLA and to Danny Cohen at ISI for their support.
Funding AgencyGrant Number
NSFBBS 87 14206
Record Number:CaltechAUTHORS:20160428-161906926
Persistent URL:
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:66532
Deposited By: Kristin Buxton
Deposited On:29 Apr 2016 19:51
Last Modified:10 Nov 2021 23:59

Repository Staff Only: item control page