Issue No. 05 - May (1996 vol. 7)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.503769
<p><b>Abstract</b>—In this paper, we use a variant of the geometric method to derive efficient modular linear systolic algorithms for the transitive closure and shortest path problems. Furthermore, we show that partially-pipelined modular linear systolic algorithms with an output operation, for matrix multiplication, can be as fast as the fully-pipelined existing ones and, moreover, they need less cells.</p>
Modular linear systolic algorithms, transitive closure, shortest path, matrix multiplication.
J. F. Myoupo and A. C. Fabret, "A Modular Systolic Linearization of the Warshall-Floyd Algorithm," in IEEE Transactions on Parallel & Distributed Systems, vol. 7, no. , pp. 449-455, 1996.