Another aspect of temporal locality is the duration for which a new stripe of page is allowed to remain in the cache without producing a hit. For simplicity, we have chosen the initial value of the recency bit to be set to 0 (see line 14 in Figure 4). Thus, on an average, a new write group gets a life equal to half the time required by the destage pointer to go around the clock once. If during this time, it produces a hit, it is granted one more life until the destage pointer returns to it once again. If the initial value is set to , then-on an average-a new write group gets a life equal to times the time required by the destage pointer to go around the clock once. More temporal locality can be discovered if the initial life is longer. However, this happens at the cost of larger average seek distances as more pages are skipped by the destage head. It may be possible to obtain the same effect without the penalty by maintaining a history of destaged pages in the spirit of MQ, ARC, and CAR algorithms.