Vis enkel innførsel

dc.contributor.authorKralevska, Katina
dc.contributor.authorGligoroski, Danilo
dc.contributor.authorJensen, Rune Erlend
dc.contributor.authorØverby, Harald
dc.date.accessioned2019-02-06T15:47:57Z
dc.date.available2019-02-06T15:47:57Z
dc.date.created2017-12-14T20:51:26Z
dc.date.issued2018
dc.identifier.citationIEEE Transactions on Big Data. 2018, 4 (4), 516-529.nb_NO
dc.identifier.issn2332-7790
dc.identifier.urihttp://hdl.handle.net/11250/2584221
dc.description.abstractMinimum-Storage Regenerating (MSR) codes have emerged as a viable alternative to Reed-Solomon (RS) codes as they minimize the repair bandwidth while they are still optimal in terms of reliability and storage overhead. Although several MSR constructions exist, so far they have not been practically implemented mainly due to the big number of I/O operations. In this paper, we analyze high-rate MDS codes that are simultaneously optimized in terms of storage, reliability, I/O operations, and repair-bandwidth for single and multiple failures of the systematic nodes. The codes were recently introduced in [1] without any specific name. Due to the resemblance between the hashtag sign # and the procedure of the code construction, we call them in this paper HashTag Erasure Codes (HTECs) . HTECs provide the lowest data-read and data-transfer, and thus the lowest repair time for an arbitrary sub-packetization level α , where α≤r⌈k/r⌉ , among all existing MDS codes for distributed storage including MSR codes. The repair process is linear and highly parallel. Additionally, we show that HTECs are the first high-rate MDS codes that reduce the repair bandwidth for more than one failure. Practical implementations of HTECs in Hadoop release 3.0.0-alpha2 demonstrate their great potentials.nb_NO
dc.language.isoengnb_NO
dc.publisherIEEEnb_NO
dc.titleHashTag Erasure Codes: From Theory to Practicenb_NO
dc.typeJournal articlenb_NO
dc.typePeer reviewednb_NO
dc.description.versionpublishedVersionnb_NO
dc.source.pagenumber516-529nb_NO
dc.source.volume4nb_NO
dc.source.journalIEEE Transactions on Big Datanb_NO
dc.source.issue4nb_NO
dc.identifier.doi10.1109/TBDATA.2017.2749255
dc.identifier.cristin1527705
dc.description.localcodeThis article will not be available due to copyright restrictions © 2018 by IEEEnb_NO
cristin.unitcode194,63,30,0
cristin.unitcode194,63,10,0
cristin.unitnameInstitutt for informasjonssikkerhet og kommunikasjonsteknologi
cristin.unitnameInstitutt for datateknologi og informatikk
cristin.ispublishedtrue
cristin.fulltextoriginal
cristin.qualitycode1


Tilhørende fil(er)

Thumbnail

Denne innførselen finnes i følgende samling(er)

Vis enkel innførsel