Issue No. 07 - July (1994 vol. 5)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.296322
<p>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.</p>
Index Termsparallel algorithms; systolic arrays; computational complexity; operations research; systolic-based parallel bin packing algorithm; approximation algorithm; asymptotic error bound; time complexity; execution performance; parallelizations; serial algorithms
J. Berkey and P. Wang, "A Systolic-Based Parallel Bin Packing Algorithm," in IEEE Transactions on Parallel & Distributed Systems, vol. 5, no. , pp. 769-772, 1994.