Homomorphisms between models of parallel computation

The Relationships between Several Parallel Computation Models

The Parallel Random Access Machine (PRAM for short) is the most convenient and widely used model of parallel computation. Other, more complex models have also been studied. Examples include the Broadcast with Selective Reduction (or BSR) and the Reconfigurable Multiple Bus Machine (or RMBM). While the PRAM and the BSR are shared memory models, the RMBM accomplishes the communication between pro...

Models for Parallel Computation

Parallel computing must meet seemingly contradictory goals: software development should be carried out in an architecture-and technology-independent environment, while both algorithms and system software should take full advantage of the features of the underlying parallel architecture. At the same time, application programmers cannot be expected to be parallel processing experts. Usability, sc...

Models of Parallel Computation and Parallel Complexity

This thesis reviews selected topics from the theory of parallel computation. The research begins with a survey of the proposed models of parallel computation. It examines the characteristics of each model and it discusses its use either for theoretical studies, or for practical applications. Subsequently, it employs common simulation techniques to evaluate the computational power of these model...

Parallel Computation in Definitive Models

A Survey of Models of Parallel Computation

Serial computing's popularity can be attributed to the von Neumann model providing a single, general model of serial computation. This has led to portability, predictability and programmability in serial computation. However, there is no such single model in parallel computation. Rather, numerous models abound with some being more popular than others, but there is as yet no clear leader. This s...