This paper explores the use of Proteus, an architecture-independent language suitable for prototyping parallel and distributed programs. Proteus is a high-level imperative notation based on sets and sequences with a single construct for the parallel composition of processes communicating through shared memory. Several different parallel algorithms for N-body simulation are presented in Proteus, illustrating how Proteus provides a common foundation for expressing the various parallel programming models. This common foundation allows prototype parallel programs to be tested and evolved without the use of machine-specific languages. To transform prototypes to implementations on specific architectures, program refinement techniques are utilized. Refinement strategies are illustrated that target broad-spectrum parallel intermediate languages, and their viability is demonstrated by refining an N-body algorithm to data-parallel CVL code.

This paper explores the use of Proteus, an architecture-independent language suitable for prototyping time-sensitive parallel and distributed programs. Proteus is a high-level imperative notation based on sets and sequences with succinct yet powerful constructs for the parallel composition of processes communicating through shared memory. Several different parallel algorithms for N-body simulation in molecular dynamics are presented in Proteus, illustrating how Proteus provides a common foundation for expressing the various parallel programming models. This common foundation supports the construction of high-performance computing applications across a wide range of parallel machines through a development methodology in which prototype parallel programs can be tested and evolved without the use of machine-specific languages. To transform prototypes to implementations on specific architectures, program refinement techniques are utilized. Refinement strategies are illustrated that target...

This paper explores the use of Proteus, an architecture-independent language suitable for prototyping parallel and distributed programs. Proteus is a highlevel imperative notation based on sets and sequences with a single construct for the parallel composition of processes communicating through shared memory. Several different parallel algorithms for N-body simulation are presented in Proteus, illustrating how Proteus provides a common foundation for expressing the various parallel programming models. This common foundation allows prototype parallel programs to be tested and evolved without the use of machine-specific languages. To transform prototypes to implementations on specific architectures, program refinement techniques are utilized. Refinement strategies are illustrated that target broad-spectrum parallel intermediate languages, and their viability is demonstrated by refining an N-body algorithm to data-parallel CVL code. 1. Introduction Over the past twenty years many diverse...

ion : : : : : : : : : : : : : : : : 45 4.3.4 Performance overview : : : : : : : : : : : : : : : : : : : : : : : : : 48 4.4 Design of the Compiler : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 50 4.4.1 Syntax of C++Linda : : : : : : : : : : : : : : : : : : : : : : : : : : 51 4.4.2 The Tuple Format : : : : : : : : : : : : : : : : : : : : : : : : : : : 53 4.4.3 The Match Algorithm : : : : : : : : : : : : : : : : : : : : : : : : : 58 4.4.4 The Linda Pre-evaluator : : : : : : : : : : : : : : : : : : : : : : : : 59 4.4.5 The Code Generator : : : : : : : : : : : : : : : : : : : : : : : : : : 61 4.5 Design of Optimizations : : : : : : : : : : : : : : : : : : : : : : : : : : : : 63 4.5.1 Optimizing tuple distribution : : : : : : : : : : : : : : : : : : : : : 63 4.5.2 Possible ways of distributing tuples : : : : : : : : : : : : : : : : : : 64 4.5.3 New algorithms for distributing tuples : : : : : : : : : : : : : : : : 64 4.5.4 Expected Results : : : : : : : : : : : : : : : : : : : : ...