Issue No. 05 - May (1985 vol. 34)
S. Ashtaputre , Department of Electrical and Computer Engineering, North Carolina State University
We show how tree structures can be embedded in a one-dimensional systolic array to solve a connectivity problem, the UNION-FIND problem, by a single left-to-right pass of the data through the array. A previous solution, which did not use trees, required a left-to-right pass followed by a right-to-left pass through the array, as well as a more complex program for each cell.
UNION-FINDS, Graph connectivity, pipelining, systolic arrays, trees
C.D. Savage, S. Ashtaputre, "Systolic Arrays with Embedded Tree Structures for Connectivity Problems", IEEE Transactions on Computers, vol. 34, no. , pp. 483-484, May 1985, doi:10.1109/TC.1985.1676589