{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T23:50:58Z","timestamp":1782949858958,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,4,4]],"date-time":"2017-04-04T00:00:00Z","timestamp":1491264000000},"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":["CCF-1524852, CCF-1318103"],"award-info":[{"award-number":["CCF-1524852, CCF-1318103"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,4,4]]},"DOI":"10.1145\/3037697.3037747","type":"proceedings-article","created":{"date-parts":[[2017,4,5]],"date-time":"2017-04-05T08:47:40Z","timestamp":1491382060000},"page":"223-236","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":24,"title":["CoRAL"],"prefix":"10.1145","author":[{"given":"Keval","family":"Vora","sequence":"first","affiliation":[{"name":"University of California, Riverside, Riverside, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chen","family":"Tian","sequence":"additional","affiliation":[{"name":"Huawei US R&D Center, Santa Clara, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rajiv","family":"Gupta","sequence":"additional","affiliation":[{"name":"University of California, Riverside, Riverside, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ziang","family":"Hu","sequence":"additional","affiliation":[{"name":"Huawei US R&D Center, Santa Clara, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2017,4,4]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150412"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/988672.988752"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/214451.214456"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.14778\/2824032.2824077"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/568522.568525"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827502412875"},{"key":"e_1_3_2_1_7_1","first-page":"599","volume-title":"USENIX OSDI","author":"Gonzalez J. E.","year":"2014","unstructured":"J. E. Gonzalez , R. S. Xin , A. Dave , D. Crankshaw , M. J. Franklin , and I. Stoica . GraphX: Graph processing in a distributed dataflow framework . In USENIX OSDI , pages 599 -- 613 , 2014 . J. E. Gonzalez, R. S. Xin, A. Dave, D. Crankshaw, M. J. Franklin, and I. Stoica. GraphX: Graph processing in a distributed dataflow framework. In USENIX OSDI, pages 599--613, 2014."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.14778\/2777598.2777604"},{"key":"e_1_3_2_1_9_1","first-page":"27","volume-title":"PACT","author":"Fidel A.","year":"2014","unstructured":"Harshvardhan, A. Fidel , N. M. Amato , and L. Rauchwerger . Kla: A new algorithmic paradigm for parallel graph computations . In PACT , pages 27 -- 38 , New York, NY , 2014 . Harshvardhan, A. Fidel, N. M. Amato, and L. Rauchwerger. Kla: A new algorithmic paradigm for parallel graph computations. In PACT, pages 27--38, New York, NY, 2014."},{"key":"e_1_3_2_1_10_1","first-page":"11","volume-title":"USENIX ATC","author":"Hunt P.","year":"2010","unstructured":"P. Hunt , M. Konar , F. P. Junqueira , and B. Reed . Zookeeper: Wait-free coordination for internet-scale systems . In USENIX ATC , pages 11 -- 11 , Berkeley, CA , 2010 . P. Hunt, M. Konar, F. P. Junqueira, and B. Reed. Zookeeper: Wait-free coordination for internet-scale systems. In USENIX ATC, pages 11--11, Berkeley, CA, 2010."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772751"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.14778\/2212351.2212354"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.780865"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2043556.2043560"},{"key":"e_1_3_2_1_16_1","volume-title":"The PageRank citation ranking: Bringing order to the web. Technical report","author":"Page L.","year":"1998","unstructured":"L. Page , S. Brin , R. Motwani , and T. Winograd . The PageRank citation ranking: Bringing order to the web. Technical report , Stanford University , 1998 . L. Page, S. Brin, R. Motwani, and T. Winograd. The PageRank citation ranking: Bringing order to the web. Technical report, Stanford University, 1998."},{"key":"e_1_3_2_1_17_1","first-page":"293","volume-title":"USENIX OSDI","author":"Power R.","year":"2010","unstructured":"R. Power and J. Li . Piccolo: Building fast, distributed programs with partitioned tables . In USENIX OSDI , pages 293 -- 306 , Berkeley, CA, USA , 2010 . R. Power and J. Li. Piccolo: Building fast, distributed programs with partitioned tables. In USENIX OSDI, pages 293--306, Berkeley, CA, USA, 2010."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2806777.2806934"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484838.2484843"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2467799"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.14778\/2735496.2735506"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/79173.79181"},{"key":"e_1_3_2_1_23_1","first-page":"37","volume-title":"USENIX ATC","author":"Cui H.","year":"2014","unstructured":"H. Cui , J. Cipar , Q. Ho , J.K. Kim , S, Lee, A. Kumar , J. Wei , W. Dai , G.R. Ganger , P.B. Gibbons , G.A. Gibson , and E.P. Xing . Exploiting Bounded Staleness to Speed Up Big Data Analytics . In USENIX ATC , pages 37 -- 48 , 2014 . H. Cui, J. Cipar, Q. Ho, J.K. Kim, S, Lee, A. Kumar, J. Wei, W. Dai, G.R. Ganger, P.B. Gibbons, G.A. Gibson, and E.P. Xing. Exploiting Bounded Staleness to Speed Up Big Data Analytics. In USENIX ATC, pages 37--48, 2014."},{"key":"e_1_3_2_1_24_1","first-page":"507","volume-title":"USENIX ATC","author":"Vora K.","year":"2016","unstructured":"K. Vora , G. Xu , and R. Gupta . Load the Edges You Need: A Generic I\/O Optimization for Disk-based Graph Processing . In USENIX ATC , pages 507 -- 522 , 2016 . K. Vora, G. Xu, and R. Gupta. Load the Edges You Need: A Generic I\/O Optimization for Disk-based Graph Processing. In USENIX ATC, pages 507--522, 2016."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2660193.2660227"},{"key":"e_1_3_2_1_26_1","volume-title":"Conference on Innovative Data Systems Research (CIDR)","author":"Wang G.","year":"2013","unstructured":"G. Wang , W. Xie , A. Demers , and J. Gehrke . Asynchronous large-scale graph processing made easy . In Conference on Innovative Data Systems Research (CIDR) , 2013 . G. Wang, W. Xie, A. Demers, and J. Gehrke. Asynchronous large-scale graph processing made easy. In Conference on Innovative Data Systems Research (CIDR), 2013."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2014.58"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/361147.361115"},{"key":"e_1_3_2_1_29_1","first-page":"2","volume-title":"USENIX NSDI","author":"Zaharia M.","year":"2012","unstructured":"M. Zaharia , M. Chowdhury , T. Das , A. Dave , J. Ma , M. McCauley , M. J. Franklin , S. Shenker , and I. Stoica . Resilient distributed datasets: A fault-tolerant abstraction for in-memory cluster computing . In USENIX NSDI , pages 2 -- 2 , 2012 . M. Zaharia, M. Chowdhury, T. Das, A. Dave, J. Ma, M. McCauley, M. J. Franklin, S. Shenker, and I. Stoica. Resilient distributed datasets: A fault-tolerant abstraction for in-memory cluster computing. In USENIX NSDI, pages 2--2, 2012."},{"key":"e_1_3_2_1_30_1","unstructured":"ZeroMQ. http:\/\/zeromq.org\/.  ZeroMQ. http:\/\/zeromq.org\/."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2287036.2287041"}],"event":{"name":"ASPLOS '17: Architectural Support for Programming Languages and Operating Systems","location":"Xi'an China","acronym":"ASPLOS '17","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGOPS ACM Special Interest Group on Operating Systems","SIGARCH ACM Special Interest Group on Computer Architecture","SIGBED ACM Special Interest Group on Embedded Systems"]},"container-title":["Proceedings of the Twenty-Second International Conference on Architectural Support for Programming Languages and Operating Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3037697.3037747","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3037697.3037747","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3037697.3037747","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:03:11Z","timestamp":1750201391000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3037697.3037747"}},"subtitle":["Confined Recovery in Distributed Asynchronous Graph Processing"],"short-title":[],"issued":{"date-parts":[[2017,4,4]]},"references-count":31,"alternative-id":["10.1145\/3037697.3037747","10.1145\/3037697"],"URL":"https:\/\/doi.org\/10.1145\/3037697.3037747","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/3093336.3037747","asserted-by":"object"},{"id-type":"doi","id":"10.1145\/3093337.3037747","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2017,4,4]]},"assertion":[{"value":"2017-04-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}