Abstract
We present new optimal systolic algorithms for the transitive closure problem on ring and linear array of processors. The data dependency of the Warshal-Floyd algorithm is exploited to obtain highly pipelined parallel algorithms. One of the algorithms is asymptotically seven times cost-effective than the existing algorithms for computing transitive closure problems. We introduce a new expository device, called the RCT diagram, that depicts simultaneous flow of data and computation for parallel algorithms.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 508-512 |
| Number of pages | 5 |
| Journal | IEEE Transactions on Computers |
| Volume | 41 |
| Issue number | 4 |
| DOIs | |
| State | Published - Apr 1992 |
Keywords
- Data dependency
- RCT diagram
- VLSI
- WSI
- linear arrays
- parallel algorithms
- parallel machines
- systolic arrays
- transitive closure problem
ASJC Scopus subject areas
- Software
- Theoretical Computer Science
- Hardware and Architecture
- Computational Theory and Mathematics
Fingerprint Dive into the research topics of 'Design of Optimal Systolic Algorithms for the Transitive Closure Problem'. Together they form a unique fingerprint.
Cite this
Sarkar, D., & Mukherjee, A. (1992). Design of Optimal Systolic Algorithms for the Transitive Closure Problem. IEEE Transactions on Computers, 41(4), 508-512. https://doi.org/10.1109/12.135564