On Choice of a Model of Parallel Computation (Classic Reprint) - Softcover

Inhaltsangabe

This book explores the problem of choosing a computation model for parallel computing. The author proposes choosing the model that permits the most computation in a given amount of time. Two main theorems are proven: the first asserts that for every exclusive-read exclusive-write parallel RAM or synchronous distributed machine, there exists a simulation of the Fetch-and-Add parallel RAM into the same machine that uses the same order of computational resources. This implies the choice of a Fetch-and-Add parallel RAM model of computation. The second theorem asserts that for every synchronous distributed machine, there exists a simulation of the exclusive-read exclusive-write parallel RAM into the same machine that uses the same order of computational resources. These findings further support the use of Fetch-and-Add primitives in parallel computation design.

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.