A Parallel Algorithm for the Knapsack Problem
IEEE Transactions on Computers
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
| Hi-index | 754.84 |
It is demonstrated that usual time-memory trade-offs offer no asymptotic advantage over exhaustive search. Instead, trade-offs between time, memory, and parallel processing are proposed. Using this approach it is shown that most searching problems allow a trade-off between C s, the cost per solution, and Cm, the cost of the machine: doubling Cm increases the solution rate by a factor of four, halving Cs. The machine which achieves this has an unusual architecture, with a number of processors sharing a large memory through a sorting/switching network. The implications of cryptanalysis, the knapsack problem, and multiple encryption are discussed