Programming the Connection Machine

Author

Bagrodia, Rajive ; Chandy, K. Mani

Author_Institution

Dept. of Comput. Sci., California Univ., Los Angeles, CA, USA

fYear

1988

fDate

9-13 Oct 1988

Firstpage

50

Lastpage

57

Abstract

The Connection Machine architecture provides a massive number of simple processors that execute synchronously. A language called SC is presented which makes it easy to write parallel programs for the Connection Machine. SC is an enhancement of C; it adds a few data types and primitives to develop parallel programs. The primitives introduced by SC are derived from the UNITY, a parallel-programming theory and notation. The SC primitives support the data-parallel programming style, where a processor is assumed to be assigned to each data element. However, SC programs do not adhere to a synchronous execution model and allow MIMD (multiple-instruction, multiple-data-stream) parallelism to be expressed. A preliminary description of the SC primitives and their implementation is provided

Keywords

C language; C listings; parallel machines; parallel programming; Connection Machine architecture; MIMD; SC primitives; SC programs; UNITY; data element; data types; multiple-data-stream; multiple-instruction; parallel programs; parallel-programming theory; synchronous execution model; Algorithm design and analysis; Computer architecture; Computer science; Concurrent computing; Equations; Parallel processing; Parallel programming; Programming profession; Prototypes; Tree data structures;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Languages, 1988. Proceedings., International Conference on

Conference_Location

Miami Beach, FL

Print_ISBN

0-8186-0874-9

Type

conf

DOI

10.1109/ICCL.1988.13042

Filename

13042