The CODE 2.0 graphical parallel programming language

Newton, Peter; Browne, James C.

doi:10.1145/143369.143405

Cited by 90 publications

(40 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The target language for the compilation process is a generalized data flow graph as defined in [25]. A node in this data flow graph consists of an initialization, a firing rule, a sequential computation and a routing rule for distribution of the outputs of the computation.…”

Section: Compilation Processmentioning

confidence: 99%

“…When compilation of the start component is completed, it is converted into a start node [25] for the data flow graph which will represent the parallel program and each match of a requests interface to an accepts interface results in addition of a node to the data flow graph which is being incrementally constructed by the compilation process and an arc connecting the this new node to the node which is currently being processed by the compiler. If there is a replication clause in a transaction specification then at runtime the specified number of replicas of the matched component are instantiated and linked with data flow arcs.…”

Section: Compilation Processmentioning

confidence: 99%

“…The compiler will signal an error if a requests interface cannot be matched with an accepts interface of a desired component. The data flow graph which has been generated is then compiled to a parallel program for a specific architecture by compilation processes implemented in the CODE [25] parallel programming system.…”

Section: Compilation Processmentioning

confidence: 99%

“…The composition implemented by the compiler is based on matching of associative interfaces and generates as final output either an MPI program or multi-threaded code for a shared memory multi-processor. The CODE [25] parallel programming system is used as an intermediate language and is the immediate target language of the compositional compiler.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Compositional Development of Parallel Programs

Mahmood

Deng

Browne

2004

Languages and Compilers for Parallel Computing

Self Cite

View full text Add to dashboard Cite

Abstract. This paper presents a programming model, a language (P-COM 2 ) and a compiler that composes parallel and distributed programs from independently written components. P-COM 2 is an interface definition language which incorporates information on behaviors and implementations of components to enable qualification of components for effectiveness in specific application instances and execution environments. The programming model targets development of families of related programs. One objective is to be able to compose programs which are near-optimal for given application instances and execution environments. Component-oriented development is motivated for parallel and distributed computations. The programming model is defined and described and illustrated with a simple example. The compilation process is briefly defined and described. Experience with one more complex application, a generalized fast multipole solver is sketched including performance data, some of which was surprising.

show abstract

Section: Compilation Processmentioning

confidence: 99%

Section: Compilation Processmentioning

confidence: 99%

Section: Compilation Processmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Compositional Development of Parallel Programs

Mahmood

Deng

Browne

2004

Languages and Compilers for Parallel Computing

Self Cite

View full text Add to dashboard Cite

show abstract

“…The definition of firing rules used in the extended coordination model is taken from a data flow programming model [7], where rather than waiting on a single input, a node in a data flow graph waits on multiple inputs, possibly in a particular order, before becoming enabled for execution. Firing rules are specified with a Java-like logical syntax.…”

Section: Extended Associative Broadcast Coordination Model and Programentioning

confidence: 99%

CoorSet: A Development Environment for Associatively Coordinated Components

Kane

Browne

2004

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract.A development environment for applications specified in an extended version of a previously developed coordination model based on associatively broadcast interactions is presented. The previous associative broadcast coordination model is extended to incorporate more complex specifications for interactions including multiple message interactions and fault-tolerance by replication. The runtime system is extended to facilitate construction and application of distributed implementation of coordination systems. An interface definition language based on the extended coordination model and a compiler for the language are defined and described. Three example applications, a generalized readers/writers problem including replication, a "greedy reuse" algorithm and a distributed computation Google pageranks are presented.

show abstract