UC: a language for the connection machine

Abstract

In 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. This paper describes the UC constructs and their current implementation on the Connection Machine. It also presents measurements of the compiler for simple benchmarks.