Parallel Processing Systems

TL;DR: A language called aFP (array FP), which is a dialect of FP containing many desirable parallel constructs, is introduced, which extends FP with additional primitive functions and higher-order functions for the purpose of designing regular arrays.

TL;DR: This work proposes the 'save favorable general optimal testing algorithm' SF-GOTA that guarantees, unlike conventional look-ahead DT algorithms, the construction of DTs with monotonic non-increasing ENT.

TL;DR: The questions of existence and stability of the factorization are addressed; it is shown that Evans' Choleski Q.I.F. exists if the coefficient matrix is symmetric positive definite and is also (numerically) strongly stable if the coefficients are symmetricpositive definite.

TL;DR: An experimental parallel computer system which is expected to achieve supercomputing performance across the entire spectrum of scientific and engineering applications is described, and the type of scientific/engineering applications which may be investigated are demonstrated.