{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:39:01Z","timestamp":1740123541229,"version":"3.37.3"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2016,2,17]],"date-time":"2016-02-17T00:00:00Z","timestamp":1455667200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003621","name":"Ministry of Science, ICT and Future Planning (KR)","doi-asserted-by":"publisher","award":["R0126-15-1082"],"award-info":[{"award-number":["R0126-15-1082"]}],"id":[{"id":"10.13039\/501100003621","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003621","name":"Ministry of Science, ICT and Future Planning (KR)","doi-asserted-by":"publisher","award":["K-16-L03-C01"],"award-info":[{"award-number":["K-16-L03-C01"]}],"id":[{"id":"10.13039\/501100003621","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2016,4]]},"DOI":"10.1007\/s11227-016-1661-7","type":"journal-article","created":{"date-parts":[[2016,2,16]],"date-time":"2016-02-16T23:55:24Z","timestamp":1455666924000},"page":"1312-1341","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Dynamic erasure coding decision for modern block-oriented distributed storage systems"],"prefix":"10.1007","volume":"72","author":[{"given":"Hoo-Young","family":"Ahn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kyong-Ha","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoon-Joon","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,2,17]]},"reference":[{"key":"1661_CR1","doi-asserted-by":"crossref","unstructured":"Abad CL, Lu Y, Campbell RH (2011) Dare: adaptive data replication for efficient cluster scheduling. In: 2011 IEEE international conference on cluster computing (CLUSTER). IEEE, pp 159\u2013168","DOI":"10.1109\/CLUSTER.2011.26"},{"key":"1661_CR2","doi-asserted-by":"crossref","unstructured":"Andr\u00e9 F, Kermarrec AM, Le Merrer E, Le Scouarnec N, Straub G, Van Kempen A (2014) Archiving cold data in warehouses with clustered network coding. In: Proceedings of the ninth European conference on computer systems. ACM, New York, p 21","DOI":"10.1145\/2592798.2592816"},{"issue":"1","key":"1661_CR3","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0196-6774(85)90018-5","volume":"6","author":"BS Baker","year":"1985","unstructured":"Baker BS (1985) A new proof for the first-fit decreasing bin-packing algorithm. J Algorithms 6(1):49\u201370","journal-title":"J Algorithms"},{"issue":"4","key":"1661_CR4","doi-asserted-by":"crossref","first-page":"846","DOI":"10.1137\/0209064","volume":"9","author":"BS Baker","year":"1980","unstructured":"Baker BS, Coffman EG Jr, Rivest RL (1980) Orthogonal packings in two dimensions. SIAM J Comput 9(4):846\u2013855","journal-title":"SIAM J Comput"},{"key":"1661_CR5","first-page":"21","volume":"11","author":"D Borthakur","year":"2007","unstructured":"Borthakur D (2007) The hadoop distributed file system: architecture and design. Hadoop Proj Website 11:21","journal-title":"Hadoop Proj Website"},{"key":"1661_CR6","doi-asserted-by":"crossref","unstructured":"Cheng Z, Luan Z, Meng Y, Xu Y, Qian D, Roy A, Zhang N, Guan G (2012) Erms: an elastic replication management system for hdfs. In: 2012 IEEE international conference on cluster computing workshops (CLUSTER WORKSHOPS). IEEE, pp 32\u201340","DOI":"10.1109\/ClusterW.2012.25"},{"issue":"9","key":"1661_CR7","doi-asserted-by":"crossref","first-page":"4539","DOI":"10.1109\/TIT.2010.2054295","volume":"56","author":"AG Dimakis","year":"2010","unstructured":"Dimakis AG, Godfrey PB, Wu Y, Wainwright MJ, Ramchandran K (2010) Network coding for distributed storage systems. IEEE Trans Inf Theory 56(9):4539\u20134551","journal-title":"IEEE Trans Inf Theory"},{"issue":"3","key":"1661_CR8","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1109\/JPROC.2010.2096170","volume":"99","author":"AG Dimakis","year":"2011","unstructured":"Dimakis AG, Ramchandran K, Wu Y, Suh C (2011) A survey on network codes for distributed storage. Proc IEEE 99(3):476\u2013489","journal-title":"Proc IEEE"},{"key":"1661_CR9","doi-asserted-by":"crossref","unstructured":"Fan B, Tantisiriroj W, Xiao L, Gibson G (2009) Diskreduce: raid for data-intensive scalable computing. In: Proceedings of the 4th annual workshop on petascale data storage. ACM, New York, pp 6\u201310","DOI":"10.1145\/1713072.1713075"},{"key":"1661_CR10","unstructured":"Fan B, Tantisiriroj W, Xiao L, Gibson G (2011) Diskreduce: replication as a prelude to erasure coding in data-intensive scalable computing. In: SC high performance computing networking, storage and analysis, pp 6\u20138"},{"key":"1661_CR11","doi-asserted-by":"crossref","unstructured":"Friedman R, Kantor Y, Kantor A (2014) Replicated erasure codes for storage and repair-traffic efficiency. In: 14th IEEE international conference on peer-to-peer computing (P2P). IEEE, pp 1\u201310","DOI":"10.1109\/P2P.2014.6934310"},{"key":"1661_CR12","doi-asserted-by":"crossref","unstructured":"Ghemawat S, Gobioff H, Leung ST (2003) The google file system. In: ACM SIGOPS operating systems review, vol\u00a037. ACM, New York, pp 29\u201343","DOI":"10.1145\/945445.945450"},{"key":"1661_CR13","unstructured":"Gibson G et al (2010) Hdfs-raid wiki. http:\/\/wiki.apache.org\/hadoop\/HDFS-RAID . Accessed Feb 2016"},{"key":"1661_CR14","first-page":"211","volume":"5","author":"JL Hafner","year":"2005","unstructured":"Hafner JL (2005) Weaver codes: highly fault tolerant erasure codes for storage systems. FAST 5:211\u2013224","journal-title":"FAST"},{"issue":"1","key":"1661_CR15","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1007\/s00037-006-0205-6","volume":"15","author":"E Hazan","year":"2006","unstructured":"Hazan E, Safra S, Schwartz O (2006) On the complexity of approximating $$k$$ k -set packing. Comput Complex 15(1):20\u201339","journal-title":"Comput Complex"},{"key":"1661_CR16","unstructured":"Huang C, Simitci H, Xu Y, Ogus A, Calder B, Gopalan P, Li J, Yekhanin S et al (2012) Erasure coding in windows azure storage. In: USENIX ATC, vol\u00a012"},{"key":"1661_CR17","doi-asserted-by":"crossref","unstructured":"Hwang K, Jin H, Ho R (2000) Raid-x: a new distributed disk array for i\/o-centric cluster computing. In: Proceedings of the ninth international symposium on high-performance distributed computing. IEEE, pp 279\u2013286","DOI":"10.1109\/HPDC.2000.868660"},{"issue":"1","key":"1661_CR18","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1109\/71.980025","volume":"13","author":"K Hwang","year":"2002","unstructured":"Hwang K, Jin H, Ho RS (2002) Orthogonal striping and mirroring in distributed raid for i\/o-centric cluster computing. IEEE Trans Parallel Distrib Syst 13(1):26\u201344","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"1\u20132","key":"1661_CR19","doi-asserted-by":"crossref","first-page":"472","DOI":"10.14778\/1920841.1920903","volume":"3","author":"D Jiang","year":"2010","unstructured":"Jiang D, Ooi BC, Shi L, Wu S (2010) The performance of mapreduce: an in-depth study. Proc VLDB Endow 3(1\u20132):472\u2013483","journal-title":"Proc VLDB Endow"},{"key":"1661_CR20","doi-asserted-by":"crossref","unstructured":"Kaushik RT, Abdelzaher T, Egashira R, Nahrstedt K (2011) Predictive data and energy management in greenhdfs. In: 2011 international on green computing conference and workshops (IGCC). IEEE, pp 1\u20139","DOI":"10.1109\/IGCC.2011.6008563"},{"key":"1661_CR21","unstructured":"Kaushik RT, Bhandarkar M (2010) Greenhdfs: towards an energy-conserving, storage-efficient, hybrid hadoop compute cluster. In: Proceedings of the USENIX annual technical conference, p 109"},{"key":"1661_CR22","unstructured":"Khan O, Burns R, Plank J, Pierce W, Huang C (2012) Rethinking erasure codes for cloud file systems: minimizing i\/o for recovery and degraded reads. In: Proc. of USENIX FAST"},{"issue":"4","key":"1661_CR23","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1145\/2094114.2094118","volume":"40","author":"KH Lee","year":"2012","unstructured":"Lee KH, Lee YJ, Choi H, Chung YD, Moon B (2012) Parallel data processing with mapreduce: a survey. SIGMOD Rec 40(4):11\u201320","journal-title":"SIGMOD Rec"},{"issue":"4","key":"1661_CR24","first-page":"11","volume":"4","author":"J MacCormick","year":"2009","unstructured":"MacCormick J, Murphy N, Ramasubramanian V, Wieder U, Yang J, Zhou L (2009) Kinesis: a new approach to replica placement in distributed storage systems. ACM Trans Storage (TOS) 4(4):11","journal-title":"ACM Trans Storage (TOS)"},{"key":"1661_CR25","unstructured":"Muralidhar S, Lloyd W, Roy S, Hill C, Lin E, Liu W, Pan S, Shankar S, Sivakumar V, Tang L et al (2014) F4: Facebooks warm blob storage system. In: Proceedings of the 11th USENIX conference on operating systems design and implementation. USENIX Association, pp 383\u2013398"},{"key":"1661_CR26","doi-asserted-by":"crossref","unstructured":"Pamies-Juarez L, Datta A, Oggier F (2013) Rapidraid: pipelined erasure codes for fast data archival in distributed storage systems. In: INFOCOM, 2013 Proceedings IEEE. IEEE, pp 1294\u20131302","DOI":"10.1109\/INFCOM.2013.6566922"},{"key":"1661_CR27","doi-asserted-by":"crossref","unstructured":"Pamies-Juarez L, Oggier F, Datta A (2013) Decentralized erasure coding for efficient data archival in distributed storage systems. In: Distributed computing and networking. Springer, New York, pp 42\u201356","DOI":"10.1007\/978-3-642-35668-1_4"},{"key":"1661_CR28","doi-asserted-by":"crossref","unstructured":"Patterson DA, Gibson G, Katz RH (1988) A case for redundant arrays of inexpensive disks (RAID), vol\u00a017. ACM, New York","DOI":"10.1145\/50202.50214"},{"issue":"3","key":"1661_CR29","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1177\/1094342009106191","volume":"23","author":"JS Plank","year":"2009","unstructured":"Plank JS (2009) The raid-6 liber8tion code. Int J High Perform Comput Appl 23(3):242\u2013251","journal-title":"Int J High Perform Comput Appl"},{"key":"1661_CR30","first-page":"253","volume":"9","author":"JS Plank","year":"2009","unstructured":"Plank JS, Luo J, Schuman CD, Xu L, Wilcox-O\u2019Hearn Z et al (2009) A performance evaluation and examination of open-source erasure coding libraries for storage. FAST 9:253\u2013265","journal-title":"FAST"},{"key":"1661_CR31","unstructured":"Plank JS, Simmerman S, Schuman CD (2008) Jerasure: a library in C\/C++ facilitating erasure coding for storage applications-version 1.2. University of Tennessee, Tech. Rep. CS-08-627 23"},{"key":"1661_CR32","doi-asserted-by":"crossref","unstructured":"Rashmi K, Shah NB, Gu D, Kuang H, Borthakur D, Ramchandran K (2014) A hitchhiker\u2019s guide to fast and efficient data reconstruction in erasure-coded data centers. In: Proceedings of the 2014 ACM conference on SIGCOMM. ACM, New York, pp 331\u2013342","DOI":"10.1145\/2740070.2626325"},{"key":"1661_CR33","doi-asserted-by":"crossref","unstructured":"Sathiamoorthy M, Asteris M, Papailiopoulos D, Dimakis AG, Vadali R, Chen S, Borthakur D (2013) Xoring elephants: novel erasure codes for big data. In: Proceedings of the 39th international conference on very large data bases. VLDB Endowment, pp 325\u2013336","DOI":"10.14778\/2535573.2488339"},{"key":"1661_CR34","doi-asserted-by":"crossref","unstructured":"Shvachko K, Kuang H, Radia S, Chansler R (2010) The hadoop distributed file system. In: 2010 IEEE 26th symposium on mass storage systems and technologies (MSST). IEEE, pp 1\u201310","DOI":"10.1109\/MSST.2010.5496972"},{"key":"1661_CR35","doi-asserted-by":"crossref","unstructured":"Stonebraker M, Schloss GA (1990) Distributed raid-a new multiple copy algorithm. In: Proceedings of sixth international conference on data engineering. IEEE, pp 430\u2013437","DOI":"10.1109\/ICDE.1990.113496"},{"key":"1661_CR36","doi-asserted-by":"crossref","unstructured":"Wang J, Gong W, Varman P, Xie C (2012) Reducing storage overhead with small write bottleneck avoiding in cloud raid system. In: Proceedings of the 2012 ACM\/IEEE 13th international conference on grid computing. IEEE Computer Society, pp 174\u2013183","DOI":"10.1109\/Grid.2012.29"},{"key":"1661_CR37","doi-asserted-by":"crossref","unstructured":"Weatherspoon H, Kubiatowicz JD (2002) Erasure coding vs. replication: a quantitative comparison. In: Peer-to-peer systems. Springer, New York, pp 328\u2013337","DOI":"10.1007\/3-540-45748-8_31"},{"key":"1661_CR38","unstructured":"Weil SA, Brandt SA, Miller EL, Long DD, Maltzahn C (2006) Ceph: a scalable, high-performance distributed file system. In: Proceedings of the 7th symposium on operating systems design and implementation. USENIX Association, pp 307\u2013320"},{"key":"1661_CR39","first-page":"1","volume":"8","author":"B Welch","year":"2008","unstructured":"Welch B, Unangst M, Abbasi Z, Gibson GA, Mueller B, Small J, Zelenka J, Zhou B (2008) Scalable performance of the panasas parallel file system. FAST 8:1\u201317","journal-title":"FAST"},{"key":"1661_CR40","unstructured":"Xia M, Saxena M, Blaum M, Pease DA (2015) A tale of two erasure codes in hdfs. In: 13th USENIX conference on file and storage technologies (FAST\u201915). USENIX Association, pp 213\u2013226"},{"issue":"9","key":"1661_CR41","doi-asserted-by":"crossref","first-page":"1455","DOI":"10.1109\/TPDS.2011.27","volume":"22","author":"S Zaman","year":"2011","unstructured":"Zaman S, Grosu D (2011) A distributed algorithm for the replica placement problem. IEEE Trans Parallel Distrib Syst 22(9):1455\u20131468","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"1661_CR42","unstructured":"Zhang Z, Deshpande A, Ma X, Thereska E, Narayanan D (2010) Does erasure coding have a role to play in my data center. Microsoft research MSR-TR-2010 52"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-016-1661-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-016-1661-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-016-1661-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T06:40:46Z","timestamp":1559371246000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-016-1661-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,2,17]]},"references-count":42,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,4]]}},"alternative-id":["1661"],"URL":"https:\/\/doi.org\/10.1007\/s11227-016-1661-7","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"type":"print","value":"0920-8542"},{"type":"electronic","value":"1573-0484"}],"subject":[],"published":{"date-parts":[[2016,2,17]]}}}