in searching for a mapping, the hash anchor table is used. if no entry exists, a page fault occurs. otherwise, the entry is found. depending on the architecture, the entry may be placed in the tlb again and the memory reference is restarted, or the collision chain may be followed until it has been exhausted and a page fault occurs.