INCREMENTAL ERASURE CODING FOR STORAGE SYSTEMS

A method comprising: generating a storage chunk having a plurality of data fragments, the storage chunk stored in one or more storage devices; allocating space in a primary memory to store a plurality of coded fragments; receiving a plurality of I/O requests to write data; allocating space in the pr...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Buinov Konstantin, Trusov Maxim, Fomin Andrey, Kurilov Andrey, Danilov Mikhail
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 Buinov Konstantin
Trusov Maxim
Fomin Andrey
Kurilov Andrey
Danilov Mikhail
description A method comprising: generating a storage chunk having a plurality of data fragments, the storage chunk stored in one or more storage devices; allocating space in a primary memory to store a plurality of coded fragments; receiving a plurality of I/O requests to write data; allocating space in the primary memory to store a next unfilled data fragment; processing a plurality of I/O requests to write data; and copying the coded fragments from the primary memory to the one or more storage devices. For each I/O request, writing the data to the next unfilled data fragment in the one or more storage devices, writing the data to the next unfilled data fragment in the primary memory, and if the data fragment in the primary memory is full, updating the coded fragments in the primary memory using the filled data fragment in the primary memory.
format Patent
fullrecord <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_US2018004414A1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>US2018004414A1</sourcerecordid><originalsourceid>FETCH-epo_espacenet_US2018004414A13</originalsourceid><addsrcrecordid>eNrjZNDz9HMOcvV19Qtx9FFwDXIMDg1yVXD2d_H0c1dw8w9SCA7xD3J0d1UIjgwOcfUN5mFgTUvMKU7lhdLcDMpuriHOHrqpBfnxqcUFicmpeakl8aHBRgaGFgYGJiaGJo6GxsSpAgCLvCbK</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>INCREMENTAL ERASURE CODING FOR STORAGE SYSTEMS</title><source>esp@cenet</source><creator>Buinov Konstantin ; Trusov Maxim ; Fomin Andrey ; Kurilov Andrey ; Danilov Mikhail</creator><creatorcontrib>Buinov Konstantin ; Trusov Maxim ; Fomin Andrey ; Kurilov Andrey ; Danilov Mikhail</creatorcontrib><description>A method comprising: generating a storage chunk having a plurality of data fragments, the storage chunk stored in one or more storage devices; allocating space in a primary memory to store a plurality of coded fragments; receiving a plurality of I/O requests to write data; allocating space in the primary memory to store a next unfilled data fragment; processing a plurality of I/O requests to write data; and copying the coded fragments from the primary memory to the one or more storage devices. For each I/O request, writing the data to the next unfilled data fragment in the one or more storage devices, writing the data to the next unfilled data fragment in the primary memory, and if the data fragment in the primary memory is full, updating the coded fragments in the primary memory using the filled data fragment in the primary memory.</description><language>eng</language><subject>CALCULATING ; COMPUTING ; COUNTING ; ELECTRIC DIGITAL DATA PROCESSING ; PHYSICS</subject><creationdate>2018</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&amp;date=20180104&amp;DB=EPODOC&amp;CC=US&amp;NR=2018004414A1$$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&amp;date=20180104&amp;DB=EPODOC&amp;CC=US&amp;NR=2018004414A1$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>Buinov Konstantin</creatorcontrib><creatorcontrib>Trusov Maxim</creatorcontrib><creatorcontrib>Fomin Andrey</creatorcontrib><creatorcontrib>Kurilov Andrey</creatorcontrib><creatorcontrib>Danilov Mikhail</creatorcontrib><title>INCREMENTAL ERASURE CODING FOR STORAGE SYSTEMS</title><description>A method comprising: generating a storage chunk having a plurality of data fragments, the storage chunk stored in one or more storage devices; allocating space in a primary memory to store a plurality of coded fragments; receiving a plurality of I/O requests to write data; allocating space in the primary memory to store a next unfilled data fragment; processing a plurality of I/O requests to write data; and copying the coded fragments from the primary memory to the one or more storage devices. For each I/O request, writing the data to the next unfilled data fragment in the one or more storage devices, writing the data to the next unfilled data fragment in the primary memory, and if the data fragment in the primary memory is full, updating the coded fragments in the primary memory using the filled data fragment in the primary 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>2018</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZNDz9HMOcvV19Qtx9FFwDXIMDg1yVXD2d_H0c1dw8w9SCA7xD3J0d1UIjgwOcfUN5mFgTUvMKU7lhdLcDMpuriHOHrqpBfnxqcUFicmpeakl8aHBRgaGFgYGJiaGJo6GxsSpAgCLvCbK</recordid><startdate>20180104</startdate><enddate>20180104</enddate><creator>Buinov Konstantin</creator><creator>Trusov Maxim</creator><creator>Fomin Andrey</creator><creator>Kurilov Andrey</creator><creator>Danilov Mikhail</creator><scope>EVB</scope></search><sort><creationdate>20180104</creationdate><title>INCREMENTAL ERASURE CODING FOR STORAGE SYSTEMS</title><author>Buinov Konstantin ; Trusov Maxim ; Fomin Andrey ; Kurilov Andrey ; Danilov Mikhail</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_US2018004414A13</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2018</creationdate><topic>CALCULATING</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>ELECTRIC DIGITAL DATA PROCESSING</topic><topic>PHYSICS</topic><toplevel>online_resources</toplevel><creatorcontrib>Buinov Konstantin</creatorcontrib><creatorcontrib>Trusov Maxim</creatorcontrib><creatorcontrib>Fomin Andrey</creatorcontrib><creatorcontrib>Kurilov Andrey</creatorcontrib><creatorcontrib>Danilov Mikhail</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Buinov Konstantin</au><au>Trusov Maxim</au><au>Fomin Andrey</au><au>Kurilov Andrey</au><au>Danilov Mikhail</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>INCREMENTAL ERASURE CODING FOR STORAGE SYSTEMS</title><date>2018-01-04</date><risdate>2018</risdate><abstract>A method comprising: generating a storage chunk having a plurality of data fragments, the storage chunk stored in one or more storage devices; allocating space in a primary memory to store a plurality of coded fragments; receiving a plurality of I/O requests to write data; allocating space in the primary memory to store a next unfilled data fragment; processing a plurality of I/O requests to write data; and copying the coded fragments from the primary memory to the one or more storage devices. For each I/O request, writing the data to the next unfilled data fragment in the one or more storage devices, writing the data to the next unfilled data fragment in the primary memory, and if the data fragment in the primary memory is full, updating the coded fragments in the primary memory using the filled data fragment in the primary memory.</abstract><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier
ispartof
issn
language eng
recordid cdi_epo_espacenet_US2018004414A1
source esp@cenet
subjects CALCULATING
COMPUTING
COUNTING
ELECTRIC DIGITAL DATA PROCESSING
PHYSICS
title INCREMENTAL ERASURE CODING FOR STORAGE SYSTEMS
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-28T12%3A04%3A49IST&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=Buinov%20Konstantin&rft.date=2018-01-04&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EUS2018004414A1%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