UC: a language for the connection machine
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.
© 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.
Published - 00130064.pdf