A Parallel-Design Distributed-Implementation

by General-Purpose Computer

Excerpt from A Parallel-Design Distributed-Implementation (Pddi)

A scheme of an efficient general-purpose parallel computer is introduced. Its design space the model for which parallel programs are written), is a permissive parallel ram model of computation. The implementation space is presented as a scheme of a 'synchronous distributed machine which 'is not more involved than a sorting network followed by a merging network. An efficient translation from the design space 'nto the implementation space is given. Suppose for some t and x there is a parallel algorithm in the design space which has depth parallel time), O(r/p) using p processors for all 'p x. This translates to an algorithm in the implementation space with depth O(t/s) for all s t/l where 2 depends on the choice of the sorting and merging networks, 5 is the number of powerful processors used (processors not in the sorting or merging networks) and f(s,m) auxiliary processors, where m is the size of the common memory in the design space. For a specific choice.

37 pages, Paperback

First published August 4, 2015