T. Romer. Using Virtual Memory to Improve Cache and TLB Performance. PhD thesis, University of Washington, May 1998.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....factor of an optimal offline algorithm. Romer et al. 40] adapt this approach to TLB management, and employ a competitive strategy to decide when to perform dynamic superpage promotion. They also investigate online software policies for dynamically remapping pages to improve cache performance [6, 39]. Competitive algorithms have been used to help increase the efficiency of other operating system functions and resources, including paging, synchronization, and file cache management. Chen et al. 11] report on the performance effects of various TLB organizations and sizes. Their results ....

T. Romer. Using Virtual Memory to Improve Cache and TLB Performance. PhD thesis, University of Washington, May 1998.

....factor of an optimal offline algorithm. Romer et al. 24] adapt this approach to TLB management, and employ a competitive strategy to decide when to perform dynamic superpage promotion. They also investigate online software policies for dynamically remapping pages to improve cache performance [3, 23]. Competitive algorithms have been used to help increase the efficiency of other operating system functions and resources, including paging [26] synchronization [12] and file cache management [4] Chen et al. 6] report on the performance effects of various TLB organizations and sizes. Their ....

....policy is charged 130 cycles for each TLB miss. 3.3 Superpage Promotion Policies We evaluate two of the online superpage promotion policies developed by Romer et al. 24] asap and approx online. Note that approx online is a simplification of a more complex online policy [24] Romer [23] shows that approx online is as effective as online, but has much lower bookkeeping overhead. asap is a greedy policy that promotes a set of pages to a superpage as soon as each page has been referenced. The algorithm minimizes bookkeeping overhead by ignoring reference frequency for the ....

[Article contains additional citation context not shown here]

T. Romer. Using Virtual Memory to Improve Cache and TLB Performance. PhD thesis, University of Washington, May 1998.

....factor of an optimal o ine algorithm. Romer et al. 22] adapt this approach to TLB management, employing a competitive strategy to decide when to perform dynamic superpage promotion. They also investigate online software policies for dynamically remapping pages to improve cache performance [3, 21]. Competitive algorithms have been used to help increase the eciency of other operating system functions and resources, including paging [24] synchronization [14] and le cache management [5] Chen et al. 7] report on the performance e ects of various TLB organizations and sizes. Their results ....

....the more complex online policy [22] which not only charges a TLB miss to the potential superpages containing p, but also blames the eviction of p on the fact that unrelated pages were not coalesced into superpages. online thus tries to coalesce other superpages (those that do not contain p. Romer [21] shows that approx online is as e ective as online, but has much lower bookkeeping overhead. 2 The kernel on HP PA RISC only decides which pagetable entry to insert to TLB. It has no control over which TLB entry is going to be evicted upon a TLB insert instruction, nor does it have knowledge of ....

[Article contains additional citation context not shown here]

T. Romer. Using Virtual Memory to Improve Cache and TLB Performance. PhD thesis, University of Washington, May 1998.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC