{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,23]],"date-time":"2024-01-23T00:18:45Z","timestamp":1705969125685},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,1,22]],"date-time":"2024-01-22T00:00:00Z","timestamp":1705881600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,22]],"date-time":"2024-01-22T00:00:00Z","timestamp":1705881600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Front. Comput. Sci."],"published-print":{"date-parts":[[2024,6]]},"DOI":"10.1007\/s11704-023-2361-0","type":"journal-article","created":{"date-parts":[[2024,1,22]],"date-time":"2024-01-22T13:02:53Z","timestamp":1705928573000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A disk I\/O optimized system for concurrent graph processing jobs"],"prefix":"10.1007","volume":"18","author":[{"given":"Xianghao","family":"Xu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hong","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yongli","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dan","family":"Feng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peng","family":"Fang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,1,22]]},"reference":[{"key":"2361_CR1","doi-asserted-by":"crossref","unstructured":"Malewicz G, Austern M H, Bik A J C, Dehnert J C, Horn I, Leiser N, Czajkowski G. Pregel: a system for large-scale graph processing. In: Proceedings of 2010 ACM SIGMOD International Conference on Management of Data. 2010, 135\u2013146","DOI":"10.1145\/1807167.1807184"},{"issue":"8","key":"2361_CR2","doi-asserted-by":"publisher","first-page":"716","DOI":"10.14778\/2212351.2212354","volume":"5","author":"Y Low","year":"2012","unstructured":"Low Y, Bickson D, Gonzalez J, Guestrin C, Kyrola A, Hellerstein J M. Distributed GraphLab: a framework for machine learning and data mining in the cloud. Proceedings of the VLDB Endowment, 2012, 5(8): 716\u2013727","journal-title":"Proceedings of the VLDB Endowment"},{"key":"2361_CR3","unstructured":"Gonzalez J E, Low Y, Gu H, Bickson D, Guestrin C. PowerGraph: distributed graph-parallel computation on natural graphs. In: Proceedings of the 10th USENIX Conference on Operating Systems Design and Implementation. 2012, 17\u201330"},{"key":"2361_CR4","unstructured":"Zhu X, Chen W, Zheng W, Ma X. Gemini: a computation-centric distributed graph processing system. In: Proceedings of the 12th USENIX Conference on Operating Systems Design and Implementation. 2016, 301\u2013316"},{"key":"2361_CR5","unstructured":"Kyrola A, Blelloch G, Guestrin C. GraphChi: large-scale graph computation on just a PC. In: Proceedings of the 10th USENIX Conference on Operating Systems Design and Implementation. 2012, 31\u201346"},{"key":"2361_CR6","doi-asserted-by":"crossref","unstructured":"Roy A, Mihailovic I, Zwaenepoel W. X-stream: edge-centric graph processing using streaming partitions. In: Proceedings of the 24th ACM Symposium on Operating Systems Principles. 2013, 472\u2013488","DOI":"10.1145\/2517349.2522740"},{"key":"2361_CR7","unstructured":"Zhu X, Han W, Chen W. GridGraph: large-scale graph processing on a single machine using 2-level hierarchical partitioning. In: Proceedings of 2015 USENIX Conference on Usenix Annual Technical Conference. 2015, 375\u2013386"},{"key":"2361_CR8","unstructured":"Vora K. LUMOS: dependency-driven disk-based graph processing. In: Proceedings of 2019 USENIX Conference on Usenix Annual Technical Conference. 2019, 429\u2013442"},{"issue":"3","key":"2361_CR9","first-page":"13","volume":"5","author":"R Chen","year":"2019","unstructured":"Chen R, Shi J, Chen Y, Zang B, Guan H, Chen H. PowerLyra: differentiated graph computation and partitioning on skewed graphs. ACM Transactions on Parallel Computing, 2019, 5(3): 13","journal-title":"ACM Transactions on Parallel Computing"},{"issue":"5","key":"2361_CR10","doi-asserted-by":"publisher","first-page":"887","DOI":"10.1007\/s11704-018-6400-1","volume":"12","author":"Y Cheng","year":"2018","unstructured":"Cheng Y, Wang F, Jiang H, Hua Y, Feng D, Zhang L, Zhou J. A communication-reduced and computation-balanced framework for fast graph computation. Frontiers of Computer Science, 2018, 12(5): 887\u2013907","journal-title":"Frontiers of Computer Science"},{"key":"2361_CR11","unstructured":"Zhang Y, Liao X, Jin H, Gu L, He L, He B, Liu H. Cgraph: a correlations-aware approach for efficient concurrent iterative graph processing. In: Proceedings of 2018 USENIX Conference on Usenix Annual Technical Conference. 2018, 441\u2013452"},{"key":"2361_CR12","doi-asserted-by":"crossref","unstructured":"Xue J, Yang Z, Qu Z, Hou S, Dai Y. Seraph: an efficient, low-cost system for concurrent graph processing. In: Proceedings of the 23rd International Symposium on High-Performance Parallel and Distributed Computing. 2014, 227\u2013238","DOI":"10.1145\/2600212.2600222"},{"issue":"5","key":"2361_CR13","doi-asserted-by":"publisher","first-page":"876","DOI":"10.1109\/TC.2016.2618923","volume":"66","author":"J Xue","year":"2017","unstructured":"Xue J, Yang Z, Hou S, Dai Y. Processing concurrent graph analytics with decoupled computation model. IEEE Transactions on Computers, 2017, 66(5): 876\u2013890","journal-title":"IEEE Transactions on Computers"},{"key":"2361_CR14","doi-asserted-by":"crossref","unstructured":"Zhao J, Zhang Y, Liao X, He L, He B, Jin H, Liu H, Chen Y. GraphM: an efficient storage system for high throughput of concurrent graph processing. In: Proceedings of International Conference for High Performance Computing, Networking, Storage and Analysis. 2019, 3","DOI":"10.1145\/3295500.3356143"},{"key":"2361_CR15","doi-asserted-by":"crossref","unstructured":"Xu X, Wang F, Jiang H, Cheng Y, Feng D, Zhang Y, Fang P. GraphCP: an I\/O-efficient concurrent graph processing framework. In: Proceedings of the 29th IEEE\/ACM International Symposium on Quality of Service. 2021, 1\u201310","DOI":"10.1109\/IWQOS52092.2021.9521293"},{"key":"2361_CR16","unstructured":"Ai Z, Zhang M, Wu Y, Qian X, Chen K, Zheng W. Squeezing out all the value of loaded data: an out-of-core graph processing system with reduced disk I\/O. In: Proceedings of 2017 USENIX Conference on Usenix Annual Technical Conference. 2017, 125\u2013137"},{"issue":"12","key":"2361_CR17","doi-asserted-by":"publisher","first-page":"2094","DOI":"10.14778\/3352063.3352127","volume":"12","author":"R Zhu","year":"2019","unstructured":"Zhu R, Zhao K, Yang H, Lin W, Zhou C, Ai B, Li Y, Zhou J. AliGraph: a comprehensive graph neural network platform. Proceedings of the VLDB Endowment, 2019, 12(12): 2094\u20132105","journal-title":"Proceedings of the VLDB Endowment"},{"key":"2361_CR18","doi-asserted-by":"crossref","unstructured":"Maleki S, Nguyen D, Lenharth A, Garzar\u00e1n M, Padua D, Pingali K. DSMR: a parallel algorithm for single-source shortest path problem. In: Proceedings of 2016 International Conference on Supercomputing. 2016, 32","DOI":"10.1145\/2925426.2926287"},{"issue":"7","key":"2361_CR19","doi-asserted-by":"publisher","first-page":"1612","DOI":"10.1109\/TC.2021.3098976","volume":"71","author":"X Liao","year":"2022","unstructured":"Liao X, Zhao J, Zhang Y, He B, He L, Jin H, Gu L. A structure-aware storage optimization for out-of-core concurrent graph processing. IEEE Transactions on Computers, 2022, 71(7): 1612\u20131625","journal-title":"IEEE Transactions on Computers"},{"key":"2361_CR20","unstructured":"Liu H, Huang H H. Graphene: fine-grained IO management for graph computing. In: Proceedings of the 15th USENIX Conference on File and Storage Technologies. 2017, 285\u2013299"},{"key":"2361_CR21","doi-asserted-by":"crossref","unstructured":"Liu W, Liu H, Liao X, Jin H, Zhang Y. Straggler-aware parallel graph processing in hybrid memory systems. In: Proceedings of the 21st IEEE\/ACM International Symposium on Cluster, Cloud and Internet Computing. 2021, 217\u2013226","DOI":"10.1109\/CCGrid51090.2021.00031"},{"key":"2361_CR22","doi-asserted-by":"crossref","unstructured":"Agostini M, O\u2019Brien F, Abdelrahman T. Balancing graph processing workloads using work stealing on heterogeneous CPU-FPGA systems. In: Proceedings of the 49th International Conference on Parallel Processing. 2020, 50","DOI":"10.1145\/3404397.3404433"},{"issue":"8","key":"2361_CR23","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1145\/79173.79181","volume":"33","author":"L G Valiant","year":"1990","unstructured":"Valiant L G. A bridging model for parallel computation. Communications of the ACM, 1990, 33(8): 103\u2013111","journal-title":"Communications of the ACM"},{"key":"2361_CR24","doi-asserted-by":"crossref","unstructured":"Backstrom L, Huttenlocher D, Kleinberg J, Lan X. Group formation in large social networks: membership, growth, and evolution. In: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 2006, 44\u201354","DOI":"10.1145\/1150402.1150412"},{"key":"2361_CR25","doi-asserted-by":"crossref","unstructured":"Kwak H, Lee C, Park H, Moon S. What is twitter, a social network or a news media? In: Proceedings of the 19th International Conference on World Wide Web. 2010, 591\u2013600","DOI":"10.1145\/1772690.1772751"},{"key":"2361_CR26","doi-asserted-by":"crossref","unstructured":"Boldi P, Vigna S. The webgraph framework I: compression techniques. In: Proceedings of the 13th International Conference on World Wide Web. 2004, 595\u2013602","DOI":"10.1145\/988672.988752"},{"issue":"2","key":"2361_CR27","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1145\/1480506.1480511","volume":"42","author":"P Boldi","year":"2008","unstructured":"Boldi P, Santini M, Vigna S. A large time-aware web graph. ACM SIGIR Forum, 2008, 42(2): 33\u201338","journal-title":"ACM SIGIR Forum"},{"key":"2361_CR28","doi-asserted-by":"crossref","unstructured":"Zhou Z, Hoffmann H. GraphZ: improving the performance of large-scale graph analytics on small-scale machines. In: Proceedings of the 34th IEEE International Conference on Data Engineering. 2018, 1368\u20131371","DOI":"10.1109\/ICDE.2018.00152"},{"key":"2361_CR29","doi-asserted-by":"crossref","unstructured":"Chen H, Shen M, Xiao N, Lu Y. Krill: a compiler and runtime system for concurrent graph processing. In: Proceedings of International Conference for High Performance Computing, Networking, Storage and Analysis. 2021, 51","DOI":"10.1145\/3458817.3476159"},{"key":"2361_CR30","doi-asserted-by":"crossref","unstructured":"Cheng J, Liu Q, Li Z, Fan W, Lui J C S, He C. VENUS: vertex-centric streamlined graph computation on a single PC. In: Proceedings of the 31st IEEE International Conference on Data Engineering. 2015, 1131\u20131142","DOI":"10.1109\/ICDE.2015.7113362"},{"key":"2361_CR31","doi-asserted-by":"crossref","unstructured":"Chi Y, Dai G, Wang Y, Sun G, Li G, Yang H. NXgraph: an efficient graph processing system on a single machine. In: Proceedings of the 32nd IEEE International Conference on Data Engineering. 2016, 409\u2013420","DOI":"10.1109\/ICDE.2016.7498258"},{"key":"2361_CR32","unstructured":"Vora K, Xu G, Gupta R. Load the edges you need: a generic I\/O optimization for disk-based graph processing. In: Proceedings of 2016 USENIX Conference on Usenix Annual Technical Conference. 2016, 507\u2013522"},{"issue":"8","key":"2361_CR33","doi-asserted-by":"publisher","first-page":"1767","DOI":"10.1109\/TPDS.2020.2973143","volume":"31","author":"X Xu","year":"2020","unstructured":"Xu X, Wang F, Jiang H, Cheng Y, Feng D, Zhang Y. A hybrid update strategy for I\/O-efficient out-of-core graph processing. IEEE Transactions on Parallel and Distributed Systems, 2020, 31(8): 1767\u20131782","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"2361_CR34","doi-asserted-by":"crossref","unstructured":"Matam K K, Hashemi H, Annavaram M. MultilogVC: efficient out-of-core graph processing framework for flash storage. In: Proceedings of 2021 IEEE International Parallel and Distributed Processing Symposium. 2021, 245\u2013255","DOI":"10.1109\/IPDPS49936.2021.00033"},{"issue":"2","key":"2361_CR35","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1145\/3296957.3173208","volume":"53","author":"M Zhang","year":"2018","unstructured":"Zhang M, Wu Y, Zhuo Y, Qian X, Huan C, Chen K. Wonderland: a novel abstraction-based out-of-core graph processing system. ACM SIGPLAN Notices, 2018, 53(2): 608\u2013621","journal-title":"ACM SIGPLAN Notices"},{"key":"2361_CR36","doi-asserted-by":"crossref","unstructured":"Pan P, Li C. Congra: towards efficient processing of concurrent graph queries on shared-memory machines. In: Proceedings of 2017 IEEE International Conference on Computer Design. 2017, 217\u2013224","DOI":"10.1109\/ICCD.2017.40"},{"key":"2361_CR37","doi-asserted-by":"crossref","unstructured":"Zhou L, Chen R, Xia Y, Teodorescu R. C-graph: a highly efficient concurrent graph reachability query framework. In: Proceedings of the 47th International Conference on Parallel Processing. 2018, 79","DOI":"10.1145\/3225058.3225136"},{"key":"2361_CR38","doi-asserted-by":"crossref","unstructured":"Zhao J, Zhang Y, Liao X, He L, He B, Jin H, Liu H. LCCG: a locality-centric hardware accelerator for high throughput of concurrent graph processing. In: Proceedings of International Conference for High Performance Computing, Networking, Storage and Analysis. 2021, 45","DOI":"10.1145\/3458817.3480854"}],"container-title":["Frontiers of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-023-2361-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11704-023-2361-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-023-2361-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,22]],"date-time":"2024-01-22T13:18:24Z","timestamp":1705929504000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11704-023-2361-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1,22]]},"references-count":38,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["2361"],"URL":"https:\/\/doi.org\/10.1007\/s11704-023-2361-0","relation":{},"ISSN":["2095-2228","2095-2236"],"issn-type":[{"value":"2095-2228","type":"print"},{"value":"2095-2236","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,1,22]]},"assertion":[{"value":"16 June 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 February 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 January 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"183105"}}