Data-flow algorithms for parallel matrix computation

In this article we develop some algorithms and tools for solving matrix problems on parallel processing computers. Operations are synchronized through data-flow alone, which makes global synchronization unnecessary and enables the algorithms to be implemented on machines with very simple operating systems and communication protocols. As examples, we present algorithms that form the main modules for solving Liapounov matrix equations. We compare this approach to wave front array processors and systolic arrays, and note its advantages in handling missized problems, in evaluating variations of algorithms or architectures, in moving algorithms from system to system, and in debugging parallel algorithms on sequential machines.

[1]  Sun-Yuan Kung,et al.  A Matrix Data Flow Language/Architecture for Parallel Matrix Operations Based on Computational Wavefront Concept , 1981 .

[2]  Franklin T. Luk,et al.  A Systolic Architecture for Almost Linear-Time Solution of the Symmetric Eigenvalue Problem , 1982 .

[3]  Franklin T. Luk,et al.  A Systolic Array for the Linear-Time Solution of Toeplitz Systems of Equations , 1982 .

[4]  Robert Henry Kuhn,et al.  Optimization and interconnection complexity for: parallel processors, single-stage networks, and decision trees , 1980 .

[5]  Franklin T. Luk,et al.  Computing the Cholesky Factorization Using a Systolic Architecture , 1982 .

[6]  R. Brent,et al.  Computation of the Singular Value Decomposition Using Mesh-Connected Processors , 1983 .

[7]  Franklin T. Luk,et al.  Computing the Singular-Value Decomposition on the ILLIAC IV , 1980, TOMS.

[8]  Jack B. Dennis,et al.  Data Flow Supercomputers , 1980, Computer.

[9]  G. Stewart.  A Jacobi-Like Algorithm for Computing the Schur Decomposition of a Nonhermitian Matrix , 1985 .

[10]  Yoichi Muraoka,et al.  On the Number of Operations Simultaneously Executable in Fortran-Like Programs and Their Resulting Speedup , 1972, IEEE Transactions on Computers.

[11]  Richard H. Bartels,et al.  Algorithm 432 [C2]: Solution of the matrix equation AX + XB = C [F4] , 1972, Commun. ACM.

[12]  H. T. Kung,et al.  Numerically Stable Solution of Dense Systems of Linear Equations Using Mesh-Connected Processors , 1984 .

[13]  D. Heller.  A Survey of Parallel Algorithms in Numerical Linear Algebra. , 1978 .

[14]  G. Stewart.  Introduction to matrix computations , 1973 .

[15]  R. Karp,et al.  Properties of a model for parallel computations: determinacy , 1966 .

[16]  H. T. Kung.  Why systolic architectures? , 1982, Computer.

[17]  Richard P. Hopkins,et al.  Data-Driven and Demand-Driven Computer Architecture , 1982, CSUR.