Systolic algorithms for the dynamic programming problem

Hassen Dhrif; Dilip Sarkar

doi:10.1080/00207169208804035

Systolic algorithms for the dynamic programming problem

Hassen Dhrif, Dilip Sarkar

Computer Science

Research output: Contribution to journal › Article › peer-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 language	English (US)
Pages (from-to)	151-163
Number of pages	13
Journal	International Journal of Computer Mathematics
Volume	41
Issue number	3-4
DOIs	https://doi.org/10.1080/00207169208804035
State	Published - 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

Access to Document

10.1080/00207169208804035

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

Cite this

@article{457b9fbdc600454e8a84d3282c697644,

title = "Systolic algorithms for the dynamic programming problem",

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.",

keywords = "Dynamic programming, parallel algorithm, RCT diagram, systolic array, time complexity",

author = "Hassen Dhrif and Dilip Sarkar",

year = "1992",

month = jan,

day = "1",

doi = "10.1080/00207169208804035",

language = "English (US)",

volume = "41",

pages = "151--163",

journal = "International Journal of Computer Mathematics",

issn = "0020-7160",

publisher = "Taylor and Francis Ltd.",

number = "3-4",

}

TY - JOUR

T1 - Systolic algorithms for the dynamic programming problem

AU - Dhrif, Hassen

AU - Sarkar, Dilip

PY - 1992/1/1

Y1 - 1992/1/1

N2 - 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.

AB - 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.

KW - Dynamic programming

KW - parallel algorithm

KW - RCT diagram

KW - systolic array

KW - time complexity

UR - http://www.scopus.com/inward/record.url?scp=84948233455&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84948233455&partnerID=8YFLogxK

U2 - 10.1080/00207169208804035

DO - 10.1080/00207169208804035

M3 - Article

AN - SCOPUS:84948233455

VL - 41

SP - 151

EP - 163

JO - International Journal of Computer Mathematics

JF - International Journal of Computer Mathematics

SN - 0020-7160

IS - 3-4

ER -