{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:44:34Z","timestamp":1740123874368,"version":"3.37.3"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,11,15]],"date-time":"2019-11-15T00:00:00Z","timestamp":1573776000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,11,15]],"date-time":"2019-11-15T00:00:00Z","timestamp":1573776000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61772216","61821003"],"award-info":[{"award-number":["61772216","61821003"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U1705261"],"award-info":[{"award-number":["U1705261"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int J Parallel Prog"],"published-print":{"date-parts":[[2020,2]]},"DOI":"10.1007\/s10766-019-00651-0","type":"journal-article","created":{"date-parts":[[2019,11,15]],"date-time":"2019-11-15T21:02:41Z","timestamp":1573851761000},"page":"98-118","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["CSMqGraph: Coarse-Grained and Multi-external-storage Multi-queue I\/O Management for Graph Computing"],"prefix":"10.1007","volume":"48","author":[{"given":"Shuo","family":"Chen","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7798-1121","authenticated-orcid":false,"given":"Zhan","family":"Shi","sequence":"additional","affiliation":[]},{"given":"Dan","family":"Feng","sequence":"additional","affiliation":[]},{"given":"Shang","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Fang","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Lei","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Ruili","family":"Yu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,15]]},"reference":[{"key":"651_CR1","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: 2016 IEEE 32nd International Conference on Data Engineering (ICDE), pp. 409\u2013420. IEEE (2016)","DOI":"10.1109\/ICDE.2016.7498258"},{"issue":"3","key":"651_CR2","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1145\/971617.971643","volume":"47","author":"T Coffman","year":"2004","unstructured":"Coffman, T., Greenblatt, S., Marcus, S.: Graph-based technologies for intelligence analysis. Commun. ACM 47(3), 45\u201347 (2004)","journal-title":"Commun. ACM"},{"issue":"8","key":"651_CR3","doi-asserted-by":"publisher","first-page":"1311","DOI":"10.1093\/bioinformatics\/bti167","volume":"21","author":"A Del Sol","year":"2005","unstructured":"Del Sol, A., Fujihashi, H., O\u2019Meara, P.: Topology of small-world networks of protein-protein complex structures. Bioinformatics 21(8), 1311\u20131315 (2005)","journal-title":"Bioinformatics"},{"key":"651_CR4","doi-asserted-by":"crossref","unstructured":"Doerr, C., Blenn, N.: Metric convergence in social network sampling. In: Proceedings of the 5th ACM Workshop on HotPlanet, pp. 45\u201350. ACM (2013)","DOI":"10.1145\/2491159.2491168"},{"key":"651_CR5","unstructured":"Gonzalez, J.E., Low, Y., Gu, H., Bickson, D., Guestrin, C.: Powergraph: distributed graph-parallel computation on natural graphs. In: Presented as part of the 10th $$\\{$$USENIX$$\\}$$ Symposium on Operating Systems Design and Implementation ($$\\{$$OSDI$$\\}$$ 12), pp. 17\u201330 (2012)"},{"key":"651_CR6","unstructured":"Gonzalez, J.E., Xin, R.S., Dave, A., Crankshaw, D., Franklin, M.J., Stoica, I.: Graphx: graph processing in a distributed dataflow framework. In: 11th $$\\{$$USENIX$$\\}$$ Symposium on Operating Systems Design and Implementation ($$\\{$$OSDI$$\\}$$ 14), pp. 599\u2013613 (2014)"},{"issue":"6749","key":"651_CR7","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1038\/43604","volume":"401","author":"BA Huberman","year":"1999","unstructured":"Huberman, B.A., Adamic, L.A.: Internet: growth dynamics of the world-wide web. Nature 401(6749), 131 (1999)","journal-title":"Nature"},{"issue":"6833","key":"651_CR8","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1038\/35075138","volume":"411","author":"H Jeong","year":"2001","unstructured":"Jeong, H., Mason, S.P., Barab\u00e1si, A.L., Oltvai, Z.N.: Lethality and centrality in protein networks. Nature 411(6833), 41 (2001)","journal-title":"Nature"},{"issue":"6804","key":"651_CR9","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1038\/35036627","volume":"407","author":"H Jeong","year":"2000","unstructured":"Jeong, H., Tombor, B., Albert, R., Oltvai, Z.N., Barab\u00e1si, A.L.: The large-scale organization of metabolic networks. Nature 407(6804), 651 (2000)","journal-title":"Nature"},{"key":"651_CR10","doi-asserted-by":"crossref","unstructured":"Kang, U., Tsourakakis, C.E., Faloutsos, C.: Pegasus: a peta-scale graph mining system implementation and observations. In: Proceedings of the 2009 Ninth IEEE International Conference on Data Mining, pp. 229\u2013238. Washington, DC, USA (2009)","DOI":"10.1109\/ICDM.2009.14"},{"key":"651_CR11","doi-asserted-by":"publisher","unstructured":"Khayyat, Z., Awara, K., Alonazi, A., Jamjoom, H., Williams, D., Kalnis, P.: Mizan: a system for dynamic load balancing in large-scale graph processing. In: Proceedings of the 8th ACM European Conference on Computer Systems, EuroSys \u201913, pp. 169\u2013182. ACM, New York, NY, USA (2013). https:\/\/doi.org\/10.1145\/2465351.2465369","DOI":"10.1145\/2465351.2465369"},{"key":"651_CR12","doi-asserted-by":"crossref","unstructured":"Kumar, P., Huang, H.H.: G-store: high-performance graph store for trillion-edge processing. In: SC\u201916: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, pp. 830\u2013841. IEEE (2016)","DOI":"10.1109\/SC.2016.70"},{"key":"651_CR13","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, pp. 591\u2013600. ACM (2010)","DOI":"10.1145\/1772690.1772751"},{"key":"651_CR14","unstructured":"Kyrola, A., Blelloch, G., Guestrin, C.: Graphchi: large-scale graph computation on just a $$\\{$$PC$$\\}$$. In: Presented as part of the 10th $$\\{$$USENIX$$\\}$$ Symposium on Operating Systems Design and Implementation ($$\\{$$OSDI$$\\}$$ 12), pp. 31\u201346 (2012)"},{"key":"651_CR15","doi-asserted-by":"crossref","unstructured":"Lee, E.K., Katz, R.H.: An analytic performance model of disk arrays. In: ACM SIGMETRICS Performance Evaluation Review, vol.\u00a021, pp. 98\u2013109. ACM (1993)","DOI":"10.1145\/166962.166994"},{"key":"651_CR16","unstructured":"Liu, H., Huang, H.H.: Graphene: fine-grained IO management for graph computing. In: 15th USENIX Conference on File and Storage Technologies (FAST 17), pp. 285\u2013300. USENIX Association, Santa Clara, CA (2017). https:\/\/www.usenix.org\/conference\/fast17\/technical-sessions\/presentation\/liu"},{"key":"651_CR17","doi-asserted-by":"crossref","unstructured":"Malewicz, G., Austern, M.H., Bik, A.J., Dehnert, J.C., Horn, I., Leiser, N., Czajkowski, G.: Pregel: a system for large-scale graph processing. In: Proceedings of the 2010 ACM SIGMOD International Conference on Management of data, pp. 135\u2013146. ACM (2010)","DOI":"10.1145\/1807167.1807184"},{"key":"651_CR18","doi-asserted-by":"publisher","unstructured":"Nguyen, D., Lenharth, A., Pingali, K.: A lightweight infrastructure for graph analytics. In: Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles, SOSP \u201913, pp. 456\u2013471. ACM, New York, NY, USA (2013). https:\/\/doi.org\/10.1145\/2517349.2522739","DOI":"10.1145\/2517349.2522739"},{"key":"651_CR19","doi-asserted-by":"crossref","unstructured":"Randles, M., Lamb, D., Taleb-Bendiab, A.: A comparative study into distributed load balancing algorithms for cloud computing. In: 2010 IEEE 24th International Conference on Advanced Information Networking and Applications Workshops, pp. 551\u2013556. IEEE (2010)","DOI":"10.1109\/WAINA.2010.85"},{"key":"651_CR20","doi-asserted-by":"crossref","unstructured":"Roy, A., Bindschaedler, L., Malicevic, J., Zwaenepoel, W.: Chaos: scale-out graph processing from secondary storage. In: Proceedings of the 25th Symposium on Operating Systems Principles, pp. 410\u2013424. ACM (2015)","DOI":"10.1145\/2815400.2815408"},{"key":"651_CR21","doi-asserted-by":"crossref","unstructured":"Roy, A., Mihailovic, I., Zwaenepoel, W.: X-stream: edge-centric graph processing using streaming partitions. In: Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles, pp. 472\u2013488. ACM (2013)","DOI":"10.1145\/2517349.2522740"},{"key":"651_CR22","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0196-6774(82)90008-6","volume":"3","author":"Y Shiloach","year":"1982","unstructured":"Shiloach, Y., Vishkin, U.: An o(log n) parallel connectivity algorithm. J. Algorithms 3, 57\u201367 (1982)","journal-title":"J. Algorithms"},{"key":"651_CR23","doi-asserted-by":"crossref","unstructured":"Shun, J., Blelloch, G.E.: Ligra: a lightweight graph processing framework for shared memory. In: ACM Sigplan Notices, vol.\u00a048, pp. 135\u2013146. ACM (2013)","DOI":"10.1145\/2517327.2442530"},{"key":"#cr-split#-651_CR24.1","unstructured":"Vora, K., Xu, G., Gupta, R.: Load the edges you need: a generic i\/o optimization for disk-based graph processing. In: 2016 $$\\{$$USENIX$$\\}$$ Annual Technical Conference ($$\\{$$USENIX$$\\}$$"},{"key":"#cr-split#-651_CR24.2","doi-asserted-by":"crossref","unstructured":"$$\\{$$ATC$$\\}$$ 16), pp. 507-522 (2016)","DOI":"10.1515\/cmam-2016-0011"},{"key":"651_CR25","doi-asserted-by":"crossref","unstructured":"Wang, P., Zhang, K., Chen, R., Chen, H., Guan, H.: Replication-based fault-tolerance for large-scale graph processing. In: 2014 44th Annual IEEE\/IFIP International Conference on Dependable Systems and Networks, pp. 562\u2013573. IEEE (2014)","DOI":"10.1109\/DSN.2014.58"},{"key":"651_CR26","doi-asserted-by":"crossref","unstructured":"Wang, Z., Gu, Y., Bao, Y., Yu, G., Yu, J.X.: Hybrid pulling\/pushing for i\/o-efficient distributed and iterative graph computing. In: Proceedings of the 2016 International Conference on Management of Data, pp. 479\u2013494. ACM (2016)","DOI":"10.1145\/2882903.2882938"},{"key":"651_CR27","doi-asserted-by":"crossref","unstructured":"Zhao, Y., Yoshigoe, K., Xie, M., Zhou, S., Seker, R., Bian, J.: Lightgraph: lighten communication in distributed graph-parallel processing. In: 2014 IEEE International Congress on Big Data, pp. 717\u2013724. IEEE (2014)","DOI":"10.1109\/BigData.Congress.2014.106"},{"key":"651_CR28","doi-asserted-by":"crossref","unstructured":"Zheng, D., Burns, R., Szalay, A.S.: Toward millions of file system iops on low-cost, commodity hardware. In: SC\u201913: Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis, pp. 1\u201312. IEEE (2013)","DOI":"10.1145\/2503210.2503225"},{"key":"651_CR29","unstructured":"Zheng, D., Mhembere, D., Burns, R., Vogelstein, J., Priebe, C.E., Szalay, A.S.: Flashgraph: processing billion-node graphs on an array of commodity ssds. In: 13th $$\\{$$USENIX$$\\}$$ Conference on File and Storage Technologies ($$\\{$$FAST$$\\}$$ 15), pp. 45\u201358 (2015)"},{"key":"#cr-split#-651_CR30.1","unstructured":"Zhu, X., Han, W., Chen, W.: Gridgraph: large-scale graph processing on a single machine using 2-level hierarchical partitioning. In: 2015 $$\\{$$USENIX$$\\}$$ Annual Technical Conference ($$\\{$$USENIX$$\\}$$"},{"key":"#cr-split#-651_CR30.2","doi-asserted-by":"crossref","unstructured":"$$\\{$$ATC$$\\}$$ 15), pp. 375-386 (2015)","DOI":"10.4414\/pc-d.2015.01147"}],"container-title":["International Journal of Parallel Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10766-019-00651-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10766-019-00651-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10766-019-00651-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,5]],"date-time":"2022-10-05T18:42:27Z","timestamp":1664995347000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10766-019-00651-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,15]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,2]]}},"alternative-id":["651"],"URL":"https:\/\/doi.org\/10.1007\/s10766-019-00651-0","relation":{},"ISSN":["0885-7458","1573-7640"],"issn-type":[{"type":"print","value":"0885-7458"},{"type":"electronic","value":"1573-7640"}],"subject":[],"published":{"date-parts":[[2019,11,15]]},"assertion":[{"value":"11 August 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 November 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 November 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}