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 | |
| State | Published - Jan 1 1992 |
Keywords
- Dynamic programming
- RCT diagram
- parallel algorithm
- systolic array
- time complexity
ASJC Scopus subject areas
- Computer Science Applications
- Computational Theory and Mathematics
- Applied Mathematics