WORST CASE FRAGMENTATION OF 1ST FIT AND BEST FIT STORAGE ALLOCATION STRATEGIES

被引:41
作者
ROBSON, JM [1 ]
机构
[1] UNIV LANCASTER,DEPT COMP STUDIES,LANCASTER LA1 4YN,ENGLAND
关键词
D O I
10.1093/comjnl/20.3.242
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The worst possible storage fragmentation is analyzed for two commonly used allocation strategies. In the case of the first fit system, fragmentation is not much worse than is inevitable but for the best fit system, it is almost as bad as it could be for any system.
引用
收藏
页码:242 / 244
页数:3
相关论文
共 4 条
[1]   A FAST STORAGE ALLOCATOR [J].
KNOWLTON, KC .
COMMUNICATIONS OF THE ACM, 1965, 8 (10) :623-&
[2]  
Knuth D.E., 1973, FUNDAMENTAL ALGORITH
[3]   BOUNDS FOR SOME FUNCTIONS CONCERNING DYNAMIC STORAGE ALLOCATION [J].
ROBSON, JM .
JOURNAL OF THE ACM, 1974, 21 (03) :491-499
[4]   EXTERNAL STORAGE FRAGMENTATION PRODUCED BY FIRST-FIT AND BEST-FIT ALLOCATION STRATEGIES [J].
SHORE, JE .
COMMUNICATIONS OF THE ACM, 1975, 18 (08) :433-440