DYNAMIC PROGRAMMING AND TRANSITIVE CLOSURE ON LINEAR PIPELINES.

P. J. Varman; I. V. Ramakrishnan

DYNAMIC PROGRAMMING AND TRANSITIVE CLOSURE ON LINEAR PIPELINES.

P. J. Varman
, I. V. Ramakrishnan

Computer Science

Stony Brook University

Rice University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

19 Scopus citations

Abstract

Algorithms for the dynamic programming and transitive closure problems for a linear pipeline of processors are presented. These algorithms require only a constant number of I/O ports and are optimal in their area and time requirements. They are also suitable for VLSI implementation and can be easily modified to run on a wafer comprised of faulty and nonfaulty processors.

Original language	English
Title of host publication	Proceedings of the International Conference on Parallel Processing
Editors	Robert M. Keller
Publisher	IEEE
Pages	359-364
Number of pages	6
ISBN (Print)	081860560X
State	Published - 1984

Publication series

Name	Proceedings of the International Conference on Parallel Processing

Cite this

@inproceedings{9e82de0980cd4fc0a817f6b9379f5974,

title = "DYNAMIC PROGRAMMING AND TRANSITIVE CLOSURE ON LINEAR PIPELINES.",

abstract = "Algorithms for the dynamic programming and transitive closure problems for a linear pipeline of processors are presented. These algorithms require only a constant number of I/O ports and are optimal in their area and time requirements. They are also suitable for VLSI implementation and can be easily modified to run on a wafer comprised of faulty and nonfaulty processors.",

author = "Varman, \{P. J.\} and Ramakrishnan, \{I. V.\}",

year = "1984",

language = "English",

isbn = "081860560X",

series = "Proceedings of the International Conference on Parallel Processing",

publisher = "IEEE",

pages = "359--364",

editor = "Keller, \{Robert M.\}",

booktitle = "Proceedings of the International Conference on Parallel Processing",

}

DYNAMIC PROGRAMMING AND TRANSITIVE CLOSURE ON LINEAR PIPELINES. / Varman, P. J.; Ramakrishnan, I. V.
Proceedings of the International Conference on Parallel Processing. ed. / Robert M. Keller. IEEE, 1984. p. 359-364 (Proceedings of the International Conference on Parallel Processing).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - DYNAMIC PROGRAMMING AND TRANSITIVE CLOSURE ON LINEAR PIPELINES.

AU - Varman, P. J.

AU - Ramakrishnan, I. V.

PY - 1984

Y1 - 1984

N2 - Algorithms for the dynamic programming and transitive closure problems for a linear pipeline of processors are presented. These algorithms require only a constant number of I/O ports and are optimal in their area and time requirements. They are also suitable for VLSI implementation and can be easily modified to run on a wafer comprised of faulty and nonfaulty processors.

AB - Algorithms for the dynamic programming and transitive closure problems for a linear pipeline of processors are presented. These algorithms require only a constant number of I/O ports and are optimal in their area and time requirements. They are also suitable for VLSI implementation and can be easily modified to run on a wafer comprised of faulty and nonfaulty processors.

UR - https://www.scopus.com/pages/publications/0021573426

M3 - Conference contribution

SN - 081860560X

T3 - Proceedings of the International Conference on Parallel Processing

SP - 359

EP - 364

BT - Proceedings of the International Conference on Parallel Processing

A2 - Keller, Robert M.

PB - IEEE

ER -

DYNAMIC PROGRAMMING AND TRANSITIVE CLOSURE ON LINEAR PIPELINES.

Abstract

Publication series

Other files and links

Fingerprint

Cite this