Program Analysis for Page Size Selection

Gopinath, K and Bhutkar, Aniruddha P (1996) Program Analysis for Page Size Selection. In: 3rd International Conference on High Performance Computing, 1996, 19-22 December, Trivandrum,India, 189 -194.

Preview

PDF program.pdf Download (601kB)

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.

Item Type:	Conference Paper
Publisher:	IEEE
Additional Information:	Copyright 1990 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Department/Centre:	Division of Electrical Sciences > Computer Science & Automation
Date Deposited:	22 Aug 2008
Last Modified:	19 Sep 2010 04:26
URI:	http://eprints.iisc.ac.in/id/eprint/6607

Actions (login required)

View Item