Parallel Processing Systems

TL;DR: A fast multiprocessor prototype computer system is described that can be used for iterations of the following recursion equation: u k+1 :=N(u k, u k−1, …, U k−m+1) ; u i ϵ U ⊂ R n ; n > 10 4 .

TL;DR: The hardware implementation of a linear systolic array to achieve a low cost and optimal area efficient VLSI solution is investigated and the coefficient matrices are sparse symmetric and positive definite.

TL;DR: The theory allows us to derive and prove optimal and nearly optimal quadrature formulas and to test their quality against well-known and proposed numerical integration algorithms and to determine their efficiency domains.

TL;DR: A concurrent automaton (c.a.) A, a quite general model for concurrent, parallel computations just as sequential machines do in the sequential case, is proved.