{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T23:17:35Z","timestamp":1725837455664},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319271187"},{"type":"electronic","value":"9783319271194"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-27119-4_16","type":"book-chapter","created":{"date-parts":[[2015,11,16]],"date-time":"2015-11-16T04:39:29Z","timestamp":1447648769000},"page":"228-240","source":"Crossref","is-referenced-by-count":1,"title":["OptRS: An Optimized Algorithm Based on CRS Codes in Big Data Storage Systems"],"prefix":"10.1007","author":[{"given":"Chao","family":"Yin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianzong","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haitao","family":"Lv","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zongmin","family":"Cui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lianglun","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qin","family":"Zhan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tongfang","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,12,16]]},"reference":[{"key":"16_CR1","unstructured":"Schmuh, F., Haskin, R.: GPFS: A shareddisk file system for large computing clusters. In: Proceedings of the 1st USENIX Conference on File and Storage Technologies (2002), Monterey, CA, USA (2002)"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"Ghemawat, S., Gobioff, H., Leung, S.-T.: The google file system. In: Proceedings of the Nineteenth ACM Symposium on Operating Systems Principles, SOSP 2003, pp. 29\u201343 (2003)","DOI":"10.1145\/1165389.945450"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Shvachko, K., Kuang, H., Radia, S., Chansler, R.: The hadoop distributed file system. In: Proceedings of IEEE MSST 2010, Incline Village, NV, USA, May 2010","DOI":"10.1109\/MSST.2010.5496972"},{"key":"16_CR4","unstructured":"Amazon Simple Storage Service (S3). \n                      http:\/\/www.amazon.com\/s3"},{"key":"16_CR5","unstructured":"Weil, S.A., Brandt, S.A., Miller, E.L., et al.: Ceph: a scalable, high-performance distributed file system. In: Proceedings of the 7th Conference on Operating Systems Design and Implementation (2006)"},{"issue":"2","key":"16_CR6","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1137\/0108018","volume":"8","author":"IS Reed","year":"1960","unstructured":"Reed, I.S., Solmon, G.: Polynomial codes over certain finite fields. J. Soc. Ind. Appl. Math. 8(2), 300\u2013304 (1960)","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"16_CR7","unstructured":"Colossus, successor to Google File System. \n                      http:\/\/static.googleusercontent.com\/media\/research.google.com\/en\/us\/university\/relations\/facultysummit2010\/storage_architecture_and_challenges.pdf\/"},{"key":"16_CR8","unstructured":"Huang, C., Simitci, H., Xu, Y. et al.: Erasure coding in Windows AzureStorage. In: USENIX Annual Technical Conference (ATC) (June 2012), boston, MA,USA (2012)"},{"key":"16_CR9","unstructured":"Facebooks approach to big data storage challenge. \n                      http:\/\/www.slideshare.net\/Hadoop_Summit\/facebooks-approachto-big-data-storage-challenge"},{"key":"16_CR10","unstructured":"Blomer, J., Kalfane, M., Karpinski, M., et al.: An XOR-based erasure-resilient coding scheme. Technical Report TR-95-048, International Computer Science Institute, August 1995"},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"DeCandia, G., Hastorun, D., Jampani, M., et al.: Dynamo: amazon\u2019s highly available key-value store. In: ACM SIGOPS Operating Systems Review, Vol. 41(6), pp. 205\u2013220. ACM (2007)","DOI":"10.1145\/1323293.1294281"},{"key":"16_CR12","unstructured":"An introduction to GPFS version 3.5. \n                      http:\/\/www-03.ibm.com\/systems\/resources\/introduction-to-gpfs-3-5.pdf"},{"key":"16_CR13","unstructured":"Facebooks erasure coded hadoop distributed file system (HDFS-RAID). \n                      https:\/\/github.com\/facebook\/hadoop-20"},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"Yin, C., Xie, C., Wan, J., et al.: BMCloud: Minimizing repair bandwidth and maintenance cost in cloud storage. In: Mathematical Problems in Engineering (2013)","DOI":"10.1155\/2013\/756185"},{"key":"16_CR15","unstructured":"Plank, J.S., Greenan, K.M., Miller, E.L.: Screaming fast Galois Field arithmetic using Intel SIMD instructions. In: Proceedings of the 11th USENIX Conference on File and Storage Technologies (2013), San Jose, CA, USA (2013)"},{"key":"16_CR16","doi-asserted-by":"crossref","unstructured":"Rashmi, K.V., Shan, N.B., Gu, D., et al.: A hitchhikers guide to fast and efficient data reconstruction in erasure-coded data centers. In: Proceedings of ACM SIGCOMM14, SIGCOMM (2014)","DOI":"10.1145\/2619239.2626325"},{"key":"16_CR17","doi-asserted-by":"crossref","unstructured":"Yin, C., Wang, J., Xie, C., et al.: Robot: an efficient model for big data storage systems based on erasure coding. In: Proceedings of the IEEE International Conference on Big Data, Santa Clara, CA, USA (2013)","DOI":"10.1109\/BigData.2013.6691569"},{"key":"16_CR18","unstructured":"Khan, O., Burns, R., Plank, J., et al.: Rethinking eerasure codes for cloud file systems: minimizing I\/O for recovery and degraded reads. In: Proceedings of the 10th USENIX Conference on File and Storage Technologies, San Jose, CA, USA (2012)"},{"key":"16_CR19","unstructured":"Xia, M., Saxena, M., Blaum, M., et al.: A tale of two erasure codes in HDFS. In: the Proceedings of the 13th USENIX Conference on File and Storage Technologies, Santa Clara, CA, USA (2015)"},{"issue":"8","key":"16_CR20","doi-asserted-by":"publisher","first-page":"4661","DOI":"10.1109\/TIT.2014.2321280","volume":"60","author":"I Tamo","year":"2014","unstructured":"Tamo, I., Barg, A.: A family of optimal locally recoverable codes. IEEE Trans. Inf. Theor. 60(8), 4661\u20134676 (2014)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"16_CR21","unstructured":"Rashmi, K.V., Nakkiran, P., Wang, J., et al.: Having your cake and eating it too: jointly optimal erasure codes for I\/O, storage, and network-bandwidth. In: The Proceedings of the 13th USENIX Conference on File and Storage Technologies, Santa Clara, CA, USA (2015)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-27119-4_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T15:19:16Z","timestamp":1559315956000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-27119-4_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319271187","9783319271194"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-27119-4_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}