Then the table entry is updated by adjusting the prediction to reduce the error.

In other words, the least significant 4 bits of a table entry's address are always 0 ().

We could use these 4 bits to mark the table entry with extra information.

The table entry is then adjusted to reflect the actual bit value.

For legibility, the tie bars have been removed from the table entries.

Eventually it eats all the process table entries and effectively wedges the system.

These bits are used to deal with the case when distinct keys happen to hash to the same table entry.

This also determines the choice of routing table entries.

Its primary function is to "execute" the table entries as a set of "instructions".

Surprise can at this point be used to boost the table entry, increasing the amount of damage inflicted.