• DocumentCode
    3438827
  • Title

    Program analysis for page size selection

  • Author

    Gopinath, K. ; Bhutkar, Aniruddha P.

  • Author_Institution
    Dept. of Comput. Sci. & Autom., Indian Inst. of Sci., Bangalore, India
  • fYear
    1996
  • fDate
    19-22 Dec 1996
  • Firstpage
    189
  • Lastpage
    194
  • Abstract
    To support high performance architectures with multiple page sizes, it is necessary to assign proper page sizes for array memory in order to improve TLB performance as well as reduce memory contention during program execution. Typically, while a smaller page size causes higher TLB contention, a larger page size causes higher memory contention and fragmentation but also has the effect of prefetching pages required in future thereby reducing the number of cold page faults. Each array in a program contributes to these costs/benefits depending upon how it is referenced in the program. The page size assignment analysis determines a proper page size for every array by analyzing memory reference patterns (which is shown to be NP-hard). We discuss various policies that can be followed for page size assignment in order to maximize performance along with cost models and present algorithms for page size selection
  • Keywords
    memory architecture; storage management; array memory; high performance architectures; memory contention; multiple page sizes; page size selection; proper page size; Automation; Computer architecture; Computer science; Costs; Hardware; Operating systems; Pattern analysis; Prefetching; Program processors; System performance;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    High Performance Computing, 1996. Proceedings. 3rd International Conference on
  • Conference_Location
    Trivandrum
  • Print_ISBN
    0-8186-7557-8
  • Type

    conf

  • DOI
    10.1109/HIPC.1996.565822
  • Filename
    565822