The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.07 - July (1994 vol.5)
pp: 769-772
ABSTRACT
<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 TERMS
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
CITATION
J.O. Berkey, P.Y. Wang, "A Systolic-Based Parallel Bin Packing Algorithm", IEEE Transactions on Parallel & Distributed Systems, vol.5, no. 7, pp. 769-772, July 1994, doi:10.1109/71.296322
17 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool