{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T02:19:41Z","timestamp":1771467581942,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":103,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,11,13]],"date-time":"2021-11-13T00:00:00Z","timestamp":1636761600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,11,14]]},"DOI":"10.1145\/3458817.3476204","type":"proceedings-article","created":{"date-parts":[[2021,10,21]],"date-time":"2021-10-21T04:49:21Z","timestamp":1634791761000},"page":"1-14","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":15,"title":["Accelerating XOR-based erasure coding using program optimization techniques"],"prefix":"10.1145","author":[{"given":"Yuya","family":"Uezato","sequence":"first","affiliation":[{"name":"Dwango, Co., Ltd., Japan"}]}],"member":"320","published-online":{"date-parts":[[2021,11,13]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/321992.322001"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/6448"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/0201002"},{"key":"e_1_3_2_2_4_1","unstructured":"F. E. Allen and J. Cocke. 1972. A Catalogue of Optimizing Transformations. In Design and Optimization of Compilers R. Rustin (Ed.). Prentice-Hall 1--30.  F. E. Allen and J. Cocke. 1972. A Catalogue of Optimizing Transformations. In Design and Optimization of Compilers R. Rustin (Ed.). Prentice-Hall 1--30."},{"key":"e_1_3_2_2_5_1","volume-title":"SODA '21","author":"Alman J.","unstructured":"J. Alman and V. V. Williams . 2021. A Refined Laser Method and Faster Matrix Multiplication . In SODA '21 . 522--539. J. Alman and V. V. Williams. 2021. A Refined Laser Method and Faster Matrix Multiplication. In SODA '21. 522--539."},{"key":"e_1_3_2_2_6_1","volume-title":"Detecting Equality of Variables in Programs. In POPL '88","author":"Alpern B.","unstructured":"B. Alpern , M. N. Wegman , and F. K. Zadeck . 1988 . Detecting Equality of Variables in Programs. In POPL '88 . ACM, 1--11. B. Alpern, M. N. Wegman, and F. K. Zadeck. 1988. Detecting Equality of Variables in Programs. In POPL '88. ACM, 1--11."},{"key":"e_1_3_2_2_7_1","unstructured":"AMD. 2020. AMD64 Architecture Programmer's Manual. https:\/\/www.amd.com\/system\/files\/TechDocs\/26568.pdf  AMD. 2020. AMD64 Architecture Programmer's Manual. https:\/\/www.amd.com\/system\/files\/TechDocs\/26568.pdf"},{"key":"e_1_3_2_2_8_1","unstructured":"Apache Hadoop. 2020. HDFS Erasure Coding. https:\/\/hadoop.apache.org\/docs\/current\/hadoop-project-dist\/hadoop-hdfs\/HDFSErasureCoding.html  Apache Hadoop. 2020. HDFS Erasure Coding. https:\/\/hadoop.apache.org\/docs\/current\/hadoop-project-dist\/hadoop-hdfs\/HDFSErasureCoding.html"},{"key":"e_1_3_2_2_9_1","volume-title":"Optimal Spilling for CISC Machines with Few Registers. In PLDI '01","author":"Appel A. W.","unstructured":"A. W. Appel and L. George . 2001 . Optimal Spilling for CISC Machines with Few Registers. In PLDI '01 . ACM, 243--253. A. W. Appel and L. George. 2001. Optimal Spilling for CISC Machines with Few Registers. In PLDI '01. ACM, 243--253."},{"key":"e_1_3_2_2_10_1","unstructured":"ARM. 2020. SIMD Neon. https:\/\/developer.arm.com\/documentation\/ddi0487\/latest  ARM. 2020. SIMD Neon. https:\/\/developer.arm.com\/documentation\/ddi0487\/latest"},{"key":"e_1_3_2_2_11_1","unstructured":"Storage Networking Industry Association. 2009. Common RAID Disk Data Format. https:\/\/www.snia.org\/tech_activities\/standards\/curr_standards\/ddf  Storage Networking Industry Association. 2009. Common RAID Disk Data Format. https:\/\/www.snia.org\/tech_activities\/standards\/curr_standards\/ddf"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.364531"},{"key":"e_1_3_2_2_13_1","unstructured":"J. Bl\u00f6mer M. Kalfane R. Karp M. Karpinski M. Luby and D. Zuckerman. 1995. An XOR-Based Erasure-Resilient Coding Scheme. ICSI Technical Report No. TR-95-048 (1995).  J. Bl\u00f6mer M. Kalfane R. Karp M. Karpinski M. Luby and D. Zuckerman. 1995. An XOR-Based Erasure-Resilient Coding Scheme. ICSI Technical Report No. TR-95-048 (1995)."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72521-3_21"},{"key":"e_1_3_2_2_15_1","volume-title":"On the Complexity of Register Coalescing. In CGO '07","author":"Bouchez F.","unstructured":"F. Bouchez , A. Darte , and F. Rastello . 2007 . On the Complexity of Register Coalescing. In CGO '07 . 102--114. F. Bouchez, A. Darte, and F. Rastello. 2007. On the Complexity of Register Coalescing. In CGO '07. 102--114."},{"key":"e_1_3_2_2_16_1","volume-title":"LCTES '07","author":"Bouchez F.","unstructured":"F. Bouchez , A. Darte , and F. Rastello . 2007. On the Complexity of Spill Everywhere under SSA Form . In LCTES '07 . ACM, 103--112. F. Bouchez, A. Darte, and F. Rastello. 2007. On the Complexity of Spill Everywhere under SSA Form. In LCTES '07. ACM, 103--112."},{"key":"e_1_3_2_2_17_1","volume-title":"On the Shortest Linear Straight-Line Program for Computing Linear Forms. In MFCS '08","author":"Boyar J.","unstructured":"J. Boyar , P. Matthews , and R. Peralta . 2008 . On the Shortest Linear Straight-Line Program for Computing Linear Forms. In MFCS '08 . Springer, 168--179. J. Boyar, P. Matthews, and R. Peralta. 2008. On the Shortest Linear Straight-Line Program for Computing Linear Forms. In MFCS '08. Springer, 168--179."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-012-9124-7"},{"key":"e_1_3_2_2_19_1","first-page":"6","article-title":"Generation of Optimal Code for Expressions via","volume":"12","author":"Breuer M. A.","year":"1969","unstructured":"M. A. Breuer . 1969 . Generation of Optimal Code for Expressions via Factorization. Commun. ACM 12 , 6 (June 1969), 333--340. M. A. Breuer. 1969. Generation of Optimal Code for Expressions via Factorization. Commun. ACM 12, 6 (June 1969), 333--340.","journal-title":"Factorization. Commun. ACM"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/177492.177575"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/321958.321971"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/321992.321996"},{"key":"e_1_3_2_2_23_1","volume-title":"SPAA '16","author":"Carpenter T.","unstructured":"T. Carpenter , F. Rastello , P. Sadayappan , and A. Sidiropoulos . 2016. Brief Announcement: Approximating the I\/O Complexity of One-Shot Red-Blue Pebbling . In SPAA '16 . ACM, 161--163. T. Carpenter, F. Rastello, P. Sadayappan, and A. Sidiropoulos. 2016. Brief Announcement: Approximating the I\/O Complexity of One-Shot Red-Blue Pebbling. In SPAA '16. ACM, 161--163."},{"key":"e_1_3_2_2_24_1","unstructured":"Ceph. 2016. Ceph Erasure Code. https:\/\/docs.ceph.com\/en\/latest\/rados\/operations\/erasure-code\/  Ceph. 2016. Ceph Erasure Code. https:\/\/docs.ceph.com\/en\/latest\/rados\/operations\/erasure-code\/"},{"key":"e_1_3_2_2_25_1","volume-title":"98--105","author":"Chaitin G. J.","year":"1982","unstructured":"G. J. Chaitin . 1982. Register Allocation & Spilling via Graph Coloring . ( 1982 ), 98--105 . G. J. Chaitin. 1982. Register Allocation & Spilling via Graph Coloring. (1982), 98--105."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/2245737.2245881"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.850116"},{"key":"e_1_3_2_2_28_1","volume-title":"Tile Size Selection Using Cache Organization and Data Layout. In PLDI '95","author":"Coleman S.","unstructured":"S. Coleman and K. S. McKinley . 1995 . Tile Size Selection Using Cache Organization and Data Layout. In PLDI '95 . ACM, 279--290. S. Coleman and K. S. McKinley. 1995. Tile Size Selection Using Cache Organization and Data Layout. In PLDI '95. ACM, 279--290."},{"key":"e_1_3_2_2_29_1","volume-title":"Comparing cost and performance of replication and erasure coding. CoRR abs\/1308.1887","author":"Cook J.","year":"2013","unstructured":"J. Cook , R. Primmer , and A. de Kwant . 2013. Comparing cost and performance of replication and erasure coding. CoRR abs\/1308.1887 ( 2013 ). http:\/\/arxiv.org\/abs\/1308.1887 J. Cook, R. Primmer, and A. de Kwant. 2013. Comparing cost and performance of replication and erasure coding. CoRR abs\/1308.1887 (2013). http:\/\/arxiv.org\/abs\/1308.1887"},{"key":"e_1_3_2_2_30_1","volume-title":"The Complexity of Theorem-Proving Procedures. In STOC '71","author":"Cook S. A.","year":"1971","unstructured":"S. A. Cook . 1971 . The Complexity of Theorem-Proving Procedures. In STOC '71 . ACM, 151--158. S. A. Cook. 1971. The Complexity of Theorem-Proving Procedures. In STOC '71. ACM, 151--158."},{"key":"e_1_3_2_2_31_1","volume-title":"Row-Diagonal Parity for Double Disk Failure Correction. In FAST '04","author":"Corbett P.","unstructured":"P. Corbett , B. English , A. Goel , T. Grcanac , S. Kleiman , J. Leong , and S. Sankar . 2004 . Row-Diagonal Parity for Double Disk Failure Correction. In FAST '04 . USENIX Association. P. Corbett, B. English, A. Goel, T. Grcanac, S. Kleiman, J. Leong, and S. Sankar. 2004. Row-Diagonal Parity for Double Disk Failure Correction. In FAST '04. USENIX Association."},{"key":"e_1_3_2_2_32_1","volume-title":"ICFP '07","author":"Coutts D.","unstructured":"D. Coutts , R. Leshchinskiy , and D. Stewart . 2007. Stream Fusion: From Lists to Streams to Nothing at All . In ICFP '07 . ACM, 315--326. D. Coutts, R. Leshchinskiy, and D. Stewart. 2007. Stream Fusion: From Lists to Streams to Nothing at All. In ICFP '07. ACM, 315--326."},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/115372.115320"},{"key":"e_1_3_2_2_34_1","volume-title":"WADS '07","author":"Demaine E. D.","unstructured":"E. D. Demaine and Q. C. Liu . 2017. Inapproximability of the Standard Pebble Game and Hard to Pebble Graphs . In WADS '07 . Springer, 313--324. E. D. Demaine and Q. C. Liu. 2017. Inapproximability of the Standard Pebble Game and Hard to Pebble Graphs. In WADS '07. Springer, 313--324."},{"key":"e_1_3_2_2_35_1","volume-title":"SPAA '18","author":"Demaine E. D.","unstructured":"E. D. Demaine and Q. C. Liu . 2018. Red-Blue Pebble Game: Complexity of Computing the Trade-Off between Cache Size and Memory Transfers . In SPAA '18 . ACM, 195--204. E. D. Demaine and Q. C. Liu. 2018. Red-Blue Pebble Game: Complexity of Computing the Trade-Off between Cache Size and Memory Transfers. In SPAA '18. ACM, 195--204."},{"key":"e_1_3_2_2_36_1","first-page":"8","article-title":"On Programming of Arithmetic","volume":"1","author":"Ershov A. P.","year":"1958","unstructured":"A. P. Ershov . 1958 . On Programming of Arithmetic Operations. Commun. ACM 1 , 8 (Aug. 1958), 3--6. A. P. Ershov. 1958. On Programming of Arithmetic Operations. Commun. ACM 1, 8 (Aug. 1958), 3--6.","journal-title":"Operations. Commun. ACM"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2000.1095"},{"key":"e_1_3_2_2_38_1","unstructured":"A. Fog. 2021. The microarchitecture of Intel AMD and VIA CPUs. https:\/\/www.agner.org\/optimize\/microarchitecture.pdf  A. Fog. 2021. The microarchitecture of Intel AMD and VIA CPUs. https:\/\/www.agner.org\/optimize\/microarchitecture.pdf"},{"key":"e_1_3_2_2_39_1","unstructured":"M. R. Garey and D. S. Johnson. 1979. Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co.  M. R. Garey and D. S. Johnson. 1979. Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co."},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/229542.229546"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/165180.165214"},{"key":"e_1_3_2_2_42_1","volume-title":"Processor Microarchitecture: An Implementation Perspective","author":"Gonz\u00e1lez A.","year":"2010","unstructured":"A. Gonz\u00e1lez , F. Latorre , and G. Magklis . 2010 . Processor Microarchitecture: An Implementation Perspective . Morgan & Claypool Publishers . A. Gonz\u00e1lez, F. Latorre, and G. Magklis. 2010. Processor Microarchitecture: An Implementation Perspective. Morgan & Claypool Publishers."},{"key":"e_1_3_2_2_43_1","volume-title":"CC '07","author":"Grund D.","unstructured":"D. Grund and S. Hack . 2007. A Fast Cutting-Plane Algorithm for Optimal Coalescing . In CC '07 . Springer, 111--125. D. Grund and S. Hack. 2007. A Fast Cutting-Plane Algorithm for Optimal Coalescing. In CC '07. Springer, 111--125."},{"key":"e_1_3_2_2_44_1","volume-title":"Register Allocation for Programs in SSA-Form. In CC '06","author":"Hack S.","unstructured":"S. Hack , D. Grund , and G. Goos . 2006 . Register Allocation for Programs in SSA-Form. In CC '06 . Springer, 247--262. S. Hack, D. Grund, and G. Goos. 2006. Register Allocation for Programs in SSA-Form. In CC '06. Springer, 247--262."},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/MM.2014.10"},{"key":"e_1_3_2_2_46_1","unstructured":"J. L. Hennessy and D. A. Patterson. 2017. Computer Architecture Sixth Edition: A Quantitative Approach (6th ed.). Morgan Kaufmann Publishers Inc.  J. L. Hennessy and D. A. Patterson. 2017. Computer Architecture Sixth Edition: A Quantitative Approach (6th ed.). Morgan Kaufmann Publishers Inc."},{"key":"e_1_3_2_2_47_1","volume-title":"STOC '81","author":"Hong J-W.","unstructured":"J-W. Hong and H. T. Kung . 1981. I\/O Complexity: The Red-Blue Pebble Game . In STOC '81 . ACM, 326--333. J-W. Hong and H. T. Kung. 1981. I\/O Complexity: The Red-Blue Pebble Game. In STOC '81. ACM, 326--333."},{"key":"e_1_3_2_2_48_1","volume-title":"On Optimizing XOR-Based Codes for Fault-Tolerant Storage Applications. In ITW '07","author":"Huang C.","unstructured":"C. Huang , J. Li , and M. Chen . 2007 . On Optimizing XOR-Based Codes for Fault-Tolerant Storage Applications. In ITW '07 . 218--223. C. Huang, J. Li, and M. Chen. 2007. On Optimizing XOR-Based Codes for Fault-Tolerant Storage Applications. In ITW '07. 218--223."},{"key":"e_1_3_2_2_49_1","volume-title":"Erasure Coding in Windows Azure Storage. In USENIX ATC'12","author":"Huang C.","unstructured":"C. Huang , H. Simitci , Y. Xu , A. Ogus , B. Calder , P. Gopalan , J. Li , and S. Yekhanin . 2012 . Erasure Coding in Windows Azure Storage. In USENIX ATC'12 . USENIX. C. Huang, H. Simitci, Y. Xu, A. Ogus, B. Calder, P. Gopalan, J. Li, and S. Yekhanin. 2012. Erasure Coding in Windows Azure Storage. In USENIX ATC'12. USENIX."},{"key":"e_1_3_2_2_50_1","unstructured":"C. Huang and L. Xu. 2003. Fast software implementation of finite field operations. Technical Report. Washington University.  C. Huang and L. Xu. 2003. Fast software implementation of finite field operations. Technical Report. Washington University."},{"key":"e_1_3_2_2_51_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2007.70830"},{"key":"e_1_3_2_2_52_1","unstructured":"Intel. [n.d.]. Intelligent Storage Acceleration Library. https:\/\/github.com\/intel\/isa-l\/  Intel. [n.d.]. Intelligent Storage Acceleration Library. https:\/\/github.com\/intel\/isa-l\/"},{"key":"e_1_3_2_2_53_1","unstructured":"Intel. [n.d.]. Intelligent Storage Acceleration Library (version 2.30.0). https:\/\/github.com\/intel\/isa-l\/releases\/tag\/v2.30.0  Intel. [n.d.]. Intelligent Storage Acceleration Library (version 2.30.0) . https:\/\/github.com\/intel\/isa-l\/releases\/tag\/v2.30.0"},{"key":"e_1_3_2_2_54_1","unstructured":"Intel. 2017. ISA-L performance report. https:\/\/01.org\/intel%C2%AE-storage-acceleration-library-open-source-version\/documentation\/documentation  Intel. 2017. ISA-L performance report. https:\/\/01.org\/intel%C2%AE-storage-acceleration-library-open-source-version\/documentation\/documentation"},{"key":"e_1_3_2_2_55_1","unstructured":"Intel. 2020. Intel 64 and IA-32 architectures optimization reference manual. https:\/\/software.intel.com\/content\/www\/us\/en\/develop\/articles\/intel-sdm.html  Intel. 2020. Intel 64 and IA-32 architectures optimization reference manual. https:\/\/software.intel.com\/content\/www\/us\/en\/develop\/articles\/intel-sdm.html"},{"key":"e_1_3_2_2_56_1","unstructured":"Intel. 2021. Intel Architecture Instruction Set Extensions Programming Reference. https:\/\/software.intel.com\/content\/www\/us\/en\/develop\/download\/intel-architecture-instruction-set-extensions-programming-reference.html  Intel. 2021. Intel Architecture Instruction Set Extensions Programming Reference. https:\/\/software.intel.com\/content\/www\/us\/en\/develop\/download\/intel-architecture-instruction-set-extensions-programming-reference.html"},{"key":"e_1_3_2_2_57_1","volume-title":"Accelerating Galois Field Arithmetic for Reed-Solomon Erasure Codes in Storage Applications. In CLUSTER '11","author":"Kalcher S.","unstructured":"S. Kalcher and V. Lindenstruth . 2011 . Accelerating Galois Field Arithmetic for Reed-Solomon Erasure Codes in Storage Applications. In CLUSTER '11 . 290--298. S. Kalcher and V. Lindenstruth. 2011. Accelerating Galois Field Arithmetic for Reed-Solomon Erasure Codes in Storage Applications. In CLUSTER '11. 290--298."},{"key":"e_1_3_2_2_58_1","volume-title":"Reducibility among Combinatorial Problems","author":"Karp Richard M.","unstructured":"Richard M. Karp . 1972. Reducibility among Combinatorial Problems . Springer , 85--103. Richard M. Karp. 1972. Reducibility among Combinatorial Problems. Springer, 85--103."},{"key":"e_1_3_2_2_59_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008208521515"},{"key":"e_1_3_2_2_60_1","doi-asserted-by":"publisher","DOI":"10.46586\/tosc.v2017.i4.188-211"},{"key":"e_1_3_2_2_61_1","doi-asserted-by":"crossref","unstructured":"G. Kwasniewski M. Kabi\u0107 M. Besta J. VandeVondele R. Solc\u00e0 and T. Hoefler. 2019. Red-Blue Pebbling Revisited: Near Optimal Parallel Matrix-Matrix Multiplication. In SC' 19. ACM Article 24.  G. Kwasniewski M. Kabi\u0107 M. Besta J. VandeVondele R. Solc\u00e0 and T. Hoefler. 2019. Red-Blue Pebbling Revisited: Near Optimal Parallel Matrix-Matrix Multiplication. In SC' 19. ACM Article 24.","DOI":"10.1145\/3295500.3356181"},{"key":"e_1_3_2_2_62_1","volume-title":"Powers of Tensors and Fast Matrix Multiplication. In ISSAC '14","author":"Gall F. L.","year":"2014","unstructured":"F. L. Gall . 2014 . Powers of Tensors and Fast Matrix Multiplication. In ISSAC '14 . ACM, 296--303. F. L. Gall. 2014. Powers of Tensors and Fast Matrix Multiplication. In ISSAC '14. ACM, 296--303."},{"key":"e_1_3_2_2_63_1","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2004.833807"},{"key":"e_1_3_2_2_64_1","volume-title":"The Cache Performance and Optimizations of Blocked Algorithms. In ASPLOS '91","author":"Lam M. D.","unstructured":"M. D. Lam , E. E. Rothberg , and M. E. Wolf . 1991 . The Cache Performance and Optimizations of Blocked Algorithms. In ASPLOS '91 . ACM, 63--74. M. D. Lam, E. E. Rothberg, and M. E. Wolf. 1991. The Cache Performance and Optimizations of Blocked Algorithms. In ASPLOS '91. ACM, 63--74."},{"key":"e_1_3_2_2_65_1","volume-title":"Introduction to Linear Algebra","author":"Lang S.","unstructured":"S. Lang . 1986. Introduction to Linear Algebra . Springer . S. Lang. 1986. Introduction to Linear Algebra. Springer."},{"key":"e_1_3_2_2_67_1","volume-title":"DCC'99","author":"Larsson N. J.","unstructured":"N. J. Larsson and A. Moffat . 1999. Offline dictionary-based compression . In DCC'99 . 296--305. N. J. Larsson and A. Moffat. 1999. Offline dictionary-based compression. In DCC'99. 296--305."},{"key":"e_1_3_2_2_68_1","doi-asserted-by":"publisher","DOI":"10.1145\/2133382.2133384"},{"key":"e_1_3_2_2_69_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(80)90136-2"},{"key":"e_1_3_2_2_70_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511755279"},{"key":"e_1_3_2_2_71_1","doi-asserted-by":"publisher","DOI":"10.1145\/7921.11325"},{"key":"e_1_3_2_2_72_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2013.23"},{"key":"e_1_3_2_2_73_1","unstructured":"F. MacWilliams and N. Sloane. 1977. The Theory of Error-Correcting Codes. Elsevier.  F. MacWilliams and N. Sloane. 1977. The Theory of Error-Correcting Codes. Elsevier."},{"key":"e_1_3_2_2_74_1","volume-title":"Applied Algebra, Algebraic Algorithms and Error-Correcting Codes","author":"Mastrovito E. D.","unstructured":"E. D. Mastrovito . 1989. VLSI designs for multiplication over finite fields GF(2m) . In Applied Algebra, Algebraic Algorithms and Error-Correcting Codes . Springer , 297--309. E. D. Mastrovito. 1989. VLSI designs for multiplication over finite fields GF(2m). In Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. Springer, 297--309."},{"key":"e_1_3_2_2_75_1","volume-title":"Advanced Compiler Design and Implementation","author":"Muchnick S.","unstructured":"S. Muchnick . 1998. Advanced Compiler Design and Implementation . Morgan Kaufmann Publishers Inc . S. Muchnick. 1998. Advanced Compiler Design and Implementation. Morgan Kaufmann Publishers Inc."},{"key":"e_1_3_2_2_76_1","first-page":"8","article-title":"On Compiling Algorithms for Arithmetic","volume":"10","author":"Nakata I.","year":"1967","unstructured":"I. Nakata . 1967 . On Compiling Algorithms for Arithmetic Expressions. Commun. ACM 10 , 8 (Aug. 1967), 492--494. I. Nakata. 1967. On Compiling Algorithms for Arithmetic Expressions. Commun. ACM 10, 8 (Aug. 1967), 492--494.","journal-title":"Expressions. Commun. ACM"},{"key":"e_1_3_2_2_77_1","first-page":"11","article-title":"The Quantcast File System","volume":"6","author":"Ovsiannikov M.","year":"2013","unstructured":"M. Ovsiannikov , S. Rus , D. Reeves , P. Sutter , S. Rao , and J. Kelly . 2013 . The Quantcast File System . VLDB Endow. 6 , 11 (Aug. 2013), 1092--1101. M. Ovsiannikov, S. Rus, D. Reeves, P. Sutter, S. Rao, and J. Kelly. 2013. The Quantcast File System. VLDB Endow. 6, 11 (Aug. 2013), 1092--1101.","journal-title":"VLDB Endow."},{"key":"e_1_3_2_2_78_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.1997.613165"},{"key":"e_1_3_2_2_79_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.752655"},{"key":"e_1_3_2_2_80_1","volume-title":"On the Hardness of Red-Blue Pebble Games. In SPAA '20","author":"Papp P. A.","unstructured":"P. A. Papp and R. Wattenhofer . 2020 . On the Hardness of Red-Blue Pebble Games. In SPAA '20 . ACM, 419--429. P. A. Papp and R. Wattenhofer. 2020. On the Hardness of Red-Blue Pebble Games. In SPAA '20. ACM, 419--429."},{"key":"e_1_3_2_2_81_1","volume-title":"Register Allocation Via Coloring of Chordal Graphs. In APLAS '05","author":"Pereira F. M. Q.","unstructured":"F. M. Q. Pereira and J. Palsberg . 2005 . Register Allocation Via Coloring of Chordal Graphs. In APLAS '05 . Springer, 315--329. F. M. Q. Pereira and J. Palsberg. 2005. Register Allocation Via Coloring of Chordal Graphs. In APLAS '05. Springer, 315--329."},{"key":"e_1_3_2_2_82_1","volume-title":"FAST '08","author":"Plank J.","year":"2008","unstructured":"J. Plank . 2008 . The RAID-6 liberation codes . In FAST '08 . 97--110. J. Plank. 2008. The RAID-6 liberation codes. In FAST '08. 97--110."},{"key":"e_1_3_2_2_83_1","volume-title":"Screaming Fast Galois Field Arithmetic Using Intel SIMD Extensions. In FAST'13","author":"Plank J.","unstructured":"J. Plank , K. Greenan , and E. L. Miller . 2013 . Screaming Fast Galois Field Arithmetic Using Intel SIMD Extensions. In FAST'13 . J. Plank, K. Greenan, and E. L. Miller. 2013. Screaming Fast Galois Field Arithmetic Using Intel SIMD Extensions. In FAST'13."},{"key":"e_1_3_2_2_84_1","doi-asserted-by":"publisher","DOI":"10.1137\/0108018"},{"key":"e_1_3_2_2_85_1","doi-asserted-by":"publisher","DOI":"10.46586\/tches.v2018.i2.298-336"},{"key":"e_1_3_2_2_86_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-49051-7_12"},{"key":"e_1_3_2_2_87_1","volume-title":"Global Value Numbers and Redundant Computations. In POPL '88","author":"Rosen B. K.","unstructured":"B. K. Rosen , M. N. Wegman , and F. K. Zadeck . 1988 . Global Value Numbers and Redundant Computations. In POPL '88 . ACM, 12--27. B. K. Rosen, M. N. Wegman, and F. K. Zadeck. 1988. Global Value Numbers and Redundant Computations. In POPL '88. ACM, 12--27."},{"key":"e_1_3_2_2_88_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0030842"},{"key":"e_1_3_2_2_89_1","volume-title":"On the number of registers needed to evaluate arithmetic expressions. BIT Numerical Mathematics 11, 1 (01","author":"Schneider V.","year":"1971","unstructured":"V. Schneider . 1971. On the number of registers needed to evaluate arithmetic expressions. BIT Numerical Mathematics 11, 1 (01 Mar 1971 ), 84--93. V. Schneider. 1971. On the number of registers needed to evaluate arithmetic expressions. BIT Numerical Mathematics 11, 1 (01 Mar 1971), 84--93."},{"key":"e_1_3_2_2_90_1","volume-title":"Complete Register Allocation Problems. In STOC '73","author":"Sethi R.","year":"1973","unstructured":"R. Sethi . 1973 . Complete Register Allocation Problems. In STOC '73 . ACM, 182--195. R. Sethi. 1973. Complete Register Allocation Problems. In STOC '73. ACM, 182--195."},{"key":"e_1_3_2_2_91_1","doi-asserted-by":"publisher","DOI":"10.1137\/0204020"},{"key":"e_1_3_2_2_92_1","doi-asserted-by":"publisher","DOI":"10.1145\/321607.321620"},{"key":"e_1_3_2_2_93_1","unstructured":"A. Shenoy. 2015. The Pros and Cons of Developing Erasure Coding and Replication Instead of Traditional RAID in Next-Generation Storage Platforms. (2015). https:\/\/www.snia.org\/educational-library\/pros-and-cons-developing-erasure-coding-and-replication-instead-traditional-raid SDC '15.  A. Shenoy. 2015. The Pros and Cons of Developing Erasure Coding and Replication Instead of Traditional RAID in Next-Generation Storage Platforms. (2015). https:\/\/www.snia.org\/educational-library\/pros-and-cons-developing-erasure-coding-and-replication-instead-traditional-raid SDC '15."},{"key":"e_1_3_2_2_94_1","volume-title":"Linear Algebra","author":"Shilov G.E.","unstructured":"G.E. Shilov . 1977. Linear Algebra . Dover Publications, Inc. G.E. Shilov. 1977. Linear Algebra. Dover Publications, Inc."},{"key":"e_1_3_2_2_95_1","volume-title":"Optimizing S-Box Implementations for Several Criteria Using SAT Solvers. In FSE '16","author":"Stoffelen K.","year":"2016","unstructured":"K. Stoffelen . 2016 . Optimizing S-Box Implementations for Several Criteria Using SAT Solvers. In FSE '16 . Springer, 140--160. K. Stoffelen. 2016. Optimizing S-Box Implementations for Several Criteria Using SAT Solvers. In FSE '16. Springer, 140--160."},{"key":"e_1_3_2_2_96_1","volume-title":"Shortcut Deforestation in Calculational Form. In FPCA '95","author":"Takano A.","unstructured":"A. Takano and E. Meijer . 1995 . Shortcut Deforestation in Calculational Form. In FPCA '95 . ACM, 306--313. A. Takano and E. Meijer. 1995. Shortcut Deforestation in Calculational Form. In FPCA '95. ACM, 306--313."},{"key":"e_1_3_2_2_97_1","doi-asserted-by":"publisher","DOI":"10.46586\/tches.v2020.i1.203-230"},{"key":"e_1_3_2_2_98_1","doi-asserted-by":"crossref","unstructured":"Y. Uezato. 2021. Accelerating XOR-based Erasure Coding using Program Optimization Techniques. arXiv:2108.02692 [cs.PL]  Y. Uezato. 2021. Accelerating XOR-based Erasure Coding using Program Optimization Techniques. arXiv:2108.02692 [cs.PL]","DOI":"10.1145\/3458817.3476204"},{"key":"e_1_3_2_2_99_1","unstructured":"Y. Uezato. 2021. Author's Github Repository. https:\/\/github.com\/yuezato\/xorslp_ec  Y. Uezato. 2021. Author's Github Repository. https:\/\/github.com\/yuezato\/xorslp_ec"},{"key":"e_1_3_2_2_100_1","doi-asserted-by":"publisher","DOI":"10.1145\/99370.99404"},{"key":"e_1_3_2_2_101_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(90)90147-A"},{"key":"e_1_3_2_2_102_1","volume-title":"Erasure Coding Vs. Replication: A Quantitative Comparison. In IPTPS '01","author":"Weatherspoon H.","unstructured":"H. Weatherspoon and J. Kubiatowicz . 2002 . Erasure Coding Vs. Replication: A Quantitative Comparison. In IPTPS '01 . Springer, 328--338. H. Weatherspoon and J. Kubiatowicz. 2002. Erasure Coding Vs. Replication: A Quantitative Comparison. In IPTPS '01. Springer, 328--338."},{"key":"e_1_3_2_2_103_1","volume-title":"PLDI '03","author":"Yotov K.","unstructured":"K. Yotov , X. Li , G. Ren , M. Cibulskis , G. DeJong , M. Garzaran , D. Padua , K. Pingali , P. Stodghill , and P. Wu . 2003. A Comparison of Empirical and Model-Driven Optimization . In PLDI '03 . ACM, 63--76. K. Yotov, X. Li, G. Ren, M. Cibulskis, G. DeJong, M. Garzaran, D. Padua, K. Pingali, P. Stodghill, and P. Wu. 2003. A Comparison of Empirical and Model-Driven Optimization. In PLDI '03. ACM, 63--76."},{"key":"e_1_3_2_2_104_1","doi-asserted-by":"publisher","DOI":"10.1145\/3375554"}],"event":{"name":"SC '21: The International Conference for High Performance Computing, Networking, Storage and Analysis","location":"St. Louis Missouri","acronym":"SC '21","sponsor":["SIGHPC ACM Special Interest Group on High Performance Computing, Special Interest Group on High Performance Computing","IEEE CS"]},"container-title":["Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3458817.3476204","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3458817.3476204","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:12:21Z","timestamp":1750191141000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3458817.3476204"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,13]]},"references-count":103,"alternative-id":["10.1145\/3458817.3476204","10.1145\/3458817"],"URL":"https:\/\/doi.org\/10.1145\/3458817.3476204","relation":{},"subject":[],"published":{"date-parts":[[2021,11,13]]},"assertion":[{"value":"2021-11-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}