Please use this identifier to cite or link to this item: http://localhost:8081/xmlui/handle/123456789/11642
Title: EFFICIENT SWAP PREFETCHING ALGORITHM FOR RANDOM ACCESS APPLICATIONS
Authors: Vigneshwaran, S.
Keywords: ELECTRONICS AND COMPUTER ENGINEERING;SWAP PREFETCHING;RANDOM ACCESS;APPLICATIONS
Issue Date: 2006
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
URI: http://hdl.handle.net/123456789/11642
Other Identifiers: M.Tech
Research Supervisor/ Guide: Kumar, Padam
metadata.dc.type: M.Tech Dessertation
Appears in Collections:MASTERS' DISSERTATIONS (E & C)

Files in This Item:
File Description SizeFormat 
ECDG12717.pdf3.41 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.