ARC based superpaging

Authors:
Yair Wiseman
Affiliations:
Bar-Ilan University, Israel
Venue:
ACM SIGOPS Operating Systems Review
Year:
2005

Citing 8
Cited 0

Reducing TLB and memory overhead using online superpage promotion

ISCA '95 Proceedings of the 22nd annual international symposium on Computer architecture
LRFU: A Spectrum of Policies that Subsumes the Least Recently Used and Least Frequently Used Policies

IEEE Transactions on Computers
Outperforming LRU with an Adaptive Replacement Cache Algorithm

Computer
Transparent operating system support for superpages

Transparent operating system support for superpages
Practical, transparent operating system support for superpages

OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
ARC: A Self-Tuning, Low Overhead Replacement Cache

FAST '03 Proceedings of the 2nd USENIX Conference on File and Storage Technologies
General purpose operating system support for multiple page sizes

ATEC '98 Proceedings of the annual conference on USENIX Annual Technical Conference
Implementation of multiple pagesize support in HP-UX

ATEC '98 Proceedings of the annual conference on USENIX Annual Technical Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper explores the use of the ARC algorithm for swapping policy in superpaging systems. The different page sizes can affect the algorithm and as a result the algorithm will not be as effective as the original one for traditional paging systems. We suggest to modify the threshold of the ARC algorithm, so it will give more weight to the frequently accessed pages and less weight to the recent pages.