By Topic

A New Prefetching Strategy Based on Access Density in Linux

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Yanxiang He ; Sch. of Comput. Sci., Wuhan Univ., Wuhan ; Shaohua Wan ; Naixue Xiong ; Jong Hyuk Park

This paper presents a new access-density-based prefetching strategy to improve prefetching for the access patterns that have not been dealt with in the current Linux read-ahead algorithm. These access patterns include: reading file data backwards, reading files in a stridden way (leaving holes in between two adjacent references), alternating references between multiple file regions and reading files randomly. When these patterns are used, the current Linux read-ahead algorithm cannot handle them because the read-ahead operation is not activated. Three metrics are proposed in the evaluation of the algorithm. The current results, obtained from a real prototype implementation in the Linux kernel, show that such prefetching can have a significant performance improvement on the aforementioned access patterns.

Published in:

Computer Science and its Applications, 2008. CSA '08. International Symposium on

Date of Conference:

13-15 Oct. 2008