LRU algorithm to determine which block to be replaced -
for on-chip cache, 80486 uses replacement algorithm called pseudo least used. associated each of 128 sets of 4 lines (labeled l0, l1, l2, , l3) 3 bits b0, b1, , b2. replacement algorithm works follows: when line must replaced, cache first determine whether recent use pair l0/l1 or pair l2/l3. cache determine of pair of blocks least used , mark replacement. specify how bits b0, b1, , b2 used in replacement algorithm , demonstrate approximates true lru algorithm through example of line useage order algorithm differ lru algorithm.
i confused on how go answering question. didn't hardly talk lru @ let alone algorithms implement it. run this: if b0 0, l0/l1 used. if b0 1, l2/ l3 used. there though don't know b1 , b2. can explain me?
Comments
Post a Comment