for a match only if ata bits of sets a and b are 0 zero the target address in case of a ba match 591 is given by ta t u2212 k significant bits of ba concatenated with u2018 k u2019 bits of sta if a match is not determined then there was not a target address located on the given search 592 furthermore as shown in fig7 by adding a static identification sid 720 740 to a dynamic entry 700 then a given dynamic entry no longer must map to a single static entry such would be the case if the static associativity was modified from 2 to 3 in the above example thereby allowing the dynamic entry the fourth way of associativity to support a maximum of two of the static entries hence supporting zero static entries a b c ab bc or ac with long target address extensions 710 730 as the associativity of this structure is a function of values which will be stored this structure is referred as s2d3 namely as a static 2 way and dynamic 3 way structure in general this concept can be applied to any smdn n gt m structure this dynamic associativity is defined for each row at run time as defined by the write algorithm rather than defining it at design time as in the case of a regular static storage structure thus with the addition of two append target address ata bits per row potentially 50 more entries can be stored in the same structure as per this example in general the number of total static and dynamic entries can be altered per design in.