Data reuse tracking and memory allocation management
Exemplary methods, apparatuses, and systems receive a first request for a storage address at a first access time. Entries are added to first and second data structures. Each entry includes the storage address and the first access time. The first data structure is sorted in an order of storage addres...
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 | USECHE LUIS KOLLER RICARDO ZAROO PUNEET UYSAL MUSTAFA MANPATHAK SACHIN |
| description | Exemplary methods, apparatuses, and systems receive a first request for a storage address at a first access time. Entries are added to first and second data structures. Each entry includes the storage address and the first access time. The first data structure is sorted in an order of storage addresses. The second data structure is sorted in an order of access times. A second request for the storage address is received at a second access time. The first access time is determined by looking up the entry in first data structure using the storage address received in the second request. The entry in the second data structure is looked up using the determined first access time. A number of entries in second data structure that were subsequent to the second entry is determined. A hit count for a reuse distance corresponding to the determined number of entries is incremented. |
| format | Patent |
| fullrecord | <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_US9329896B2</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>US9329896B2</sourcerecordid><originalsourceid>FETCH-epo_espacenet_US9329896B23</originalsourceid><addsrcrecordid>eNrjZDBxSSxJVChKLS1OVSgpSkzOzsxLV0jMS1HITc3NL6pUSMzJyU9OLMnMz1PITcxLTE_NTc0r4WFgTUvMKU7lhdLcDApuriHOHrqpBfnxqcUFicmpeakl8aHBlsZGlhaWZk5GxkQoAQDi0yzJ</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>Data reuse tracking and memory allocation management</title><source>esp@cenet</source><creator>USECHE LUIS ; KOLLER RICARDO ; ZAROO PUNEET ; UYSAL MUSTAFA ; MANPATHAK SACHIN</creator><creatorcontrib>USECHE LUIS ; KOLLER RICARDO ; ZAROO PUNEET ; UYSAL MUSTAFA ; MANPATHAK SACHIN</creatorcontrib><description>Exemplary methods, apparatuses, and systems receive a first request for a storage address at a first access time. Entries are added to first and second data structures. Each entry includes the storage address and the first access time. The first data structure is sorted in an order of storage addresses. The second data structure is sorted in an order of access times. A second request for the storage address is received at a second access time. The first access time is determined by looking up the entry in first data structure using the storage address received in the second request. The entry in the second data structure is looked up using the determined first access time. A number of entries in second data structure that were subsequent to the second entry is determined. A hit count for a reuse distance corresponding to the determined number of entries is incremented.</description><language>eng</language><subject>CALCULATING ; COMPUTING ; COUNTING ; ELECTRIC DIGITAL DATA PROCESSING ; PHYSICS</subject><creationdate>2016</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=20160503&DB=EPODOC&CC=US&NR=9329896B2$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,780,885,25564,76547</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20160503&DB=EPODOC&CC=US&NR=9329896B2$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>USECHE LUIS</creatorcontrib><creatorcontrib>KOLLER RICARDO</creatorcontrib><creatorcontrib>ZAROO PUNEET</creatorcontrib><creatorcontrib>UYSAL MUSTAFA</creatorcontrib><creatorcontrib>MANPATHAK SACHIN</creatorcontrib><title>Data reuse tracking and memory allocation management</title><description>Exemplary methods, apparatuses, and systems receive a first request for a storage address at a first access time. Entries are added to first and second data structures. Each entry includes the storage address and the first access time. The first data structure is sorted in an order of storage addresses. The second data structure is sorted in an order of access times. A second request for the storage address is received at a second access time. The first access time is determined by looking up the entry in first data structure using the storage address received in the second request. The entry in the second data structure is looked up using the determined first access time. A number of entries in second data structure that were subsequent to the second entry is determined. A hit count for a reuse distance corresponding to the determined number of entries is incremented.</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>2016</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZDBxSSxJVChKLS1OVSgpSkzOzsxLV0jMS1HITc3NL6pUSMzJyU9OLMnMz1PITcxLTE_NTc0r4WFgTUvMKU7lhdLcDApuriHOHrqpBfnxqcUFicmpeakl8aHBlsZGlhaWZk5GxkQoAQDi0yzJ</recordid><startdate>20160503</startdate><enddate>20160503</enddate><creator>USECHE LUIS</creator><creator>KOLLER RICARDO</creator><creator>ZAROO PUNEET</creator><creator>UYSAL MUSTAFA</creator><creator>MANPATHAK SACHIN</creator><scope>EVB</scope></search><sort><creationdate>20160503</creationdate><title>Data reuse tracking and memory allocation management</title><author>USECHE LUIS ; KOLLER RICARDO ; ZAROO PUNEET ; UYSAL MUSTAFA ; MANPATHAK SACHIN</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_US9329896B23</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2016</creationdate><topic>CALCULATING</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>ELECTRIC DIGITAL DATA PROCESSING</topic><topic>PHYSICS</topic><toplevel>online_resources</toplevel><creatorcontrib>USECHE LUIS</creatorcontrib><creatorcontrib>KOLLER RICARDO</creatorcontrib><creatorcontrib>ZAROO PUNEET</creatorcontrib><creatorcontrib>UYSAL MUSTAFA</creatorcontrib><creatorcontrib>MANPATHAK SACHIN</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>USECHE LUIS</au><au>KOLLER RICARDO</au><au>ZAROO PUNEET</au><au>UYSAL MUSTAFA</au><au>MANPATHAK SACHIN</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>Data reuse tracking and memory allocation management</title><date>2016-05-03</date><risdate>2016</risdate><abstract>Exemplary methods, apparatuses, and systems receive a first request for a storage address at a first access time. Entries are added to first and second data structures. Each entry includes the storage address and the first access time. The first data structure is sorted in an order of storage addresses. The second data structure is sorted in an order of access times. A second request for the storage address is received at a second access time. The first access time is determined by looking up the entry in first data structure using the storage address received in the second request. The entry in the second data structure is looked up using the determined first access time. A number of entries in second data structure that were subsequent to the second entry is determined. A hit count for a reuse distance corresponding to the determined number of entries is incremented.</abstract><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_epo_espacenet_US9329896B2 |
| source | esp@cenet |
| subjects | CALCULATING COMPUTING COUNTING ELECTRIC DIGITAL DATA PROCESSING PHYSICS |
| title | Data reuse tracking and memory allocation management |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-01T10%3A07%3A42IST&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=USECHE%20LUIS&rft.date=2016-05-03&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EUS9329896B2%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 |