If the search of the associative registers is successful, then the search through the
tables is stopped (or eliminated) and the address translation is performed using the
information in the associative registers. However, if the search of associative memory
fails, no time is lost because the search through the SMTs and PMTs had already
begun (in this schema). When this search is successful and the main memory address
from the PMT has been determined, the address is used to continue execution of the
program and the reference is also stored in one of the associative registers. If all of
the associative registers are full, then an LRU (or other) algorithm is used and the
least-recently-referenced associative register is used to hold the information on this
requested page.