Texas A&M University LibrariesTexas A&M University LibrariesTexas A&M University Libraries
    • Help
    • Login
    OAKTrust
    View Item 
    •   OAKTrust Home
    • Programs, Centers, and Institutes
    • Undergraduate Research and Capstones
    • Undergraduate Research Scholars Capstone (2006–present)
    • View Item
    •   OAKTrust Home
    • Programs, Centers, and Institutes
    • Undergraduate Research and Capstones
    • Undergraduate Research Scholars Capstone (2006–present)
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Re-Reference Interval Prediction Swap Policy in the Linux Kernel

    Thumbnail
    View/ Open
    SINGER-DOCUMENT-2017.pdf (641.7Kb)
    Author
    Singer, Andrew R
    Metadata
    Show full item record
    Abstract
    Modern computing systems are placing ever greater pressure on their memory management systems. The current means of managing the page cache in the Linux kernel is a binary ranking standard through which cached pages are stored either in an active list or an inactive list and managed by an approximation of a least recently used (LRU) algorithm. Recent endeavors in processor caching have revealed the opportunity for increased performance resulting from refining LRU memory management algorithms. I sought to determine the feasibility of replacing the current pseudo-LRU page cache system with one based on re-reference interval prediction (RRIP). This was achieved this by exploring the current Linux kernel to understand how exactly the page cache is managed, programming and implementing the custom RRIP page level replacement policy, and performing benchmark tests to determine the change in performance of the new system. Conducting this research determined the potential of RRIP in the Linux kernel’s page cache system to be at least on par with the current architecture and paved the way for future opportunities to expand and refine RRIP in the context of the page caching.
    URI
    https://hdl.handle.net/1969.1/164559
    Subject
    re
    reference
    rereference
    interval
    prediction
    rrip
    swap
    policy
    linux
    kernel
    computer
    engineering
    computing
    memory
    management
    systems
    lru
    least
    recently
    used
    algorithm
    page
    paging
    cache
    caching
    active
    inactive
    list
    performance
    spark
    sparkbench
    cpu
    system
    time
    faults
    Collections
    • Undergraduate Research Scholars Capstone (2006–present)
    Citation
    Singer, Andrew R (2017). Re-Reference Interval Prediction Swap Policy in the Linux Kernel. Undergraduate Research Scholars Program. Available electronically from https : / /hdl .handle .net /1969 .1 /164559.

    DSpace software copyright © 2002-2016  DuraSpace
    Contact Us | Send Feedback
    Theme by 
    Atmire NV
     

     

    Advanced Search

    Browse

    All of OAKTrustCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsDepartmentTypeThis CollectionBy Issue DateAuthorsTitlesSubjectsDepartmentType

    My Account

    LoginRegister

    Statistics

    View Usage Statistics
    Help and Documentation

    DSpace software copyright © 2002-2016  DuraSpace
    Contact Us | Send Feedback
    Theme by 
    Atmire NV