A Systolic-Based Parallel Bin Packing Algorithm

Authors:
J. O. Berkey;P. Y. Wang
Affiliations:
-;-
Venue:
IEEE Transactions on Parallel and Distributed Systems
Year:
1994

Citing 4
Cited 0

A simple on-line bin-packing algorithm

Journal of the ACM (JACM)
Communicating sequential processes

Communicating sequential processes
The design and analysis of parallel algorithms for the one-dimensional bin packing problem

The design and analysis of parallel algorithms for the one-dimensional bin packing problem
Parallel Approximation Algorithms for Bin Packing

Parallel Approximation Algorithms for Bin Packing

Quantified Score

Hi-index	0.00

Visualization

Abstract

A systolic based parallel approximation algorithm that obtains solutions to the I-D bin packing problem is presented. The algorithm has an asymptotic error bound of 1.5 and time complexity O(n). An experimental study demonstrates that the heuristic offers improved packing and execution performance over parallelizations of two well-known serial algorithms.