scispace - formally typeset
Journal ArticleDOI

Dynamic Bin Packing

Edward G. Coffman, +2 more
- 01 May 1983 - 
- Vol. 12, Iss: 2, pp 227-258
TLDR
This work generalizes the classical one-dimensional bin packing model to include dynamic arrivals and departures of items over time, and shows that no on-line packing algorithm can satisfy a substantially better performance bound than that for First Fit.
Abstract
Motivated by potential applications to computer storage allocation, we generalize the classical one-dimensional bin packing model to include dynamic arrivals and departures of items over time. Within this setting, we prove close upper and lower bounds on the worst-case performance of the commonly used First Fit packing algorithm, and, using adversary-type arguments, we show that no on-line packing algorithm can satisfy a substantially better performance bound than that for First Fit.

read more

Citations
More filters
Proceedings ArticleDOI

An optimal algorithm for on-line bipartite matching

TL;DR: This work applies the general approach to data structures, bin packing, graph coloring, and graph coloring to bipartite matching and shows that a simple randomized on-line algorithm achieves the best possible performance.
Book ChapterDOI

Approximation Algorithms for Bin-Packing — An Updated Survey

TL;DR: This paper updates a survey written about 3 years ago with many new results, some of which represent important advances, and more than doubles the list in [53].
Proceedings ArticleDOI

Static-priority scheduling on multiprocessors

TL;DR: In this paper, a static-priority scheduling algorithm is proposed for static priority scheduling of systems of periodic tasks on a platform comprised of several identical processors, and it is proven that this algorithm successfully schedules any periodic task system with a worst-case utilization no more than a third the capacity of the multiprocessor platform.
Journal ArticleDOI

Adaptive Resource Provisioning for the Cloud Using Online Bin Packing

TL;DR: This paper presents an approach that uses virtualization technology to allocate data center resources dynamically based on application demands and support green computing by optimizing the number of servers actively used.