Systolic algorithms for the dynamic programming problem

Hassen Dhrif, Dilip Sarkar

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

Abstract

This paper presents parallel algorithms for the dynamic programming problem on systolic arrays. The dynamic programming problem when implemented sequentially takes 0(n3) time steps. In this paper, an algorithm that runs on a linear array machine in 0(n2) time, using 0(n) processors is presented. Also an algorithm that runs on a mesh connected computer in 0(n) time steps, using 0(n2) processors is being studied. Both algorithms are optimal in terms of time and cost.

Original languageEnglish (US)
Pages (from-to)151-163
Number of pages13
JournalInternational Journal of Computer Mathematics
Volume41
Issue number3-4
DOIs
StatePublished - Jan 1 1992

Keywords

  • Dynamic programming
  • parallel algorithm
  • RCT diagram
  • systolic array
  • time complexity

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Computer Science Applications
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Systolic algorithms for the dynamic programming problem'. Together they form a unique fingerprint.

Cite this