An optimal algorithm for parallel selection
Information Processing Letters
Optimal parallel merging and sorting without memory conflicts
IEEE Transactions on Computers
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Computing Partitions with Applications to the Knapsack Problem
Journal of the ACM (JACM)
Parallel Sorting Algorithms
Tight bounds on the complexity of parallel sorting
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
The universality of various types of SIMD machine interconnection networks
ISCA '77 Proceedings of the 4th annual symposium on Computer architecture
A parallel two-list algorithm for the knapsack problem
Parallel Computing
Optimal parallel algorithm for the knapsack problem without memory conflicts
Journal of Computer Science and Technology
A parallel O(n27n/8) time-memory-processor tradeoff for Knapsack-like problems
NPC'05 Proceedings of the 2005 IFIP international conference on Network and Parallel Computing
A note on developing optimal and scalable parallel two-list algorithms
ICA3PP'12 Proceedings of the 12th international conference on Algorithms and Architectures for Parallel Processing - Volume Part II
Proceedings of Programming Models and Applications on Multicores and Manycores
| Hi-index | 14.98 |
A parallel algorithm for solving the knapsack problem on a single-instruction, multiple-data machine with shared memory is presented. The shared memory allows concurrent reading while concurrent writing is forbidden. The knapsack problem is of size n, which the algorithm solves in time T=O(n*(2/sup n/2/)/sup epsilon /) when P=O((2/sup n/2/)/sup (1- epsilon )/), 0or= epsilon or=1, processors are available. It is shown that the algorithm needs S=O(2/sup n/2/) memory space in a shared memory. If H (for hardware) is the number of processors plus the number of memory cells used by a parallel algorithm, the parallel algorithm takes a linear time proportional to (n/2) to find a solution when P=O(2/sup n/2/), leading a tradeoff T*H=O(2/sup n/2/).