{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T01:46:40Z","timestamp":1773193600455,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":42,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,11,17]],"date-time":"2019-11-17T00:00:00Z","timestamp":1573948800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1619253"],"award-info":[{"award-number":["1619253"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000015","name":"U.S. Department of Energy","doi-asserted-by":"publisher","award":["DE-AC02-06CH11357"],"award-info":[{"award-number":["DE-AC02-06CH11357"]}],"id":[{"id":"10.13039\/100000015","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,11,17]]},"DOI":"10.1145\/3295500.3356195","type":"proceedings-article","created":{"date-parts":[[2019,11,7]],"date-time":"2019-11-07T19:43:22Z","timestamp":1573155802000},"page":"1-17","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["FT-iSort"],"prefix":"10.1145","author":[{"given":"Sihuan","family":"Li","sequence":"first","affiliation":[{"name":"University of California"}]},{"given":"Hongbo","family":"Li","sequence":"additional","affiliation":[{"name":"University of California"}]},{"given":"Xin","family":"Liang","sequence":"additional","affiliation":[{"name":"University of California"}]},{"given":"Jieyang","family":"Chen","sequence":"additional","affiliation":[{"name":"Oak Ridge National Laboratory"}]},{"given":"Elisabeth","family":"Giem","sequence":"additional","affiliation":[{"name":"University of California"}]},{"given":"Kaiming","family":"Ouyang","sequence":"additional","affiliation":[{"name":"University of California"}]},{"given":"Kai","family":"Zhao","sequence":"additional","affiliation":[{"name":"University of California"}]},{"given":"Sheng","family":"Di","sequence":"additional","affiliation":[{"name":"Argonne National Laboratory"}]},{"given":"Franck","family":"Cappello","sequence":"additional","affiliation":[{"name":"Argonne National Laboratory"}]},{"given":"Zizhong","family":"Chen","sequence":"additional","affiliation":[{"name":"University of California"}]}],"member":"320","published-online":{"date-parts":[[2019,11,17]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"d.]. Bebop. ([n. d.]). Retrieved","year":"2019","unstructured":"[n. d.]. Bebop. ([n. d.]). Retrieved August 16, 2019 from https:\/\/www.lcrc.anl.gov\/systems\/resources\/bebop\/ [n. d.]. Bebop. ([n. d.]). Retrieved August 16, 2019 from https:\/\/www.lcrc.anl.gov\/systems\/resources\/bebop\/"},{"key":"e_1_3_2_1_2_1","volume-title":"Retrieved","year":"2019","unstructured":"[n. d.]. Soft error. ([n. d.]) . Retrieved August 16, 2019 from https:\/\/en.wikipedia.org\/wiki\/Soft_error [n. d.]. Soft error. ([n. d.]). Retrieved August 16, 2019 from https:\/\/en.wikipedia.org\/wiki\/Soft_error"},{"key":"e_1_3_2_1_3_1","volume-title":"Retrieved","year":"2019","unstructured":"[n. d.]. Top 10 Algorithms. ([n. d.]) . Retrieved August 16, 2019 from https:\/\/cs.gmu.edu\/~henryh\/483\/top-10.html [n. d.]. Top 10 Algorithms. ([n. d.]). Retrieved August 16, 2019 from https:\/\/cs.gmu.edu\/~henryh\/483\/top-10.html"},{"key":"e_1_3_2_1_4_1","volume-title":"Retrieved","year":"2019","unstructured":"[n. d.]. Triple Modular Redundancy. ([n. d.]) . Retrieved August 16, 2019 from https:\/\/en.wikipedia.org\/wiki\/Triple_modular_redundancy [n. d.]. Triple Modular Redundancy. ([n. d.]). Retrieved August 16, 2019 from https:\/\/en.wikipedia.org\/wiki\/Triple_modular_redundancy"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548304006297"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/FSCS.1990.89546"},{"key":"e_1_3_2_1_7_1","volume-title":"Programming pearls","author":"Bentley Jon","unstructured":"Jon Bentley . 2016. Programming pearls . Addison-Wesley Professional , 110. Jon Bentley. 2016. Programming pearls. Addison-Wesley Professional, 110."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380231105"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/781498.781513"},{"key":"e_1_3_2_1_10_1","volume-title":"Toward exascale resilience: 2014 update. Supercomputing frontiers and innovations 1, 1","author":"Cappello Franck","year":"2014","unstructured":"Franck Cappello , Al Geist , William Gropp , Sanjay Kale , Bill Kramer , and Marc Snir . 2014. Toward exascale resilience: 2014 update. Supercomputing frontiers and innovations 1, 1 ( 2014 ), 5--28. Franck Cappello, Al Geist, William Gropp, Sanjay Kale, Bill Kramer, and Marc Snir. 2014. Toward exascale resilience: 2014 update. Supercomputing frontiers and innovations 1, 1 (2014), 5--28."},{"key":"e_1_3_2_1_11_1","volume-title":"Proceedings of the International Conference for High Performance Computing, Networking, Storage, and Analysis. IEEE Press, 68","author":"Chen Jieyang","year":"2018","unstructured":"Jieyang Chen , Hongbo Li , Sihuan Li , Xin Liang , Panruo Wu , Dingwen Tao , Kaiming Ouyang , Yuanlai Liu , Kai Zhao , Qiang Guan , 2018 . Fault tolerant onesided matrix decompositions on heterogeneous systems with gpus . In Proceedings of the International Conference for High Performance Computing, Networking, Storage, and Analysis. IEEE Press, 68 . Jieyang Chen, Hongbo Li, Sihuan Li, Xin Liang, Panruo Wu, Dingwen Tao, Kaiming Ouyang, Yuanlai Liu, Kai Zhao, Qiang Guan, et al. 2018. Fault tolerant onesided matrix decompositions on heterogeneous systems with gpus. In Proceedings of the International Conference for High Performance Computing, Networking, Storage, and Analysis. IEEE Press, 68."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/NAS.2016.7549404"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2016.81"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1654059.1654089"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2442516.2442533"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/359024.359026"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/11841036_68"},{"key":"e_1_3_2_1_18_1","volume-title":"International Colloquium on Automata, Languages, and Programming","author":"Finocchi Irene","unstructured":"Irene Finocchi , Fabrizio Grandoni , and Giuseppe F Italiano . 2006. Optimal resilient sorting and searching in the presence of memory faults . In International Colloquium on Automata, Languages, and Programming . Springer , 286--298. Irene Finocchi, Fabrizio Grandoni, and Giuseppe F Italiano. 2006. Optimal resilient sorting and searching in the presence of memory faults. In International Colloquium on Automata, Languages, and Programming. Springer, 286--298."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007375"},{"key":"e_1_3_2_1_20_1","first-page":"2","article-title":"How to kill a supercomputer: Dirty power, cosmic rays, and bad solder","volume":"10","author":"Geist Al","year":"2016","unstructured":"Al Geist . 2016 . How to kill a supercomputer: Dirty power, cosmic rays, and bad solder . IEEE Spectrum 10 (2016), 2 -- 3 . Al Geist. 2016. How to kill a supercomputer: Dirty power, cosmic rays, and bad solder. IEEE Spectrum 10 (2016), 2--3.","journal-title":"IEEE Spectrum"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSPEC.2016.7420396"},{"key":"e_1_3_2_1_22_1","first-page":"4","article-title":"Failure tolerance in petascale computers","volume":"3","author":"Gibson Garth","year":"2007","unstructured":"Garth Gibson , Bianca Schroeder , and Joan Digney . 2007 . Failure tolerance in petascale computers . CT Watch Quarterly 3 , 4 (2007), 4 -- 10 . Garth Gibson, Bianca Schroeder, and Joan Digney. 2007. Failure tolerance in petascale computers. CT Watch Quarterly 3, 4 (2007), 4--10.","journal-title":"CT Watch Quarterly"},{"key":"e_1_3_2_1_23_1","volume-title":"Algorithm-based fault tolerance for matrix operations","author":"Huang Kuang-Hua","year":"1984","unstructured":"Kuang-Hua Huang and Jacob A Abraham . 1984. Algorithm-based fault tolerance for matrix operations . IEEE transactions on computers 100, 6 ( 1984 ), 518--528. Kuang-Hua Huang and Jacob A Abraham. 1984. Algorithm-based fault tolerance for matrix operations. IEEE transactions on computers 100, 6 (1984), 518--528."},{"key":"e_1_3_2_1_24_1","volume-title":"Communication Efficient Checking of Big Data Operations. In 2018 IEEE International Parallel and Distributed Processing Symposium (IPDPS). IEEE, 650--659","author":"H\u00fcbschle-Schneider Lorenz","year":"2018","unstructured":"Lorenz H\u00fcbschle-Schneider and Peter Sanders . 2018 . Communication Efficient Checking of Big Data Operations. In 2018 IEEE International Parallel and Distributed Processing Symposium (IPDPS). IEEE, 650--659 . Lorenz H\u00fcbschle-Schneider and Peter Sanders. 2018. Communication Efficient Checking of Big Data Operations. In 2018 IEEE International Parallel and Distributed Processing Symposium (IPDPS). IEEE, 650--659."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.83656"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796305298"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2018.00016"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3126908.3126915"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.5555\/261387.261395"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00303-6"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.730527"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45655-4_47"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/CGO.2005.34"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2464996.2465442"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2503210.2503259"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2015.108"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2907294.2907306"},{"key":"e_1_3_2_1_38_1","volume-title":"Adventures of a Mathematician","author":"Ulam Stanislaw M","unstructured":"Stanislaw M Ulam . 1991. Adventures of a Mathematician . Univ of California Press , 281. Stanislaw M Ulam. 1991. Adventures of a Mathematician. Univ of California Press, 281."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/3018743.3018750"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/2133173.2133185"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2907294.2907315"},{"key":"e_1_3_2_1_42_1","volume-title":"Trends and Challenges: A Guide for Designing with Memory ICs","author":"Ziegler James F","unstructured":"James F Ziegler and Helmut Puchner . 2004. SER-history , Trends and Challenges: A Guide for Designing with Memory ICs . Cypress . James F Ziegler and Helmut Puchner. 2004. SER-history, Trends and Challenges: A Guide for Designing with Memory ICs. Cypress."}],"event":{"name":"SC '19: The International Conference for High Performance Computing, Networking, Storage, and Analysis","location":"Denver Colorado","acronym":"SC '19","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\/3295500.3356195","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3295500.3356195","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3295500.3356195","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:02:13Z","timestamp":1750208533000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3295500.3356195"}},"subtitle":["efficient fault tolerance for introsort"],"short-title":[],"issued":{"date-parts":[[2019,11,17]]},"references-count":42,"alternative-id":["10.1145\/3295500.3356195","10.1145\/3295500"],"URL":"https:\/\/doi.org\/10.1145\/3295500.3356195","relation":{},"subject":[],"published":{"date-parts":[[2019,11,17]]},"assertion":[{"value":"2019-11-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}