Parallel Processing Systems

TL;DR: The programming strategy for migrating codes from a conventional sequential system to a parallel one and the performance of a variety of applications programs is analyzed to demonstrate the merits of this approach.

TL;DR: The problem of stability of parallel algorithms, which has as yet received very little attention in the literature, is discussed using arithmetic expressions as an example and results are given for some of these expressions to classify their numerical quality.

TL;DR: The folding transformations, described in [10], are used to obtain more efficient processor array implementations for both the MA and AR filters and are referred to for a description of the data dependence method and linear transformations.

TL;DR: A new algorithm for solving sparse linear systems which is readily parallelized and is very efficient for matrices arising in such domains as reservoir modeling and fully implicit, multiphase models which yield asymmetrical systems is suggested.