Mesh-connected processor arrays for the transitive closure problemThe main purpose in this paper is to lay a theoretical foundation for the design of mesh-connected processor arrays for the transitive closure problem. Using a simple path-algebraic formulation of the problem and observing its similarity to certain well-known smoothing problems that occur in digital signal processing, it is shown how to draw upon existing techniques from the signal processing literature to derive regular iterative algorithms for determining the transitive closure of the graph. The regular iterative algorithms that are derived using these considerations, are then analyzed and synthesized on mesh-connected processor arrays. Among the vast number of mesh-connected processor arrays that can be designed using this unified approach, the systolic arrays reported in the literature for this problem are shown to be special cases.
Document ID
19860058246
Acquisition Source
Legacy CDMS
Document Type
Conference Paper
Authors
Rao, S. K. (Stanford Univ. CA, United States)
Citron, T. (Stanford Univ. CA, United States)
Kailath, T. (Stanford University CA, United States)