Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Uniprocessor Virtual Memory without TLBs
Jacob B., Mudge T. IEEE Transactions on Computers50 (5):482-499,2001.Type:Article
Date Reviewed: Aug 1 2001

A feasibility study and performance evaluation of address translation in software without the customary specialized translation hardware are presented. The proposed virtual memory management design requires a virtually indexed, virtually tagged cache hierarchy and a mechanism to implement a software-managed cache miss at the lowest level. Trace-driven simulation is used to determine the virtual memory management overhead both for this system and the Ultrix and Mach systems, which use translation lookaside buffers (TLBs). For the three workloads considered, it is  determined  that the proposed system has overhead similar to the Ultrix and Mach systems if the L2 cache is large enough (at least 4 MB) and the line size is at least 64 bytes. As would be expected, the overhead in the proposed system is much more sensitive to the L2 cache performance than in the TLB systems. Eliminating the TLB hardware would save design time, chip space, and energy and would allow mechanisms to support such features as shared memory, superpages, fine-grained protection, and sparse address spaces being completely defined in software, thus allowing for more flexibility.

Reviewer:  Brian T. Bennett Review #: CR125297
Bookmark and Share
 
Virtual Memory (B.3.2 ... )
 
 
Cache Memories (B.3.2 ... )
 
Would you recommend this review?
yes
no
Other reviews under "Virtual Memory": Date
A survey of microprocessor architectures for memory management
Furht B., Milutinovic V. (ed) Computer 20(3): 48-67, 1987. Type: Article
Jun 1 1988
801 storage: architecture and programming
Chang A., Mergen M. ACM Transactions on Computer Systems 6(1): 28-50, 1988. Type: Article
Oct 1 1988

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy