Adaptive parallel algorithms for integral knapsack problems
- Dept. of Computer Science, Univ. of Southern California, Los Angeles, CA (US)
In this paper, the design of a time-efficient and processor-efficient parallel algorithm for the integral knapsack problem is considered. A parallel integral knapsack algorithm is presented, which is adaptive to all parameters, especially to the maximum size of items. The parallel complexity of another important packing problem, the integral exactly-packing problem, is also considered. An optimal O(log n log m) time, parallel integral exactly-packing algorithm is given. Since the partition problem has a constant time, constant processor reduction to the exactly-packing problem, the authors parallel integral exactly- packing algorithm can be used for job scheduling, task partition, and many other important practical problems. Moreover, the methods and techniques used in this paper can be used for developing processor- efficient and time-efficient parallel algorithms for many other problems.
- OSTI ID:
- 6507034
- Journal Information:
- Journal of Parallel and Distributed Computing; (USA), Journal Name: Journal of Parallel and Distributed Computing; (USA) Vol. 8:4; ISSN JPDCE; ISSN 0743-7315
- Country of Publication:
- United States
- Language:
- English
Similar Records
Parallel approximate algorithms for combinatorially hard problems
A parallel algorithm for the 0-1 knapsack problem