Sciweavers

54 search results - page 1 / 11
» The Worst Page-Replacement Policy
Sort
View
FUN
2007
Springer
82views Algorithms» more  FUN 2007»
13 years 9 months ago
The Worst Page-Replacement Policy
In this paper, we consider the question: what is the worst possible page-replacement strategy? Our goal is to devise an online strategy that has the highest possible fraction of mi...
Kunal Agrawal, Michael A. Bender, Jeremy T. Finema...
STOC
1997
ACM
126views Algorithms» more  STOC 1997»
13 years 9 months ago
Page Replacement with Multi-Size Pages and Applications to Web Caching
We consider the paging problem where the pages have varying size. This problem has applications to page replacement policies for caches containing World Wide Web documents. We con...
Sandy Irani
OSDI
1994
ACM
13 years 6 months ago
HiPEC: High Performance External Virtual Memory Caching
Traditional operating systems use a xed LRU-like page replacement policy and centralized frame pool that cannot properly serve all types of memory access patterns of various appli...
Chao-Hsien Lee, Meng Chang Chen, Ruei-Chuan Chang
LCTRTS
2007
Springer
13 years 11 months ago
SWL: a search-while-load demand paging scheme with NAND flash memory
As mobile phones become increasingly multifunctional, the number and size of applications installed in phones are rapidly increasing. Consequently, mobile phones require more hard...
Jihyun In, Ilhoon Shin, Hyojun Kim
ADBIS
2001
Springer
107views Database» more  ADBIS 2001»
13 years 9 months ago
The Impact of Buffering on Closest Pairs Queries Using R-Trees
In this paper, the most appropriate buffer structure, page replacement policy and buffering scheme for closest pairs queries, where both spatial datasets are stored in R-trees, are...
Antonio Corral, Michael Vassilakopoulos, Yannis Ma...