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

[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

{"title":"背包问题的一种新的并行算法及其在超立方体上的实现","authors":"J. Lin, J. Storer","doi":"10.1109/FMPC.1990.89428","DOIUrl":null,"url":null,"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.<<ETX>>","PeriodicalId":193332,"journal":{"name":"[1990 Proceedings] The Third Symposium on the Frontiers of Massively Parallel Computation","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1990-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"A new parallel algorithm for the knapsack problem and its implementation on a hypercube\",\"authors\":\"J. Lin, J. Storer\",\"doi\":\"10.1109/FMPC.1990.89428\",\"DOIUrl\":null,\"url\":null,\"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.<<ETX>>\",\"PeriodicalId\":193332,\"journal\":{\"name\":\"[1990 Proceedings] The Third Symposium on the Frontiers of Massively Parallel Computation\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1990-10-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1990 Proceedings] The Third Symposium on the Frontiers of Massively Parallel Computation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/FMPC.1990.89428\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1990 Proceedings] The Third Symposium on the Frontiers of Massively Parallel Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FMPC.1990.89428","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 3

摘要

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

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

查看原文本刊更多论文

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

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

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

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

自引率

0.00%

发文量