{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T21:55:42Z","timestamp":1773438942706,"version":"3.50.1"},"reference-count":43,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. & Syst."],"published-print":{"date-parts":[[2018]]},"DOI":"10.1587\/transinf.2017edp7218","type":"journal-article","created":{"date-parts":[[2018,3,1]],"date-time":"2018-03-01T22:26:21Z","timestamp":1519943181000},"page":"627-643","source":"Crossref","is-referenced-by-count":2,"title":["An Efficient Parallel Coding Scheme in Erasure-Coded Storage Systems"],"prefix":"10.1587","volume":"E101.D","author":[{"given":"Wenrui","family":"DONG","sequence":"first","affiliation":[{"name":"National University of Defense Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guangming","family":"LIU","sequence":"additional","affiliation":[{"name":"National University of Defense Technology"},{"name":"National Supercomputer Center in Tianjin"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"publisher","unstructured":"[1] Y.-J. Wang, W.-D. Sun, S. Zhou, X.-Q. Pei, and X.-Y. Li, \u201cKey technologies of distributed storage for cloud computing,\u201d Journal of Software, vol.23, no.4, pp.962-986, 2012. 10.3724\/sp.j.1001.2012.04175","DOI":"10.3724\/SP.J.1001.2012.04175"},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] S. Ghemawat, H. Gobioff, and S.-T. Leung, \u201cThe google file system,\u201d Proceedings of ACM SIGOPS Operating Systems Review, vol.37, no.5, pp.29-43, ACM, 2003. 10.1145\/1165389.945450","DOI":"10.1145\/1165389.945450"},{"key":"3","unstructured":"[3] D. Borthakur, \u201cThe hadoop distributed file system: Architecture and design,\u201d Hadoop Project Website, vol.11, p.21, 2007."},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] J. Bl\u00f6mer and J.-P. Seifert, \u201cOn the complexity of computing short linearly independent vectors and short bases in a lattice,\u201d Proc. Thirty-First Annual ACM Symposium on Theory of Computing, May 1-4, 1999, Atlanta, Georgia, USA, pp.711-720, 1999. 10.1145\/301250.301441","DOI":"10.1145\/301250.301441"},{"key":"5","unstructured":"[5] J.S. Plank and L. Xu, \u201cOptimizing cauchy reed-solomon codes for fault-tolerant network storage applications,\u201d Fifth IEEE International Symposium on Network Computing and Applications, NCA 2006, 24-26 July 2006, Cambridge, Massachusetts, USA, pp.173-180, 2006. 10.1109\/nca.2006.43"},{"key":"6","unstructured":"[6] F.J. MacWilliams and N.J.A. Sloane, The Theory of Error-Correcting Codes, North-Holland, 1977."},{"key":"7","unstructured":"[7] J.S. Plank, J. Luo, C.D. Schuman, L. Xu, and Z. Wilcox-O'Hearn, \u201cA performance evaluation and examination of open-source erasure coding libraries for storage,\u201d Proc. 7th USENIX Conference on File and Storage Technologies, pp.253-265, USENIX Association, 2009."},{"key":"8","unstructured":"[8] HDFS-RAID, https:\/\/wiki.apache.org\/hadoop\/HDFS-RAID"},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] B. Fan, W. Tantisiriroj, L. Xiao, and G. Gibson, \u201cDiskreduce: Raid for data-intensive scalable computing,\u201d Proc. Sumpercomping-Petascale Data Storage Workshop (PDSW'09), Portland, pp.6-10, ACM, 2009. 10.1145\/1713072.1713075","DOI":"10.1145\/1713072.1713075"},{"key":"10","unstructured":"[10] B. Fan, W. Tantisiriroj, L. Xiao, and G. Gibson, \u201cDiskreduce: Replication as a prelude to erasure coding in data-intensive scalable computing,\u201d the International Conference for High Performance Computing, Networking, Storage and Analysis (SC11), Nov. 12-18, 2011."},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] R.M. Tomasulo, \u201cAn efficient algorithm for exploiting multiple arithmetic units,\u201d IBM J. Res. & Dev., vol.11, no.1, pp.25-33, 1967.","DOI":"10.1147\/rd.111.0025"},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] D. Karger, E. Lehman, T. Leighton, R. Panigrahy, M. Levine, and D. Lewin, \u201cConsistent hashing and random trees: Distributed caching protocols for relieving hot spots on the world wide web,\u201d Proc. Twenty-ninth Annual ACM Symposium on Theory of Computing, pp.654-663, ACM, 1997. 10.1145\/258533.258660","DOI":"10.1145\/258533.258660"},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] H. Weatherspoon and J. Kubiatowicz, \u201cErasure coding vs. replication: A quantitative comparison,\u201d Peer-to-Peer Systems, vol.2429, pp.328-337, 2002. 10.1007\/3-540-45748-8_31","DOI":"10.1007\/3-540-45748-8_31"},{"key":"14","doi-asserted-by":"crossref","unstructured":"[14] R. Rodrigues and B. Liskov, \u201cHigh availability in dhts: Erasure coding vs. replication,\u201d Peer-to-Peer Systems IV, vol.3640, pp.226-239, 2005. 10.1007\/11558989_21","DOI":"10.1007\/11558989_21"},{"key":"15","doi-asserted-by":"publisher","unstructured":"[15] X. Lu, H. Wang, J. Wanga, J. Xu, and D. Li, \u201cInternet-based virtual computing environment: Beyond the data center as a computer,\u201d Future Generation Computer Systems, vol.29, no.1, pp.309-322, 2013. 10.1016\/j.future.2011.08.005","DOI":"10.1016\/j.future.2011.08.005"},{"key":"16","doi-asserted-by":"publisher","unstructured":"[16] Y. Wang, X. Li, X. Li, and Y. Wang, \u201cA survey of queries over uncertain data,\u201d Knowledge and Information Systems, vol.37, no.3, pp.485-530, 2013. 10.1007\/s10115-013-0638-6","DOI":"10.1007\/s10115-013-0638-6"},{"key":"17","unstructured":"[17] S.B. Wicker, Reed-Solomon Codes and Their Applications, pp.1-15, IEEE Press Piscataway, 1994."},{"key":"18","doi-asserted-by":"crossref","unstructured":"[18] M.G. Luby, M. Mitzenmacher, M.A. Shokrollahi, D.A. Spielman, and V. Stemann, \u201cPractical loss-resilient codes,\u201d 29th Annual ACM Symposium on Theory of Computing, El Paso, TX, USA, pp.150-159, ACM, 1997. 10.1145\/258533.258573","DOI":"10.1145\/258533.258573"},{"key":"19","doi-asserted-by":"crossref","unstructured":"[19] R.L. Collins and J.S. Plank, \u201cAssessing the performance of erasure codes in the wide-area,\u201d International Conference on Dependable Systems and Networks, Yokohama, Japan, IEEE, pp.182-187, 2005. 10.1109\/dsn.2005.21","DOI":"10.1109\/DSN.2005.21"},{"key":"20","doi-asserted-by":"crossref","unstructured":"[20] J.L. Hafner, \u201cHover erasure codes for disk arrays,\u201d 2006 International Conference on Dependable Systems and Networks (DSN 2006), pp.217-226, 2006. 10.1109\/dsn.2006.40","DOI":"10.1109\/DSN.2006.40"},{"key":"21","unstructured":"[21] J.L. Hafner, \u201cWeaver codes highly fault tolerant erasure codes for storage systems,\u201d Proc. 4th conference on USENIX Conference on File and Storage Technologies, San Francisco, USA, p.16, Usenix Association, 2005. 10.1109\/acssc.2011.6190329"},{"key":"22","doi-asserted-by":"publisher","unstructured":"[22] M.G. Luby, M. Mitzenmacher, M.A. Shokrollahi, and D.A. Spielman, \u201cImproved low-density parity-check codes using irregular graphs,\u201d IEEE Trans. Inf. Theory, vol.47, no.2, pp.585-598, 2001. 10.1109\/18.910576","DOI":"10.1109\/18.910576"},{"key":"23","doi-asserted-by":"crossref","unstructured":"[23] R. Karp, M. Luby, and A. Shokrollahi, \u201cFinite length analysis of LT codes,\u201d International Symposium onInformation Theory, 2004, Proceedings., p.37, 2004. 10.1109\/isit.2004.1365074","DOI":"10.1109\/ISIT.2004.1365074"},{"key":"24","doi-asserted-by":"crossref","unstructured":"[24] A. Shokrollahi, \u201cRaptor codes,\u201d IEEE Trans. Inf. Theory, vol.52, no.6, pp.2551-2567, 2006. 10.1109\/tit.2006.874390","DOI":"10.1109\/TIT.2006.874390"},{"key":"25","doi-asserted-by":"publisher","unstructured":"[25] M. Blaum, J. Brady, J. Bruck, and J. Menon, \u201cEvenodd: An efficient scheme for tolerating double disk failures in raid architectures,\u201d IEEE Trans. Comput., vol.44, no.2, pp.192-202, 1995. 10.1109\/12.364531","DOI":"10.1109\/12.364531"},{"key":"26","doi-asserted-by":"publisher","unstructured":"[26] L. Xu and J. Bruck, \u201cX-code: MDS array codes with optimal encoding,\u201d IEEE Trans. Inf. Theory, vol.45, no.1, pp.272-276, 1999. 10.1109\/18.746809","DOI":"10.1109\/18.746809"},{"key":"27","doi-asserted-by":"publisher","unstructured":"[27] C. Huang and L. Xu, \u201cStar: An efficient coding scheme for correcting triple storage node failures,\u201d IEEE Trans. Comput., vol.57, no.7, pp.889-901, 2008. 10.1109\/tc.2007.70830","DOI":"10.1109\/TC.2007.70830"},{"key":"28","unstructured":"[28] P. Corbett, B. English, A. Goel, T. Grcanac, S. Kleiman, J. Leong, and S. Sankar, \u201cRow-diagonal parity for double disk failure correction,\u201d Proc. 3rd USENIX Conference on File and Storage Technologies, pp.1-14, 2004."},{"key":"29","doi-asserted-by":"publisher","unstructured":"[29] K.V. Rashmi, N.B. Shah, and P.V. Kumar, \u201cOptimal exact-regenerating codes for distributed storage at the MSR and MBR points via a product-matrix construction,\u201d IEEE Trans. Inf. Theory, vol.57, no.8, pp.5227-5239, 2011. 10.1109\/tit.2011.2159049","DOI":"10.1109\/TIT.2011.2159049"},{"key":"30","doi-asserted-by":"publisher","unstructured":"[30] A.G. Dimakis, P.B. Godfrey, Y. Wu, M.J. Wainwright, and K. Ramchandran, \u201cNetwork coding for distributed storage systems,\u201d IEEE Trans. Inf. Theory, vol.56, no.9, pp.4539-4551, 2010. 10.1109\/tit.2010.2054295","DOI":"10.1109\/TIT.2010.2054295"},{"key":"31","doi-asserted-by":"crossref","unstructured":"[31] J. Li, S. Yang, X. Wang, X. Xue, and B. Li, \u201cTree-structured data regeneration with network coding in distributed storage systems,\u201d Proc. 17th International Workshop on Quality of Service (IWQoS), 2009, pp.1-9, 2009. 10.1109\/iwqos.2009.5201391","DOI":"10.1109\/IWQoS.2009.5201391"},{"key":"32","doi-asserted-by":"publisher","unstructured":"[32] W. Sun, Y. Wang, and X. Pei, \u201cTree-structured parallel regeneration for multiple data losses in distributed storage systems based on erasure codes,\u201d China Communications, vol.10, no.4, pp.113-125, 2013. 10.1109\/cc.2013.6506936","DOI":"10.1109\/CC.2013.6506936"},{"key":"33","doi-asserted-by":"crossref","unstructured":"[33] M.L. Curry, A. Skjellum, H.L. Ward, and R. Brightwell, \u201cAccelerating reed-solomon coding in raid systems with gpus,\u201d IEEE International Symposium on Parallel and Distributed Processing (IPDPS 2008), pp.1-6, 2008. 10.1109\/ipdps.2008.4536322","DOI":"10.1109\/IPDPS.2008.4536322"},{"key":"34","doi-asserted-by":"crossref","unstructured":"[34] M.L. Curry, A. Skjellum, H.L. Ward, and R. Brightwell, \u201cArbitrary dimension reed-solomon coding and decoding for extended raid on GPUs,\u201d 2008 3rd Petascale Data Storage Workshop, pp.1-3, 2008. 10.1109\/pdsw.2008.4811887","DOI":"10.1109\/PDSW.2008.4811887"},{"key":"35","doi-asserted-by":"crossref","unstructured":"[35] R. Wyrzykowski, L. Kuczynski, and M. Wozniak, \u201cTowards efficient execution of erasure codes on multicore architectures,\u201d Proc. 10th international conference on Applied Parallel and Scientific Computing-Volume 2, PARA'10, Berlin, Heidelberg, vol.7134, pp.357-367, Springer-Verlag, 2012. 10.1007\/978-3-642-28145-7_35","DOI":"10.1007\/978-3-642-28145-7_35"},{"key":"36","doi-asserted-by":"crossref","unstructured":"[36] P. Sobe and K. Peter, \u201cFlexible parameterization of xor based codes for distributed storage,\u201d 2008 7th IEEE International Symposium on Network Computing and Applications, pp.101-110, 2008. 10.1109\/nca.2008.45","DOI":"10.1109\/NCA.2008.45"},{"key":"37","doi-asserted-by":"crossref","unstructured":"[37] P. Sobe, \u201cParallel reed\/solomon coding on multicore processors,\u201d 2010 International Workshop on Storage Network Architecture and Parallel I\/Os (SNAPI), pp.71-80, 2010. 10.1109\/snapi.2010.16","DOI":"10.1109\/SNAPI.2010.16"},{"key":"38","unstructured":"[38] IEEE Computer Society, The Hadoop Distributed File System, Lake Tahoe, Nevada, USA, 2010."},{"key":"39","doi-asserted-by":"publisher","unstructured":"[39] Y. Wang and S. Li, \u201cResearch and performance evaluation of data replication technology in distributed storage systems,\u201d Comput. Math. Appl., vol.51, no.11, pp.1625-1632, 2006. 10.1016\/j.camwa.2006.05.002","DOI":"10.1016\/j.camwa.2006.05.002"},{"key":"40","doi-asserted-by":"crossref","unstructured":"[40] M. Luby, \u201cTornado Codes: Practical erasure codes based on random irregular graphs,\u201d International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM '98), Barcelona, Spain, vol.1518, pp.171-175, USENIX Association, 1998. 10.1007\/3-540-49543-6_14","DOI":"10.1007\/3-540-49543-6_14"},{"key":"41","unstructured":"[41] D. Ford, F. Labelle, F.I. Popovici, M. Stokely, V.A. Truong, L. Barroso, C. Grimes, and S. Quinlan, \u201cAvailability in globally distributed storage systems,\u201d Proc. 9th USENIX conference on Operating systems design and implementation, pp.1-7, USENIX Association, 2010."},{"key":"42","unstructured":"[42] C. Huang, H. Simitci, Y. Xu, A. Ogus, B. Calder, P. Gopalan, J. Li, and S. Yekhanin, \u201cErasure coding in windows azure storage,\u201d USENIX Annual Technical Conference (USENIX ATC), 2012."},{"key":"43","unstructured":"[43] D. Borthakur, R. Schmit, R. Vadali, S. Chen, and P. Kling, \u201cHdfs raid,\u201d Tech talk, Yahoo Developer Network, 2010."}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E101.D\/3\/E101.D_2017EDP7218\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T06:35:13Z","timestamp":1751438113000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E101.D\/3\/E101.D_2017EDP7218\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"references-count":43,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2017edp7218","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]}}}