{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T21:18:29Z","timestamp":1726003109005},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030050566"},{"type":"electronic","value":"9783030050573"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-05057-3_22","type":"book-chapter","created":{"date-parts":[[2018,12,6]],"date-time":"2018-12-06T19:52:26Z","timestamp":1544125946000},"page":"270-279","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["P-Schedule: Erasure Coding Schedule Strategy in Big Data Storage System"],"prefix":"10.1007","author":[{"given":"Chao","family":"Yin","sequence":"first","affiliation":[]},{"given":"Haitao","family":"Lv","sequence":"additional","affiliation":[]},{"given":"Tongfang","family":"Li","sequence":"additional","affiliation":[]},{"given":"Yan","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Xiaoping","family":"Qu","sequence":"additional","affiliation":[]},{"given":"Sihao","family":"Yuan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,12,7]]},"reference":[{"issue":"2","key":"22_CR1","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1147\/sj.422.0205","volume":"42","author":"RJT Morris","year":"2003","unstructured":"Morris, R.J.T., Truskowski, B.J.: The evolution of storage systems. IBM Syst. J. 42(2), 205\u2013217 (2003)","journal-title":"IBM Syst. J."},{"issue":"1","key":"22_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s40537-014-0007-7","volume":"2","author":"MM Najafabadi","year":"2015","unstructured":"Najafabadi, M.M., Villanustre, F., Khoshgoftaar, T.M., Seliya, N., Wald, R., Muharemagic, E.: Deep learning applications and challenges in big data analytics. J. Big Data 2(1), 1\u201321 (2015)","journal-title":"J. Big Data"},{"issue":"5","key":"22_CR3","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s12599-014-0345-1","volume":"6","author":"M Schermann","year":"2014","unstructured":"Schermann, M., Hemsen, H., Buchm\u00fcller, C., Bitter, T., Krcmar, H., Markl, V., Hoeren, T.: Big data. Bus. Inf. Syst. Eng. 6(5), 261\u2013266 (2014)","journal-title":"Bus. Inf. Syst. Eng."},{"issue":"1","key":"22_CR4","first-page":"1","volume":"3","author":"Y Chen","year":"2016","unstructured":"Chen, Y., Chen, H., Gorkhali, A., Lu, Y., Ma, Y., Li, L.: Big data analytics and big data science: a survey. J. Manag. Anal. 3(1), 1\u201342 (2016)","journal-title":"J. Manag. Anal."},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"Li, S., Cao, Q., Wan, S., Qian, L., Xie, C.: HRSPC: a hybrid redundancy scheme via exploring computational locality to support fast recovery and high reliability in distributed storage systems. J. Netw. Comput. Appl. (2015)","DOI":"10.1016\/j.jnca.2015.12.012"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"Calder, B., Wang, J., Ogus, A., et al.: Windows Azure storage: a highly available cloud storage service with strong consistency. In: Proceeding of the Twenty-Third ACM Symposium on Operating Systems Principles, pp. 143\u2013157 (2011)","DOI":"10.1145\/2043556.2043571"},{"key":"22_CR7","unstructured":"Chun, B.G., Dabek, F., Haeberlen, A., et al.: Efficient replica maintenance for distributed storage systems. In: Proceedings of NSDI, pp. 225\u2013264 (2006)"},{"issue":"2","key":"22_CR8","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1145\/176979.176981","volume":"26","author":"PM Chen","year":"1994","unstructured":"Chen, P.M., Lee, E.K., Gibson, G.A., et al.: RAID: high-performance, reliable secondary storage. ACM Comput. Surv.\u2013CSUR 26(2), 145\u2013185 (1994)","journal-title":"ACM Comput. Surv.\u2013CSUR"},{"key":"22_CR9","unstructured":"Corbett, P., English, B., Goel, A., et al.: Row-diagonal parity for double disk failure correction. In: FAST 2004: Proceedings of the 3rd USENIX Conference on File and Storage Technologies, pp. 1\u201314 (2004)"},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"Xiang, L., Xu, Y., Lui, J., et al.: Optimal recovery of single disk failure in RDP code storage systems. In: SIGMETRICS 2010 Proceedings of the ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, pp. 119\u2013130 (2010)","DOI":"10.1145\/1811039.1811054"},{"issue":"2","key":"22_CR11","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1109\/12.364531","volume":"44","author":"M Blaum","year":"1995","unstructured":"Blaum, M., Brady, J., Bruck, J., et al.: EVENODD: an efficient scheme for tolerating double disk failures in RAID architectures. IEEE Trans. Comput. 44(2), 192\u2013202 (1995)","journal-title":"IEEE Trans. Comput."},{"issue":"7","key":"22_CR12","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1109\/TC.2007.70830","volume":"57","author":"C Huang","year":"2008","unstructured":"Huang, C., Xu, L.: STAR: an efficient coding scheme for correcting triple storage node failures. IEEE Trans. Comput. 57(7), 889\u2013901 (2008)","journal-title":"IEEE Trans. Comput."},{"issue":"2","key":"22_CR13","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1137\/0108018","volume":"8","author":"IS Reed","year":"1996","unstructured":"Reed, I.S., Solomon, G.: Polynomial codes over certain finite fields. J. Soc. Ind. Appl. Math. 8(2), 300\u2013304 (1996)","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"22_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/11558989_21","volume-title":"Peer-to-Peer Systems IV","author":"R Rodrigues","year":"2005","unstructured":"Rodrigues, R., Liskov, B.: High availability in DHTs: erasure coding vs. replication. In: Castro, M., van Renesse, R. (eds.) IPTPS 2005. LNCS, vol. 3640, pp. 226\u2013239. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11558989_21"},{"issue":"1","key":"22_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2093139.2093141","volume":"8","author":"Jianqiang Luo","year":"2012","unstructured":"Luo, J., Bowers, K.D., Oprea, A., Xu, L.: Efficient software implementations of large finite fields GF(2n) for secure storage applications. ACM Trans. Storage 8(2) (2012)","journal-title":"ACM Transactions on Storage"}],"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-030-05057-3_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,6]],"date-time":"2019-11-06T18:23:08Z","timestamp":1573064588000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-05057-3_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030050566","9783030050573"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-05057-3_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"ICA3PP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Architectures for Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guangzhou","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 November 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 November 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ica3pp2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/nsclab.org\/ica3pp2018\/authors.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"407","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"141","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"50","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"35% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"2.3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"7.3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}