A new parallel algorithm for the knapsack problem and its implementation on a hypercube

[1990 Proceedings] The Third Symposium on the Frontiers of Massively Parallel Computation Pub Date : 1990-10-08 DOI:10.1109/FMPC.1990.89428

J. Lin, J. Storer

引用次数: 3

Abstract

A new parallel algorithm is presented for the 0/1 knapsack problem. On a hypercube of n processors, the algorithm runs in time O(mc(log n)/n), where m is the number of objects and c is the knapsack size. The best previous known hypercube algorithm takes time O(mc/n+c log n+c/sup 2/). The new algorithm has been implemented on the Connection Machine and experimental results show that it performs very well for a wide range of problem sizes.<>

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

背包问题的一种新的并行算法及其在超立方体上的实现

针对0/1背包问题，提出了一种新的并行算法。在n个处理器的超立方体上，算法运行时间为O(mc(log n)/n)，其中m是对象的数量，c是背包的大小。目前已知的最佳超立方算法耗时为O(mc/n+c log n+c/sup 2/)。该算法已在连接机上实现，实验结果表明，该算法对各种规模的问题都有很好的处理效果。

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

求助全文

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

来源期刊

[1990 Proceedings] The Third Symposium on the Frontiers of Massively Parallel Computation

自引率

0.00%

发文量

期刊最新文献

Topological properties of banyan-hypercube networks Designing the 3-LAP (three layers associative processor) for arithmetic and symbolic applications Partitioning on the banyan-hypercube networks Multiple channel architecture Performance prediction-How good is good?