Memory-efficient object address mapping in a tiered data structure
Systems, methods and/or devices are used to perform memory-efficient mapping of block/object addresses. In one aspect, a method of managing a storage system having one or more storage devices includes a tiered data structure in which each node has a logical ID and entries in the nodes reference othe...
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 | George, Johann Tudor, Frederic H Krishnan, Manavalan Firsov, Evgeniy O'Krafka, Brian W Neelakanta, Niranjan Patre |
| description | Systems, methods and/or devices are used to perform memory-efficient mapping of block/object addresses. In one aspect, a method of managing a storage system having one or more storage devices includes a tiered data structure in which each node has a logical ID and entries in the nodes reference other nodes in the tiered data structure using the logical IDs. As a result, when a child node is updated and stored to a new location, but retains its logical ID, its parent node does not need to be updated, because the logical ID in the entry referencing the child node remains unchanged. Further, the storage system uses a secondary mapping table to translate the logical IDs to the corresponding physical locations of the corresponding nodes. Additionally, the secondary mapping table is cached in volatile memory, and as a result, the physical location of a required node is determined without accessing non-volatile memory. |
| format | Patent |
| fullrecord | <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_US10747676B2</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>US10747676B2</sourcerecordid><originalsourceid>FETCH-epo_espacenet_US10747676B23</originalsourceid><addsrcrecordid>eNqNyjsOwjAQBUA3FAi4w3KASPwU90EgGiqgjhb7OTIituXdFNyehgNQTTNz010x5vppEEJ0EUkpP19wSux9hQiNXEpMA8VETBpR4cmzMonWyelUsTSzwG_B6ufCrM-n-_HSoOQeUtghQfvHbbuxB9vattvt_zlfRAsyRQ</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>Memory-efficient object address mapping in a tiered data structure</title><source>esp@cenet</source><creator>George, Johann ; Tudor, Frederic H ; Krishnan, Manavalan ; Firsov, Evgeniy ; O'Krafka, Brian W ; Neelakanta, Niranjan Patre</creator><creatorcontrib>George, Johann ; Tudor, Frederic H ; Krishnan, Manavalan ; Firsov, Evgeniy ; O'Krafka, Brian W ; Neelakanta, Niranjan Patre</creatorcontrib><description>Systems, methods and/or devices are used to perform memory-efficient mapping of block/object addresses. In one aspect, a method of managing a storage system having one or more storage devices includes a tiered data structure in which each node has a logical ID and entries in the nodes reference other nodes in the tiered data structure using the logical IDs. As a result, when a child node is updated and stored to a new location, but retains its logical ID, its parent node does not need to be updated, because the logical ID in the entry referencing the child node remains unchanged. Further, the storage system uses a secondary mapping table to translate the logical IDs to the corresponding physical locations of the corresponding nodes. Additionally, the secondary mapping table is cached in volatile memory, and as a result, the physical location of a required node is determined without accessing non-volatile memory.</description><language>eng</language><subject>CALCULATING ; COMPUTING ; COUNTING ; ELECTRIC DIGITAL DATA PROCESSING ; PHYSICS</subject><creationdate>2020</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=20200818&DB=EPODOC&CC=US&NR=10747676B2$$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=20200818&DB=EPODOC&CC=US&NR=10747676B2$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>George, Johann</creatorcontrib><creatorcontrib>Tudor, Frederic H</creatorcontrib><creatorcontrib>Krishnan, Manavalan</creatorcontrib><creatorcontrib>Firsov, Evgeniy</creatorcontrib><creatorcontrib>O'Krafka, Brian W</creatorcontrib><creatorcontrib>Neelakanta, Niranjan Patre</creatorcontrib><title>Memory-efficient object address mapping in a tiered data structure</title><description>Systems, methods and/or devices are used to perform memory-efficient mapping of block/object addresses. In one aspect, a method of managing a storage system having one or more storage devices includes a tiered data structure in which each node has a logical ID and entries in the nodes reference other nodes in the tiered data structure using the logical IDs. As a result, when a child node is updated and stored to a new location, but retains its logical ID, its parent node does not need to be updated, because the logical ID in the entry referencing the child node remains unchanged. Further, the storage system uses a secondary mapping table to translate the logical IDs to the corresponding physical locations of the corresponding nodes. Additionally, the secondary mapping table is cached in volatile memory, and as a result, the physical location of a required node is determined without accessing non-volatile memory.</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>2020</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNqNyjsOwjAQBUA3FAi4w3KASPwU90EgGiqgjhb7OTIituXdFNyehgNQTTNz010x5vppEEJ0EUkpP19wSux9hQiNXEpMA8VETBpR4cmzMonWyelUsTSzwG_B6ufCrM-n-_HSoOQeUtghQfvHbbuxB9vattvt_zlfRAsyRQ</recordid><startdate>20200818</startdate><enddate>20200818</enddate><creator>George, Johann</creator><creator>Tudor, Frederic H</creator><creator>Krishnan, Manavalan</creator><creator>Firsov, Evgeniy</creator><creator>O'Krafka, Brian W</creator><creator>Neelakanta, Niranjan Patre</creator><scope>EVB</scope></search><sort><creationdate>20200818</creationdate><title>Memory-efficient object address mapping in a tiered data structure</title><author>George, Johann ; Tudor, Frederic H ; Krishnan, Manavalan ; Firsov, Evgeniy ; O'Krafka, Brian W ; Neelakanta, Niranjan Patre</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_US10747676B23</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2020</creationdate><topic>CALCULATING</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>ELECTRIC DIGITAL DATA PROCESSING</topic><topic>PHYSICS</topic><toplevel>online_resources</toplevel><creatorcontrib>George, Johann</creatorcontrib><creatorcontrib>Tudor, Frederic H</creatorcontrib><creatorcontrib>Krishnan, Manavalan</creatorcontrib><creatorcontrib>Firsov, Evgeniy</creatorcontrib><creatorcontrib>O'Krafka, Brian W</creatorcontrib><creatorcontrib>Neelakanta, Niranjan Patre</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>George, Johann</au><au>Tudor, Frederic H</au><au>Krishnan, Manavalan</au><au>Firsov, Evgeniy</au><au>O'Krafka, Brian W</au><au>Neelakanta, Niranjan Patre</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>Memory-efficient object address mapping in a tiered data structure</title><date>2020-08-18</date><risdate>2020</risdate><abstract>Systems, methods and/or devices are used to perform memory-efficient mapping of block/object addresses. In one aspect, a method of managing a storage system having one or more storage devices includes a tiered data structure in which each node has a logical ID and entries in the nodes reference other nodes in the tiered data structure using the logical IDs. As a result, when a child node is updated and stored to a new location, but retains its logical ID, its parent node does not need to be updated, because the logical ID in the entry referencing the child node remains unchanged. Further, the storage system uses a secondary mapping table to translate the logical IDs to the corresponding physical locations of the corresponding nodes. Additionally, the secondary mapping table is cached in volatile memory, and as a result, the physical location of a required node is determined without accessing non-volatile memory.</abstract><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_epo_espacenet_US10747676B2 |
| source | esp@cenet |
| subjects | CALCULATING COMPUTING COUNTING ELECTRIC DIGITAL DATA PROCESSING PHYSICS |
| title | Memory-efficient object address mapping in a tiered data structure |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-28T04%3A29%3A15IST&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=George,%20Johann&rft.date=2020-08-18&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EUS10747676B2%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 |