Weighted history allocation predictor algorithm in a hybrid cache
A mechanism is provided for weighted history allocation prediction. For each member in a plurality of members in a lower level cache, an associated reference counter is initialized to an initial value based on an operation type that caused data to be allocated to a member location of the member. For...
Gespeichert in:
| Hauptverfasser: | , , , , |
|---|---|
| Format: | Patent |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | |
| container_volume | |
| creator | STUECHELI JEFFREY A GOODMAN BENJIMAN L SAWDEY AARON C DALY DAVID M POWELL STEPHEN J |
| description | A mechanism is provided for weighted history allocation prediction. For each member in a plurality of members in a lower level cache, an associated reference counter is initialized to an initial value based on an operation type that caused data to be allocated to a member location of the member. For each access to the member in the lower level cache, the associated reference counter is incremented. Responsive to a new allocation of data to the lower level cache and responsive to the new allocation of data requiring the victimization of another member in the lower level cache, a member of the lower level cache is identified that has a lowest reference count value in its associated reference counter. The member with the lowest reference count value in its associated reference counter is then evicted. |
| format | Patent |
| fullrecord | <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_US8930625B2</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>US8930625B2</sourcerecordid><originalsourceid>FETCH-epo_espacenet_US8930625B23</originalsourceid><addsrcrecordid>eNrjZHAMT81MzyhJTVHIyCwuyS-qVEjMyclPTizJzM9TKChKTclMBooCBdPzizJLMnIVMvMUEhUyKpOKMlMUkhOTM1J5GFjTEnOKU3mhNDeDgptriLOHbmpBfnxqcUFicmpeakl8aLCFpbGBmZGpk5ExEUoAzT4xpg</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>Weighted history allocation predictor algorithm in a hybrid cache</title><source>esp@cenet</source><creator>STUECHELI JEFFREY A ; GOODMAN BENJIMAN L ; SAWDEY AARON C ; DALY DAVID M ; POWELL STEPHEN J</creator><creatorcontrib>STUECHELI JEFFREY A ; GOODMAN BENJIMAN L ; SAWDEY AARON C ; DALY DAVID M ; POWELL STEPHEN J</creatorcontrib><description>A mechanism is provided for weighted history allocation prediction. For each member in a plurality of members in a lower level cache, an associated reference counter is initialized to an initial value based on an operation type that caused data to be allocated to a member location of the member. For each access to the member in the lower level cache, the associated reference counter is incremented. Responsive to a new allocation of data to the lower level cache and responsive to the new allocation of data requiring the victimization of another member in the lower level cache, a member of the lower level cache is identified that has a lowest reference count value in its associated reference counter. The member with the lowest reference count value in its associated reference counter is then evicted.</description><language>eng</language><subject>CALCULATING ; COMPUTING ; COUNTING ; ELECTRIC DIGITAL DATA PROCESSING ; PHYSICS</subject><creationdate>2015</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20150106&DB=EPODOC&CC=US&NR=8930625B2$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,777,882,25545,76296</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20150106&DB=EPODOC&CC=US&NR=8930625B2$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>STUECHELI JEFFREY A</creatorcontrib><creatorcontrib>GOODMAN BENJIMAN L</creatorcontrib><creatorcontrib>SAWDEY AARON C</creatorcontrib><creatorcontrib>DALY DAVID M</creatorcontrib><creatorcontrib>POWELL STEPHEN J</creatorcontrib><title>Weighted history allocation predictor algorithm in a hybrid cache</title><description>A mechanism is provided for weighted history allocation prediction. For each member in a plurality of members in a lower level cache, an associated reference counter is initialized to an initial value based on an operation type that caused data to be allocated to a member location of the member. For each access to the member in the lower level cache, the associated reference counter is incremented. Responsive to a new allocation of data to the lower level cache and responsive to the new allocation of data requiring the victimization of another member in the lower level cache, a member of the lower level cache is identified that has a lowest reference count value in its associated reference counter. The member with the lowest reference count value in its associated reference counter is then evicted.</description><subject>CALCULATING</subject><subject>COMPUTING</subject><subject>COUNTING</subject><subject>ELECTRIC DIGITAL DATA PROCESSING</subject><subject>PHYSICS</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2015</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZHAMT81MzyhJTVHIyCwuyS-qVEjMyclPTizJzM9TKChKTclMBooCBdPzizJLMnIVMvMUEhUyKpOKMlMUkhOTM1J5GFjTEnOKU3mhNDeDgptriLOHbmpBfnxqcUFicmpeakl8aLCFpbGBmZGpk5ExEUoAzT4xpg</recordid><startdate>20150106</startdate><enddate>20150106</enddate><creator>STUECHELI JEFFREY A</creator><creator>GOODMAN BENJIMAN L</creator><creator>SAWDEY AARON C</creator><creator>DALY DAVID M</creator><creator>POWELL STEPHEN J</creator><scope>EVB</scope></search><sort><creationdate>20150106</creationdate><title>Weighted history allocation predictor algorithm in a hybrid cache</title><author>STUECHELI JEFFREY A ; GOODMAN BENJIMAN L ; SAWDEY AARON C ; DALY DAVID M ; POWELL STEPHEN J</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_US8930625B23</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2015</creationdate><topic>CALCULATING</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>ELECTRIC DIGITAL DATA PROCESSING</topic><topic>PHYSICS</topic><toplevel>online_resources</toplevel><creatorcontrib>STUECHELI JEFFREY A</creatorcontrib><creatorcontrib>GOODMAN BENJIMAN L</creatorcontrib><creatorcontrib>SAWDEY AARON C</creatorcontrib><creatorcontrib>DALY DAVID M</creatorcontrib><creatorcontrib>POWELL STEPHEN J</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>STUECHELI JEFFREY A</au><au>GOODMAN BENJIMAN L</au><au>SAWDEY AARON C</au><au>DALY DAVID M</au><au>POWELL STEPHEN J</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>Weighted history allocation predictor algorithm in a hybrid cache</title><date>2015-01-06</date><risdate>2015</risdate><abstract>A mechanism is provided for weighted history allocation prediction. For each member in a plurality of members in a lower level cache, an associated reference counter is initialized to an initial value based on an operation type that caused data to be allocated to a member location of the member. For each access to the member in the lower level cache, the associated reference counter is incremented. Responsive to a new allocation of data to the lower level cache and responsive to the new allocation of data requiring the victimization of another member in the lower level cache, a member of the lower level cache is identified that has a lowest reference count value in its associated reference counter. The member with the lowest reference count value in its associated reference counter is then evicted.</abstract><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_epo_espacenet_US8930625B2 |
| source | esp@cenet |
| subjects | CALCULATING COMPUTING COUNTING ELECTRIC DIGITAL DATA PROCESSING PHYSICS |
| title | Weighted history allocation predictor algorithm in a hybrid cache |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-20T09%3A31%3A20IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-epo_EVB&rft_val_fmt=info:ofi/fmt:kev:mtx:patent&rft.genre=patent&rft.au=STUECHELI%20JEFFREY%20A&rft.date=2015-01-06&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EUS8930625B2%3C/epo_EVB%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |