DocumentCode
3014722
Title
UC: a language for the connection machine
Author
Bagrodia, R. ; Chandy, K.M. ; Kwan, E.
Author_Institution
Dept. of Comput. Sci., California Univ., Los Angeles, CA, USA
fYear
1990
fDate
12-16 Nov 1990
Firstpage
525
Lastpage
534
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. The authors describe the UC constructs and their implementation on the Connection Machine. They also present measurements of the compiler for simple benchmarks
Keywords
parallel languages; program compilers; UC constructs; compiler; connection machine; efficiency considerations; fixed-point computation; parallel assignment; parallel languages; programming task; reduction; virtual machine; Benchmark testing; Computer architecture; Computer science; Cost function; Logic testing; Parallel languages; Program processors; Programming profession; Software measurement; Virtual machining;
fLanguage
English
Publisher
ieee
Conference_Titel
Supercomputing '90., Proceedings of
Conference_Location
New York, NY
Print_ISBN
0-8186-2056-0
Type
conf
DOI
10.1109/SUPERC.1990.130064
Filename
130064
Link To Document