Systolic algorithms for some scheduling and graph problems.

Oscar H. Ibarra, Tao Jiang, Jik H. Chang, Michael A. Palis

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

A simple model of a linear systolic array with serial input/output and one-way data communication is considered. It is shown that such an array can be used to solve some scheduling and graph problems efficiently. The systolic algorithms are developed in two stages. First an algorithm on a restricted type of sequential machine is constructed. Then the sequential machine algorithm is transformed into a systolic algorithm. The transformation can be done automatically and efficiently.

Original languageEnglish (US)
Title of host publicationProc Int Conf on Systolic Arrays
PublisherPubl by IEEE
Pages247-256
Number of pages10
ISBN (Print)0818688602, 9780818688607
DOIs
StatePublished - 1988
Externally publishedYes

Publication series

NameProc Int Conf on Systolic Arrays

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint

Dive into the research topics of 'Systolic algorithms for some scheduling and graph problems.'. Together they form a unique fingerprint.

Cite this