Dynamic Distinction of Distinguished Segments
Original Publication Date: 1986-Feb-01
Included in the Prior Art Database: 2005-Mar-08
A scheme has been proposed for encoding truncated Branch History Table (BHT) target addresses in a manner that would cover more of the relevant address space than a pure truncation. This scheme involves truncating even more of the high-order address bits, and using these bit positions to designate distinguished segments, i.e., these positions constitute a hashing of the actual high-order bits. Thus, any truncated address would specify an offset within a segment, and the segment designator (remaining bit positions) would designate a specific segment which had been chosen at design time as a likely target segment.