Implementation machine paradigm for parallel programming

An approach for efficiently mapping parallel applications onto parallel MIMD machine architectures is introduced. The applicability of this approach to uniform memory-access multiprocessors is demonstrated. It is shown that an intermediate layer of abstraction between the application level and the parallel architecture level is conducive not only to a better software productivity but also to performance efficient programs. The intermediate layer consists of a set of commonly used parallel programming paradigms (implementation machines). A mathematical representation and a pragmatic representation are provided for each implementation machine (IM). The user maps the application onto one or a set of IMs and the system implements the IMs efficiently on the underlying parallel machine.<
>