Cheol Ho Park
ABSTRACT
While superpage is an efficient solution to increase TLB reach, its limited flexibility for address mapping is still a hard issue. Our proposed mechanism has been developed for taking advantage of two previous approaches which resolve the issue partially: the partial-subblock TLB and the shadow memory. Through integration of them, our mechanism enjoys various benefits inherited from the both sides. By adopting Memory Controller TLB (MTLB) from the shadow memory, it allows superpages to be composed of arbitrary physical pages. The entry structure of the partial-subblock TLB applied for the processor TLB enables all invalid address mappings to be identified inside CPU, which reduces the overhead of handling invalid mappings. In addition, cache flushing which is required when a mapping of shadow address to physical address is destroyed (e.g. due to paging) can be replaced just by resetting the corresponding valid bit in the processor TLB. At last, the per-base-page reference bits in the processor TLB make the page replacement policy of the operating system more efficient.
In simulation with six benchmarks, our mechanism generates only 27% of TLB misses compared to the single-page-size TLB. With a detailed analysis, it is shown to be evident that the efficiency of our mechanism is magnified in real computing environment where multitasking and applications of large sizes are ordinary cases.
- 1.J. B. Chen, A. Borg, and N. P. Jouppi. A simulation based study of TLB performance. In Proc. off the I9th Annual International Symposium on Computer Architecture, pages 114-123, May 1992. Google Scholar
Digital Library
- 2.P. J. Denning. Virtual memory. Computing Surveys, 2(3):153-189, Sept. 1970. Google ScholarDigital Library
- 3.J. L. Hennessy and D. A. Patterson. Computer Architecture A Quantitative Approach. Morgan Kaufmann Publishers, 1990. Google ScholarDigital Library
- 4.Intel, Inc. Intel Architecture Software Developer's Manual, 1997.Google Scholar
- 5.G. Kane and J. Heinrich. MPS RISC Architecture. Prentice Hall, 1992. Google ScholarDigital Library
- 6.M. Milenkovic. Microprocessor memory management units. IEEE Micro, 10(2):70-85, Apr. 1990. Google ScholarDigital Library
- 7.M. Rosenblum, S. A. Herrod, E. Witchel, and A. Gupta. Complete computer simulation: The simos approach. {EEE Parallel and Distributed Technology, 3(4):34-43, 1995. Google ScholarDigital Library
- 8.T. Shanley. PowerPC System Architecture. Addison Wesley, 1995. Google ScholarDigital Library
- 9.P~. L. Sites. Alpha AXP architecture. Communications of the ACM, 36(2):33--44, Mar. 1992. Google ScholarDigital Library
- 10.A. J. Smith. Cache memories. Computing Surveys, 14(3):473-530, Sept. 1982. Google ScholarDigital Library
- 11.SPARC International Inc. The SPARC Architecture Manual, Version 8, 1991. Google ScholarDigital Library
- 12.M. Swanson, L. Stoller, and J. Carter. Increasing TLB reach using superpages backed by shadow memory. In Proc. of the 25th Annual International Symposium on Computer Architecture, pages 204-213, 1998. Google ScholarDigital Library
- 13.M. Talluri and M. D. Hill. Surpassing the TLB performance of superpages with less operating system support. In Proc. of the 6th Symposium on Architectural Support for Programming Languages and Operating Systems, pages 171-182, Oct. 1994. Google ScholarDigital Library
- 14.M. Talluri, S. Kong, M. D. Hill, and D. A. pattern. Tradeoffs in supporting two page sizes. In Proc. of the 19th Annual International Symposium on Computer Architecture, pages 415.--424, May 1992. Google ScholarDigital Library
- 15.W. Walker and H. G. Cragon. Interrupt processing in concurrent processors. Computer, 28(6):36-46, June 1995. Google ScholarDigital Library
- 16.S. C. Woo, M. Ohara, E. Torrie, J. P. Singh, and A. Gupta. The SPLASH-2 l)rograms: Characterization and methodological considerations. In Proe. of the 22nd Annual International Symposium on Computer ArchitcctuTa:, pltgcs 2,1 36, 1995. Google ScholarDigital Library
Index Terms
- Boosting superpage utilization with the shadow memory and the partial-subblock TLB
Recommendations
Increasing TLB reach using superpages backed by shadow memory
Special Issue: Proceedings of the 25th annual international symposium on Computer architecture (ISCA '98)The amount of memory that can be accessed without causing a TLB fault, the reach of a TLB, is failing to keep pace with the increasingly large working sets of applications. We propose to extend TLB reach via a novel Memory Controller TLB (MTLB) that ...
Reducing TLB and memory overhead using online superpage promotion
Special Issue: Proceedings of the 22nd annual international symposium on Computer architecture (ISCA '95)Modern microprocessors contain small TLBs that maintain a cache of recently used translations. A TLB's coverage is the sum of the number of bytes mapped by each entry. Applications with working sets larger than the TLB coverage will perform poorly due ...
Reducing TLB and memory overhead using online superpage promotion
ISCA '95: Proceedings of the 22nd annual international symposium on Computer architectureModern microprocessors contain small TLBs that maintain a cache of recently used translations. A TLB's coverage is the sum of the number of bytes mapped by each entry. Applications with working sets larger than the TLB coverage will perform poorly due ...
Comments