RT Journal Article
JF Parallel Algorithms / Architecture Synthesis, AIZU International Symposium on
YR 1997
VO 00
IS
SP 308
TI Lazy TLB Consistency for Large-Scale Multiprocessors
A1 Kern Koh,
A1 Moon-Seok Chang,
K1
AB The memory system performance heavily depends on the eflciency of a translation lookaside bufSer(TLB), a cache for fast address translation. Recent trends towards multiprocessing as well as modular software structure 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 exploiting the potential of lazy release consistency, the scheme postpones the TLB synchronization until the time of an acquire 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.
PB IEEE Computer Society, [URL:http://www.computer.org]
SN
LA English
DO 10.1109/AISPAS.1997.581683
LK http://doi.ieeecomputersociety.org/10.1109/AISPAS.1997.581683