EFFICIENT SWAP PREFETCHING ALGORITHM FOR RANDOM ACCESS APPLICATIONS

Abstract

In modem computer systems, the processor performance has increased at a much faster rate than memory access times. Especially disk accesses are very time consuming and represent a severe bottleneck in today's systems. Hence, it is of growing importance to find advanced techniques to facilitate efficient interaction between fast and slow memory. Common tools to improve the performance of memory hierarchies are prefetching and caching. Prefetching means to load a page into the cache even before it is actually requested. Prefetching can have significant impact on performance of file system. In this dissertation we explore prefetching in file system and propose a new prefetching algorithm for random access applications and evaluate