A systolic array algorithm for the algebraic path problem (shortest paths; Matrix inversion)

@article{Rote1985ASA,
  title={A systolic array algorithm for the algebraic path problem (shortest paths; Matrix inversion)},
  author={G{\"u}nter Rote},
  journal={Computing},
  year={1985},
  volume={34},
  pages={191-219}
}
It is shown how the Gauß-Jordan Elimination algorithm for the Algebraic Path Problem can be implemented on a hexagonal systolic array of a quadratic number of simple processors in linear time. Special instances of this general algorithm include parallelizations of the Warshall-Floyd Algorithm, which computes the shortest distances in a graph or the transitive closure of a relation, and of the Gauß-Jordan Elimination algorithm for computing the inverse of a real matrix. Es wird dargestellt, wie… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 49 extracted citations

Matrix Inversion on the Cell/B.E. Processor

2009 11th IEEE International Conference on High Performance Computing and Communications • 2009
View 1 Excerpt

References

Publications referenced by this paper.
Showing 1-10 of 14 references

A Systolic Array for the Algebraic Path Problem ( which Includes the Inverse of a Matrix and Shortest Distances in a Graph )

G. Rote
Rechenzentrum Graz , Bericht RZG101 • 1984

Semirings and Transitive Closure

B. Mahr
Technische Universit / it Berlin , Fachbereich • 1982

Linear and combinatorial optimization in ordered algebraic structures . ( Especially chapter 8 : Algebraic path problems

U. Zimmermann
Ann . Discrete Math . I • 1981

Theorie of Matrix Algorithms

P. Brucker
Mathematical Systems in Economics 13 • 1974

An algebra for network routing problems

B. A. Carrr
J . Inst . Math . Appl . • 1971

Similar Papers

Loading similar papers…