|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
Systolic Arrays with Embedded Tree Structures for Connectivity Problems
May 1985 (vol. 34 no. 5)
pp. 483-484
| ASCII Text | x | ||
| S. Ashtaputre, C.D. Savage, "Systolic Arrays with Embedded Tree Structures for Connectivity Problems," IEEE Transactions on Computers, vol. 34, no. 5, pp. 483-484, May, 1985. | |||
| BibTex | x | ||
| @article{ 10.1109/TC.1985.1676589, author = {S. Ashtaputre and C.D. Savage}, title = {Systolic Arrays with Embedded Tree Structures for Connectivity Problems}, journal ={IEEE Transactions on Computers}, volume = {34}, number = {5}, issn = {0018-9340}, year = {1985}, pages = {483-484}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.1985.1676589}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - Systolic Arrays with Embedded Tree Structures for Connectivity Problems IS - 5 SN - 0018-9340 SP483 EP484 EPD - 483-484 A1 - S. Ashtaputre, A1 - C.D. Savage, PY - 1985 KW - UNION-FINDS KW - Graph connectivity KW - pipelining KW - systolic arrays KW - trees VL - 34 JA - IEEE Transactions on Computers ER - | |||
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.
Index Terms:
UNION-FINDS, Graph connectivity, pipelining, systolic arrays, trees
Citation:
S. Ashtaputre, C.D. Savage, "Systolic Arrays with Embedded Tree Structures for Connectivity Problems," IEEE Transactions on Computers, vol. 34, no. 5, pp. 483-484, May 1985, doi:10.1109/TC.1985.1676589
Usage of this product signifies your acceptance of the Terms of Use.