Low-synchronization translation lookaside buffer consistency in large-scale shared-memory multiprocessors
- 1 November 1989
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGOPS Operating Systems Review
- Vol. 23 (5) , 137-146
- https://doi.org/10.1145/74851.74864
Abstract
Operating systems for most current shared-memory multiprocessors must maintain translation lookaside buffer (TLB) consistency across processors. A processor that changes a shared page table must flush outdated mapping information from its own TLB, and it must force the other processors using the page table to do so as well. Published algorithms for maintaining TLB consistency on some popular commercial multiprocessors incur excessively high synchronization costs. We present an efficient TLB consistency algorithm that can be implemented on multiprocessors that include a small set of reasonable architectural features. This algorithm has been incorporated in a version of the MACH operating system developed for the IBM Research Parallel Processor Prototype (RP3).Keywords
This publication has 4 references indexed in Scilit:
- Translation lookaside buffer consistency: a software approachPublished by Association for Computing Machinery (ACM) ,1989
- Machine-independent virtual memory management for paged uniprocessor and multiprocessor architecturesIEEE Transactions on Computers, 1988
- The duality of memory and communication in the implementation of a multiprocessor operating systemPublished by Association for Computing Machinery (ACM) ,1987
- Basic Techniques for the Efficient Coordination of Very Large Numbers of Cooperating Sequential ProcessorsACM Transactions on Programming Languages and Systems, 1983