Abstract
A memory system's performance heavily depends on the efficiency of a translation lookaside buffer (TLB), a cache for fast address translation. Recent trends towards multiprocessing as well as modular software structures impose more stress on TLBs, since consistency among multiple TLBs should be maintained. However, previous TLB consistency schemes do not seem suitable for large-scale multiprocessors, because they require interprocessor interrupts, which are extremely harmful to the overall system performance. In this paper, we propose a lazy TLB scheme for large-scale multiprocessors. By exploring the potential of lazy release consistency, the scheme postpones the TLB synchronization until the time of an acquistion access to the shared data. This scheme allows a processor to invalidate remote TLBs asynchronously, and eliminates the need for interprocessor interrupts. Simulation results show that the lazy TLB scheme is very efficient for large-scale multiprocessors.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
