PIPELINE ARCHITECTURES FOR DYNAMIC-PROGRAMMING ALGORITHMS

被引：15
作者：
CHEN, GH [1 ]
CHERN, MS [1 ]
JANG, JH [1 ]
机构：
[1] NATL TSING HUA UNIV,DEPT IND ENGN,HSINCHU 300,TAIWAN
来源：
PARALLEL COMPUTING | 1990年 / 13卷 / 01期
关键词：
knapsack problems; dynamic programming; Pipelined computation;
D O I：
10.1016/0167-8191(90)90124-R
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Dynamic programming is one of the most powerful approaches to many combinatorial optimization problems. In this paper, we present pipeline architectures for the dynamic programming algorithms for the knapsack problems. They enable us to achieve an optimal speedup using processor arrays, queues, and memory modules. The processor arrays can be regarded as pipelines where the dynamic programming algorithms are implemented through pipelining. © 1990.
引用
收藏
页码：111 / 117
页数：7
相关论文
共 50 条
12345