Generative communication in Linda
ACM Transactions on Programming Languages and Systems (TOPLAS)
The connection machine
Parallel program design: a foundation
Parallel program design: a foundation
Concurrent programming
A Language for Array and Vector Processors
ACM Transactions on Programming Languages and Systems (TOPLAS)
Experience with the SETL Optimizer
ACM Transactions on Programming Languages and Systems (TOPLAS)
I-structures: Data structures for parallel computing
Proceedings of the Workshop on Graph Reduction
The C Programmer''s Abbreviated Guide to Multicomputer Programming
The C Programmer''s Abbreviated Guide to Multicomputer Programming
A Decompositional Approach to the Design of Parallel Programs
IEEE Transactions on Software Engineering
IPF for real-time image processing on massively parallel architectures
PACT '95 Proceedings of the IFIP WG10.3 working conference on Parallel architectures and compilation techniques
Efficient Implementation of high-level parallel programs
ASPLOS IV Proceedings of the fourth international conference on Architectural support for programming languages and operating systems
| Hi-index | 0.00 |
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.