Virtual-Address Caches in Multiprocessors

  • Michel Cekleov
  • Michel Dubois
  • Jin-Chin Wang
  • Fayé A. Briggs


Most general-purpose computers support virtual memory. Generally, the cache associated with each processor is accessed with a physical address obtained after translation of the virtual address in a Translation Lookaside Buffer (TLB). Since today’s uniprocessors are very fast, it becomes increasingly difficult to include the TLB in the cache access path and still avoid wait states in the processor. The alternative is to access the cache with virtual addresses and to access the TLB on misses only. This configuration reduces the average memory access time, but it is a source of consistency problems which must be solved in hardware or software. The basic causes of these problems are the demapping and remapping of virtual addresses, the presence of synonyms, and the maintenance of protection and statistical bits. Some of these problems are addressed in this paper and solutions are compared.


Physical Address Page Table Virtual Address Translation Lookaside BufJer Occupancy Ratio 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Maurice J. Bach. The design of the UNIX operating system. Prentice-Hall, 1986.Google Scholar
  2. 2.
    Ray Cheng. Virtual address cache in UNIX. Proc. 1987 summer usenix conference, pages 217–224, 1987.Google Scholar
  3. 3.
    Michel Cekleov, Michel Dubois, Jin-Chin Wang and Faye’ A. Briggs, Virtual-Address Caches, U.S.C. Technical Report No. CENG 89–701.Google Scholar
  4. 4.
    Craig R. Frink and Paul J. Roy. The cache architecture of the Apollo DN4000. Proc. 1988 Compcon, IEEE, pages 300–302, 1988.Google Scholar
  5. 5.
    Borivoje Furht and Veljko Milutinovic. A survey of microprocessor architectures for memory management. Computer, pages 48–67, Mar., 1987.Google Scholar
  6. 6.
    James R. Goodman. Coherency for multiprocessor virtual address caches. Proc. 2nd International Conference on Architecture Support For Programming Languages and Operating Systems, ACM, 1987.Google Scholar
  7. 7.
    David A. Patterson. Reduced instruction set computer. Communications of the ACM. 28, 1, pages 8–21, Jan., 1985.CrossRefGoogle Scholar
  8. 8.
    Alan J. Smith. Cache memories. ACM Computing Surveys, 14, 3, pages 473–530, Sept., 1982.CrossRefGoogle Scholar
  9. 9.
    Paul Sweazey and Alan J. Smith. A class of compatible cache consistency protocols and their support by the IEEE Futurebus. Proc. of the 13th Annual International Synmposium on Computer Architecture, pages 414–423, June, 1986.Google Scholar
  10. 10.
    William Van Loo. Maximize performance by choosing best memory. Computer Design, pages 89–94, Aug., 1987.Google Scholar

Copyright information

© Kluwer Academic Publishers 1990

Authors and Affiliations

  • Michel Cekleov
    • 1
  • Michel Dubois
    • 2
  • Jin-Chin Wang
    • 2
  • Fayé A. Briggs
    • 1
  1. 1.Advanced Development DivisionSun Microsystems Inc.Mountain View CaliforniaUSA
  2. 2.Department of Electrical Engineering SystemsUniversity of Southern CaliforniaLos AngelesUSA

Personalised recommendations