白丝美女被狂躁免费视频网站,500av导航大全精品,yw.193.cnc爆乳尤物未满,97se亚洲综合色区,аⅴ天堂中文在线网官网

Integration of application indicated minimum time to cache for a two-tiered cache management mechanism

專利號(hào)
US11176057B2
公開日期
2021-11-16
申請(qǐng)人
INTERNATIONAL BUSINESS MACHINES CORPORATION(US NY Armonk)
發(fā)明人
Lokesh Mohan Gupta; Matthew G. Borlick; Beth Ann Peterson; Kyler A. Anderson
IPC分類
G06F12/123; G06F12/0891; G06F12/0893
技術(shù)領(lǐng)域
cache,scm,retention,minimum,dram,tracks,track,lru,in,time
地域: NY NY Armonk

摘要

An indication is received from a host application of a first minimum retention time in a cache comprising a first type of memory and a second type of memory for a first plurality of tracks, wherein the first minimum retention time is not indicated for a second plurality of tracks. Based on the first minimum retention time, a second minimum retention time is set for the first plurality of tracks for the first type of memory and a third minimum retention time is set for the first plurality of tracks for the second type of memory. A track of the first plurality of tracks is demoted from the first type of memory, in response to determining that the track is a least recently used (LRU) track in a LRU list of tracks in the first type of memory and the track has been in the first type of memory for a time that exceeds the second minimum retention time.

說明書

In certain embodiments, the cache management application 116 demotes tracks from the two-tier cache 104 by taking into account the LRU list 118 which is augmented with the minimum retention time for tracks where such minimum retention times are available. An attempt is made by the cache management application 116 to satisfy the minimum retention time requirements to the extent possible, while at the same time preventing the two-tier cache 104 from becoming full.

FIG. 2 illustrates a block diagram 200 that shows demotion of tracks from a LRU list that does not incorporate a minimum retention time for selected tracks, in accordance with certain embodiments.

For simplicity, only four tracks, denoted as track K 202, track C 204, track D 206, and track B 208 are shown in FIG. 2, although a typical LRU list may have thousands or tens of thousands of tracks.

The LRU end of the list is towards the top (as shown via reference numeral 210). As a result, track K 202 is the least recently used track, and track B 208 is the most recently used track.

Unless minimum retention time information was included with the tracks, track K 202 is demoted in a conventional LRU based cache replacement policy (as shown via reference numeral 212). However, if track K 202 is likely to seek entry to the cache shortly after demotion (for example in a situation where a host application 120 indicates that track K 202 should have a minimum retention time), then the cache hit ratio would be decreased.

權(quán)利要求

1
微信群二維碼
意見反饋