© 1984 by British Computer Society
| ||||||||||||||||||||||||||||||||||||||||||||||||||
A Lumped-state Model of Clustering in Dynamic Storage Allocation
Department of Computer Science, The University, Keele, UK
A fragmentation model based upon the concept of an achievable equilibrium has proved successful with large systems but breaks down when the numbers of reserved blocks or free fragments are small. A Markov chain model is presented which, by assuming thorough spatial mixing and a strict temporal alternation of reservations and releases, reduces computational complexity to manageable proportions in systems of intermediate size. Good continuity across the two models is demonstrated.
Received October 1982.
* Department of Computer Science, The University, Keele, Staffs ST5 5BG, UK