Searching for "On paging with locality of reference." – sorted by Relevance.
-
Competitive Paging With Locality of Reference
- Competitive Paging with Locality of Reference Allan Borodin \Lambda Prabhakar Raghavan y
- Cited by 103 (2 self) – Add To MetaCart
-
On Paging with Locality of Reference
- On Paging with Locality of Reference ? Susanne Albers a;1 Lene M. Favrholdt b;2; Oliver Giel
- Cited by 7 (2 self) – Add To MetaCart
-
Truly Online Paging with Locality of Reference
- Truly Online Paging with Locality of Reference 1 Amos Fiat and Manor Mendel 2 Department
- Cited by 5 (0 self) – Add To MetaCart
-
Strongly Competitive Algorithms for Paging with Locality of Reference
- Strongly Competitive Algorithms for Paging with Locality of Reference Sandy Irani\Lambda Anna
- Add To MetaCart
-
Resume
- ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 73-82, 1997. . Paging with Locality
- Add To MetaCart
-
Experimental Studies of Access Graph Based Heuristics: Beating the LRU standard?
- programs exhibit locality of reference [1, 3, 21]. This means that if a page is referenced, it is more
- Cited by 26 (2 self) – Add To MetaCart
-
Competitive Algorithms for On-line Paging and Graph Coloring
- 81 [59] G.S. Shedler, C. Tung. Locality in page reference strings. SlAM Journal on Computing, Vol
- Add To MetaCart
-
Online Algorithms: A Study of Graph-Theoretic Concepts
- sequences generated by real programs typically exhibit locality of reference: Whenever a page is requested
- Cited by 1 (0 self) – Add To MetaCart
-
Semi-Online Preemptive Scheduling: One Algorithm for All Variants
- with locality of reference [1]. Our results We give a semi-online algorithm for preemptive scheduling
- Add To MetaCart
-
Semi-Online Preemptive Scheduling: One Algorithm for All Variants
- with locality of reference [1]. Our results We give a semi-online algorithm for preemptive scheduling
- Add To MetaCart

