An Optimal Parallel Algorithm for the Knapsack Problem Based on EREW

来源 :西南交通大学学报:英文版 | 被引量 : 0次 | 上传用户:cupcome
下载到本地 , 更方便阅读
声明 : 本文档内容版权归属内容提供方 , 如果您对本文有版权争议 , 可与客服联系进行内容授权或下架
论文部分内容阅读
A new parallel algorithm is proposed for the knapsack problem where the method of divide and conquer is adopted. Based on an EREW-SIMD machine with shared memory, the proposed algorithm utilizes O(2n/4)1-ε processors, 0≤ε≤1, and O(2n/2) memory to find a s
其他文献
The forthcoming Next Generation Network (NGN) is an all IP network. Multimedia communications over IP networks are a type of bundled session communications, whi
Using the method of separation of variables in the elliptical coordinate system, a recursive formula for the electromagnetic fields in a confocal elliptical wav
Space-time selective parallel interference cancellation(ST-SPIC) is a computationally effective approach combining multiuser detection (MUD) with antenna array
Mining frequent pattern in transaction database, time-series databases, and many other kinds of databases have been studied popularly in data mining research. M