Multidimensional bin packing algorithms

Authors:
L. T. Kou;G. Markowsky
Affiliations:
IBM Thomas J . Watson Research Center, Yorktown Heights, New York;IBM Thomas J . Watson Research Center, Yorktown Heights, New York
Venue:
IBM Journal of Research and Development
Year:
1977

Citing 3
Cited 8

Worst-case analysis of memory allocation algorithms

STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
The complexity of theorem-proving procedures

STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Bounds on multiprocessing anomalies and related packing algorithms

AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference

Online interval coloring with packing constraints

Theoretical Computer Science
Statistical static capacity management in virtualized data centers supporting fine grained QoS specification

Proceedings of the 1st International Conference on Energy-Efficient Computing and Networking
Resource allocation algorithms for virtualized service hosting platforms

Journal of Parallel and Distributed Computing
Server consolidation with migration control for virtualized data centers

Future Generation Computer Systems
Maximum migration time guarantees in dynamic server consolidation for virtualized data centers

Euro-Par'11 Proceedings of the 17th international conference on Parallel processing - Volume Part I
Online interval coloring with packing constraints

MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Place and route for massively parallel hardware-accelerated functional verification

Proceedings of the International Conference on Computer-Aided Design
Review: Cloud computing service composition: A systematic literature review

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

A comparative study is made of algorithms for a general multidimensional problem involving the packing of k-part objects in k compartments in a large supply of bins. The goal is to pack the objects using a minimum number of bins. The properties and limitations of the algorithms are discussed, including k-dimensional analogs of some popular one-dimensional algorithms. An application of the algorithms is the design of computer networks.