Semi-Contiguous Memory Allocation for Efficient Sequential-Access.
Elias G. Khalaf, Ralph P. Tucci · CDES · 2006
Many algorithms have been devised and studied for dynamic contiguous memory allocation. In the absence of enough contiguous memory to satisfy a particular request, one approach is to allocate memory in blocks that are as close as possible to each other, by minimizing interfering blocks – blocks that belong to previously allocated requests. We devise an algorithm for such an allocation strategy and discuss its efficiency. This allocation strategy would improve access time for sequential files like audio and video files.