A STOCHASTIC-MODEL OF FRAGMENTATION IN DYNAMIC STORAGE-ALLOCATION

被引:27
作者
COFFMAN, EG
KADOTA, TT
SHEPP, LA
机构
[1] AT&T Bell Lab, Murray Hill, NJ,, USA, AT&T Bell Lab, Murray Hill, NJ, USA
关键词
PROBABILITY - Queueing Theory;
D O I
10.1137/0214032
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
The authors study a model of dynamic storage allocation in which requests for single units of memory arrive in a Poisson stream at rate lambda and are accommodated by the first available location found in a linear scan of memory. Immediately after this first-fit assignment, an occupied location commences an exponential delay with rate parameter mu , after which the location again becomes available. They present an analysis leading to the stationary distribution of this total occupancy, and a characterization of the fraction of wasted space under heavy-traffic conditions, i. e. for large lambda / mu .
引用
收藏
页码:416 / 425
页数:10
相关论文
共 7 条
[1]  
COFFMAN EG, 1983, SIAM REV, V25, P311, DOI 10.1137/1025074
[2]  
COFFMAN EG, UNPUB IEEE T SOFTWAR
[3]  
COFFMAN EG, 1968, IEEE T COMPUT JUN
[4]  
FELLER W, 1950, INTRO PROBABILITY TH, V1
[5]  
KADOTA TT, UNPUB ASYMPTOTIC EFF
[6]  
Knuth D.E., 1973, FUNDAMENTAL ALGORITH, VI
[7]   INTERACTION OF MARKOV PROCESSES [J].
SPITZER, F .
ADVANCES IN MATHEMATICS, 1970, 5 (02) :246-&