Dynamic erasure coding decision for modern block-oriented distributed storage systems

Cited 2 time in webofscience Cited 0 time in scopus
  • Hit : 438
  • Download : 0
DC FieldValueLanguage
dc.contributor.authorAhn, Hoo Youngko
dc.contributor.authorLee, Kyong-Hako
dc.contributor.authorLee, Yoon-Joonko
dc.date.accessioned2016-07-05T07:51:12Z-
dc.date.available2016-07-05T07:51:12Z-
dc.date.created2016-02-17-
dc.date.created2016-02-17-
dc.date.issued2016-04-
dc.identifier.citationJOURNAL OF SUPERCOMPUTING, v.72, no.4, pp.1312 - 1341-
dc.identifier.issn0920-8542-
dc.identifier.urihttp://hdl.handle.net/10203/209221-
dc.description.abstractModern block-oriented distributed storage systems like Hadoop distributed file system have proliferated in this era of big data and cloud computing. These systems feature block-level replication in which their files are partitioned into equal-sized blocks and multiple copies for each block are then arbitrarily distributed across nodes for fault tolerance and data availability. However, many storage volumes are just wasted only for keeping block copies whose data may not be accessed frequently in the strategy. Therefore, distributed storage systems begin to adopt erasure codes. However, classical parity encoding scheme are hard to be directly applied to the distributed storage systems since block copies are arbitrarily placed across nodes in the systems. We present a novel technique, called DynaEC, to address the issues in modern block-oriented distributed storage systems. DynaEC provides a unique parity encoding algorithm that encodes data blocks arbitrarily distributed across machines to parities and then places the parities guaranteeing fault tolerance. Parity encoding in DynaEC is performed without any change of the original block placement policy in Hadoop distributed file system. This makes DynaEC work seamlessly with Hadoop distributed file system. Finally, during the encoding procedure each data node encodes each own data blocks, not requiring any information about other blocks located in other data nodes. As such, the encoding procedure in DynaEC is fully performed in parallel without any synchronization issue. With extensive experiments, we show that DynaEC saves storage volumes up to the theoretical limit while outperforming previous approaches by multiple orders of magnitude.-
dc.languageEnglish-
dc.publisherSPRINGER-
dc.subjectPACKING-
dc.titleDynamic erasure coding decision for modern block-oriented distributed storage systems-
dc.typeArticle-
dc.identifier.wosid000374330300003-
dc.identifier.scopusid2-s2.0-84958742801-
dc.type.rimsART-
dc.citation.volume72-
dc.citation.issue4-
dc.citation.beginningpage1312-
dc.citation.endingpage1341-
dc.citation.publicationnameJOURNAL OF SUPERCOMPUTING-
dc.identifier.doi10.1007/s11227-016-1661-7-
dc.contributor.localauthorLee, Yoon-Joon-
dc.contributor.nonIdAuthorLee, Kyong-Ha-
dc.type.journalArticleArticle-
dc.subject.keywordAuthorDistributed storage system-
dc.subject.keywordAuthorStorage overhead-
dc.subject.keywordAuthorHadoop-
dc.subject.keywordAuthorHDFS-
dc.subject.keywordAuthorData replication-
dc.subject.keywordAuthorErasure coding-
dc.subject.keywordAuthorRAID-
dc.subject.keywordPlusPACKING-
Appears in Collection
CS-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 2 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0