A new prefetching strategy based on access density in linux

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

Abstract

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.

Original languageEnglish
Title of host publicationProceedings - International Symposium on Computer Science and Its Applications, CSA 2008
Pages22-27
Number of pages6
DOIs
StatePublished - 2008
Event2008 International Symposium on Computer Science and its Applications, CSA 2008 - Hobart, TAS, Australia
Duration: 13 Oct 200815 Oct 2008

Publication series

NameProceedings - International Symposium on Computer Science and Its Applications, CSA 2008

Conference

Conference2008 International Symposium on Computer Science and its Applications, CSA 2008
Country/TerritoryAustralia
CityHobart, TAS
Period13/10/0815/10/08

Keywords

  • Access-density-based prefetching
  • Access-patterns
  • Read-ahead

Fingerprint

Dive into the research topics of 'A new prefetching strategy based on access density in linux'. Together they form a unique fingerprint.

Cite this