Solving dynamic programming problems efficiently on modular linear pipelines

Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings] Pub Date : 1992-04-01 DOI:10.1109/PCCC.1992.200542

J. Myoupo

引用次数: 1

Abstract

The authors present a fully pipelined modular linear systolic algorithm for dynamic programming. They use geometric considerations to design the array. Its characteristics make it fully-pipelined. It runs in 1.5n/sup 2/+O(n) time steps on an array of n/sup 2//6+O(n) processors.<>

查看原文本刊更多论文

有效地求解模块化线性管道的动态规划问题

提出了一种求解动态规划的全流水线模块化线性收缩算法。他们使用几何因素来设计阵列。它的特点使其完全流水线化。它在一个由n/sup 2//6+O(n)个处理器组成的阵列上以1.5n/sup 2/+O(n)个时间步长运行。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]

自引率

0.00%

发文量