论文信息 - An orthogonal systolic array for the algebraic path problem

An orthogonal systolic array for the algebraic path problem

This paper is devoted to the design of an orthogonal systolic array ofn(n+1) elementary processors which can solve any instance of the Algebraic Path Problem within only 5n−2 time steps, and is compared with the 7n−2 time steps of the hexagonal systolic array of Rote [8].ZusammenfassungEs wird ein orthogonales systolisches Feld (systolic array) mitn(n+1) einfachen Prozessoren entworfen, das das algebraische Wegproblem in nur 5n−2 Schritten lösen kann, im Vergleich zu 7n−2 Schritten beim hexagonalen systolischen Feld von Rote [8].

Yves Robert | Denis Trystram | Y. Robert | D. Trystram

[1] H. T. Kung,et al. Systolic Arrays for (VLSI). , 1978 .

[2] H. T. Kung,et al. Direct VLSI Implementation of Combinatorial Algorithms , 1979 .

[3] U. Zimmermann. Linear and combinatorial optimization in ordered algebraic structures , 1981 .

[4] Jean-Marc Delosme,et al. Highly concurrent computing structures for matrix arithmetic and signal processing , 1982, Computer.

[5] Jean-Marc Delosme. Algorithms for finite shift-rank processes , 1982 .

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

[7] H. T. Kung,et al. Fault-Tolerance and Two-Level Pipelining in VLSI Systolic Arrays , 1983 .

[8] H. T. Kung,et al. Wafer-scale integration and two-level pipelined implementations of systolic arrays , 1984, J. Parallel Distributed Comput..

[9] Y. Robert. Block LU decompositon of a band matrix on a systolic array , 1985 .

[10] G. Rote. A systolic array algorithm for the algebraic path problem (shortest paths; Matrix inversion) , 1985, Computing.