This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
On the Asymptotic Optimality of First-Fit Storage Allocation
February 1985 (vol. 11 no. 2)
pp. 235-239
E.G. Coffman, AT&T Bell Laboratories
Suppose requests to store files arrive at a storage facility in a Poisson stream at rate 1. Each file is allocated storage space on arrival and each remains independently for an exponential time with mean l/p. The lengths of the files are assumed to be independent with common distribution F. Each file is placed in the lowest addressed contiguous sequence of locations large enough to accommodate the fre at its arrival time. This is the so-called first-fit storage discipline. We conjecture that first-fit is asymptotically optimal in the sense that the ratio of expected empty space to expected occupied space tends to zero as p ? 0, i.e., as the occupied space tends to 8. This conjecture seems very hard to prove, but it has been proved for constant file lengths [1], i.e., when F degenerates. We are unable to prove the conjecture but give a graphic display of the results of a Monte Carlo simulation which makes it very convincing.
Index Terms:
first-fit allocation, Analysis of algorithms, data structures, dynamic storage allocation
Citation:
E.G. Coffman, T.T. Kadota, L.A. Shepp, "On the Asymptotic Optimality of First-Fit Storage Allocation," IEEE Transactions on Software Engineering, vol. 11, no. 2, pp. 235-239, Feb. 1985, doi:10.1109/TSE.1985.232200
Usage of this product signifies your acceptance of the Terms of Use.