论文信息 - A Two-Dimensional Bin-Packing Model of Preemptive, FIFO Storage Allocation

A Two-Dimensional Bin-Packing Model of Preemptive, FIFO Storage Allocation

Abstract An approximation algorithm for an NP-complete problem in dynamic storage allocation is studied. A preemptive regime is assumed. It is shown that in the worst-case the waiting times for FIFO allocation of requests are linear functions of the minimum achievable times.

Edward G. Coffman | Brenda S. Baker

[1] Robert E. Tarjan,et al. Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms , 1980, SIAM J. Comput..

[2] Ronald L. Rivest,et al. Orthogonal Packings in Two Dimensions , 1980, SIAM J. Comput..

[3] Jeffrey D. Ullman,et al. Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms , 1974, SIAM J. Comput..