Dynamic Programming and Transitive Closure on Linear Pipelines.

Abstract

Algorithms for the dynamic programming and transitive closure problems are presented for a linear pipeline of processors. These algorithms require only a constant number of input/output ports and are optimal in their area and time requirements. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
May 01, 1984
Accession Number
ADA143527

Entities

People

  • I. V. Ramakrishnan
  • P. J. Varman

Organizations

  • University of Maryland

Tags

Communities of Interest

  • C4I
  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Artificial Intelligence
  • Classification
  • Clocks
  • Computations
  • Computer Programming
  • Computer Science
  • Computers
  • Computing System Architectures
  • Dynamic Programming
  • Electrical Engineering
  • Engineering
  • Linear Arrays
  • Pipelines
  • Security
  • Shift Registers

Readers

  • Mathematical Modeling and Probability Theory.
  • Parallel and Distributed Computing.