The Community for Technology Leaders
Green Image
Issue No. 12 - December (2008 vol. 57)
ISSN: 0018-9340
pp: 1585-1599
Xiaogang Qiu , NVIDIA Corporation, Santa Clara
Michel Dubois , University of Southern California, Los Angeles
To support dynamic address translation in today's microprocessors, the first-level cache is accessed in parallel with a Translation Lookaside Buffer (TLB). However, this current approach faces mounting problems. This paper introduces new ideas to enable the use of virtual addresses in the cache hierarchy. The major idea is the replacement of the on-chip TLB by a Synonym Lookaside Buffer (SLB). The SLB translates synonyms into a primary virtual address, which is a unique identifier resolving all ambiguities due to synonyms in the memory system. We introduce various system configurations with SLBs and discuss all functional issues associated with them. An SLB is much more scalable than a regular TLB. It scales with memory data set sizes, physical memory sizes and number of cores in a multiprocessor. Moreover SLB entry flushes and shootdowns due to physical memory management are eliminated. We show performance data resulting from the simulation of several applications as diverse as scientific computing, database, and JAVA virtual machines. These evaluations target SLB miss rates and flushes as well as the impact of the SLB on cache miss rates. They show that small SLBs of 8-16 entries are sufficient to solve the synonym problem in virtual caches and that their performance overhead is negligible.
Pipeline processors, Cache memories, Virtual memory, Simulation, Primary memory, Shared memory

X. Qiu and M. Dubois, "The Synonym Lookaside Buffer: A Solution to the Synonym Problem in Virtual Caches," in IEEE Transactions on Computers, vol. 57, no. , pp. 1585-1599, 2008.
93 ms
(Ver 3.3 (11022016))