J. Liedtke. A basis for huge fine-grained address spaces and user level mapping. In Proceedings of the 7th European Conference on Object Oriented Programming (ECOOP) Workshop on Granularity of Objects in Distributed Systems (GODS'93), Kaiserslautern, Germany, July 1993. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Page Tables for 64-Bit Computer Systems - Elphinstone, Heiser, Liedtke (1999) (Correct)
....page tables (CPTs) are a variant of HPTs designed to reduce space needs [Talluri et al. 1995] They store mapping information for several consecutive pages with a single tag. 2. 3 Guarded page tables The guarded page table (GPT) is a forward mapped structure recently proposed by Liedtke [Liedtke, 1993, Liedtke, 1996] specifically to deal with sparse memory usage in large address spaces. Sparsity is problematic in MPTs as it leads to page tables with very few (maybe only a single) valid mapping in intermediate nodes. This can at worst lead to excessive space overhead for page tables in extreme ....
Liedtke, Jochen (1993). A basis for huge fine-grained address spaces and user level mapping. In Proceedings of the 7th European Conference on Object Oriented Programming (ECOOP) Workshop on Granularity of Objects in Distributed Systems (GODS'93), Kaiserslautern, Germany.
Page Tables for 64-Bit Computer Systems - Elphinstone, Heiser (1998) (Correct)
....table (HPT) Clustered page tables (CPTs) are a variant of HPTs designed to reduce space needs [15] They store mapping information for several consecutive pages with a single tag. 2. 3 Guarded page tables The guarded page table (GPT) is a forward mapped structure recently proposed by Liedtke [16, 17], specifically to deal with sparse memory usage in large address spaces. Sparsity is problematic in MPTs as it leads to page tables with very few (maybe only a single) valid mapping in intermediate nodes. This can at worst lead to excessive space overhead for page tables in extreme cases, and at ....
Jochen Liedtke. A basis for huge fine-grained address spaces and user level mapping. In Proceedings of the 7th European Conference on Object Oriented Programming (ECOOP) Workshop on Granularity of Objects in Distributed Systems (GODS'93), Kaiserslautern, Germany, July 1993.
The Mungi Single-Address-Space Operating System - Heiser, Elphinstone.. (1998) (15 citations) Self-citation (Liedtke) (Correct)
....Mungi. Page tables The R4600 CPU features a software loaded TLB tagged with an address space ID (ASID) We maintain in software a two way associative TLB cache for fast handling of hardware TLB misses. On a miss in this software cache, the mapping 16 is obtained from a guarded page table (GPT) [36, 37]. The GPT is an efficient data structure well suited for large, sparse address spaces. The main advantage GPTs have over alternative data structures, such as inverted page tables (IPTs) 5, 38] is that they efficiently support sharing of large areas of the address space. In our implementation we ....
J. Liedtke. A basis for huge fine-grained address spaces and user level mapping. In Proceedings of the 7th European Conference on Object Oriented Programming (ECOOP) Workshop on Granularity of Objects in Distributed Systems (GODS'93), Kaiserslautern, Germany, July 1993.
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