Design of Optimal Systolic Algorithms for the Transitive Closure Problem

Dilip Sarkar, Amar Mukherjee

Research output: Contribution to journalArticle

6 Scopus citations

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 languageEnglish (US)
Pages (from-to)508-512
Number of pages5
JournalIEEE Transactions on Computers
Volume41
Issue number4
DOIs
StatePublished - 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