{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T16:14:55Z","timestamp":1742919295290,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031545276"},{"type":"electronic","value":"9783031545283"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-54528-3_12","type":"book-chapter","created":{"date-parts":[[2024,2,22]],"date-time":"2024-02-22T07:06:29Z","timestamp":1708585589000},"page":"205-222","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["NPGraph: An Efficient Graph Computing Model in\u00a0NUMA-Based Persistent Memory Systems"],"prefix":"10.1007","author":[{"given":"Baoke","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cong","family":"Cao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fangfang","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuling","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Majing","family":"Su","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yanbing","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianhui","family":"Fu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,2,23]]},"reference":[{"key":"12_CR1","unstructured":"Kyrola, A., Blelloch, G., Guestrin, C.: GraphChi: large-scale graph computation on just a PC. In: OSDI\u201912, pp. 31\u201346 (2012)"},{"key":"12_CR2","doi-asserted-by":"publisher","unstructured":"Sun, P., Wen, Y., Ta, D., Xiao, X.: GraphMP: I\/O-efficient big graph analytics on a single commodity machine. IEEE Trans. Big Data, 2908384 (2019, to be published). https:\/\/doi.org\/10.1109\/TBDATA","DOI":"10.1109\/TBDATA"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Yang, M., Baghdadi, R., et al.: Graphit: a high-performance graph DSL, In: Proceedings of the ACM on Programming Languages, vol. 2, no. OOPSLA, p. 121 (2018)","DOI":"10.1145\/3276491"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Malewicz, G., et al.: Pregel: a system for large-scale graph computing. In: SIGMOD\u201910, pp. 135\u2013146 (2010)","DOI":"10.1145\/1807167.1807184"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Low, Y., et al.: Distributed GraphLab: a framework for machine learning in the cloud. Proc. VLDB Endow. 5(8) (2012)","DOI":"10.14778\/2212351.2212354"},{"key":"12_CR6","unstructured":"Gonzalez, J.E., Xin, R.S., et al.: GraphX: graph computing in a distributed dataflow system. In: OSDI\u201914, pp. 599\u2013613 (2014)"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Shun, J., Blelloch, G.E.: Ligra: a lightweight graph computing system for shared memory. ACM SIGPLAN Not. 48(8), 135\u2013146 (2013). ACM","DOI":"10.1145\/2517327.2442530"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Zhou, S.: Gemini: graph estimation with matrix variate normal instances. Ann. Stat. 42(2), 532\u2013562 (2014)","DOI":"10.1214\/13-AOS1187"},{"issue":"4","key":"12_CR9","first-page":"1","volume":"15","author":"P Kumar","year":"2020","unstructured":"Kumar, P., Huang, H.H.: Graphone: a data store for real-time analytics on evolving graphs. ACM Trans. Storage (TOS) 15(4), 1\u201340 (2020)","journal-title":"ACM Trans. Storage (TOS)"},{"key":"12_CR10","unstructured":"Gonzalez, J.E., et al.: PowerGraph: distributed graph-parallel computation on natural graphs. In: Usenix Conference on Operating Systems Design Implementation USENIX Association (2012)"},{"key":"12_CR11","unstructured":"https:\/\/www.intel.com\/content\/www\/us\/en\/architecture-and-technology\/optane-dc-persistent-memory.html"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Wang, R., et al.: XPGraph: XPline-friendly persistent memory graph stores for large-scale evolving graphs. In: 2022 55th IEEE\/ACM International Symposium on Microarchitecture (MICRO). IEEE (2022)","DOI":"10.1109\/MICRO56248.2022.00091"},{"key":"12_CR13","doi-asserted-by":"publisher","unstructured":"Liu, W., Liu, H., Liao, X., Jin, H., Zhang, Y.: Straggler-aware parallel graph processing in hybrid memory systems. In: IEEE\/ACM 21st International Symposium on Cluster, Cloud and Internet Computing (CCGrid). Melbourne, Australia, 2021, pp. 217\u2013226 (2021). https:\/\/doi.org\/10.1109\/CCGrid51090.2021.00031","DOI":"10.1109\/CCGrid51090.2021.00031"},{"issue":"8","key":"12_CR14","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1145\/2858788.2688507","volume":"50","author":"K Zhang","year":"2015","unstructured":"Zhang, K., Chen, R., Chen, H.: Numa-aware graph-structured analytics. ACM SIGPLAN Not. 50(8), 183\u2013193 (2015)","journal-title":"ACM SIGPLAN Not."},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Tian, Y., Balmin, A., Corsten, S.A., Tatikonda, S., McPherson, J.: From think like a vertex to think like a graph. Proc. VLDB Endow. 7(3), 193\u2013204 (2013)","DOI":"10.14778\/2732232.2732238"},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"Huang, T., et al.: HyVE: hybrid vertex-edge memory hierarchy for energy-efficient graph processing. In: 2018 Design, Automation Test in Europe Conference Exhibition (DATE). IEEE (2018)","DOI":"10.23919\/DATE.2018.8342150"},{"issue":"8","key":"12_CR17","doi-asserted-by":"publisher","first-page":"1304","DOI":"10.14778\/3389133.3389145","volume":"13","author":"G Gill","year":"2020","unstructured":"Gill, G., Dathathri, R., Hoang, L., et al.: Single machine graph analytics on massive datasets using Intel Optane DC persistent memory. Proc. VLDB Endow. 13(8), 1304\u20131318 (2020)","journal-title":"Proc. VLDB Endow."},{"key":"12_CR18","doi-asserted-by":"publisher","unstructured":"Liu, H., Liu, R., Liao, X., Jin, H., He, B., Zhang, Y.: Object-level memory allocation and migration in hybrid memory systems. IEEE Trans. Comput. 69(9), 1401\u20131413 (2020). https:\/\/doi.org\/10.1109\/TC.2020.2973134","DOI":"10.1109\/TC.2020.2973134"},{"key":"12_CR19","unstructured":"Vora, K.: Lumos: dependency-driven disk-based graph processing. In: USENIX ATC, pp. 429\u2013442 (2019)"},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"Dang, Z., et al.: Nvalloc: rethinking heap metadata management in persistent memory allocators. In: ACM ASPLOS, pp. 115\u2013127 (2022)","DOI":"10.1145\/3503222.3507743"},{"key":"12_CR21","unstructured":"Wang, Q., Lu, Y., Li, J., Shu, J.: Nap: a black-box approach to NUMA-aware persistent memory indexes. In: USENIX OSDI, pp. 93\u2013111 (2021)"},{"key":"12_CR22","unstructured":"http:\/\/snap.stanford.edu\/data\/ego-Facebook.html"},{"key":"12_CR23","doi-asserted-by":"crossref","unstructured":"Backstrom, L., Huttenlocher, D., Kleinberg, J., Lan, X.: Group formation in large social networks: membership, growth, and evolution. In: KDD\u201906, pp. 44\u201354 (2006)","DOI":"10.1145\/1150402.1150412"},{"key":"12_CR24","doi-asserted-by":"crossref","unstructured":"Kwak, H., Lee, C., Park, H., Moon, S.: What is Twitter, a social network or a news media. In: WWW\u201910, pp. 591\u2013600 (2010)","DOI":"10.1145\/1772690.1772751"},{"key":"12_CR25","unstructured":"Boldi, P., Vigna, S.: The webgraph system I: compression techniques. In: WWW\u201904, pp. 595\u2013602 (2004)"},{"key":"12_CR26","unstructured":"http:\/\/developer.yahoo.com\/blogs\/616566076523839488\/"},{"key":"12_CR27","doi-asserted-by":"publisher","unstructured":"Li, B., et al.: D2Graph: an efficient and unified out-of-core graph computing model. In: 2021 IEEE ISPA, pp. 193\u2013201 (2021). https:\/\/doi.org\/10.1109\/ISPA-BDCloud-SocialCom-SustainCom52081.2021.00038","DOI":"10.1109\/ISPA-BDCloud-SocialCom-SustainCom52081.2021.00038"},{"key":"12_CR28","doi-asserted-by":"crossref","unstructured":"Yu, J., et al.: DFOGraph: An I\/O and Communication-Efficient System for Distributed Fully-out-of-Core Graph Processing (2021)","DOI":"10.1145\/3437801.3441622"},{"key":"12_CR29","doi-asserted-by":"publisher","unstructured":"Liu, W., Liu, H., Liao, X., Jin, H., Zhang, Y: Straggler-aware parallel graph processing in hybrid memory systems. In: IEEE\/ACM 21st International Symposium on Cluster. Cloud and Internet Computing (CCGrid) 2021, pp. 217\u2013226 (2021). https:\/\/doi.org\/10.1109\/CCGrid51090.2021.00031","DOI":"10.1109\/CCGrid51090.2021.00031"},{"key":"12_CR30","doi-asserted-by":"publisher","unstructured":"Li, B., et al.: EPGraph: an efficient graph computing model in persistent memory system. In: 2022 IEEE ISPA, pp. 9\u201317 (2022). https:\/\/doi.org\/10.1109\/ISPA-BDCloud-SocialCom-SustainCom57177.2022.00009","DOI":"10.1109\/ISPA-BDCloud-SocialCom-SustainCom57177.2022.00009"}],"container-title":["Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","Collaborative Computing: Networking, Applications and Worksharing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-54528-3_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,22]],"date-time":"2024-02-22T07:24:19Z","timestamp":1708586659000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-54528-3_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031545276","9783031545283"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-54528-3_12","relation":{},"ISSN":["1867-8211","1867-822X"],"issn-type":[{"type":"print","value":"1867-8211"},{"type":"electronic","value":"1867-822X"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"23 February 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CollaborateCom","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Collaborative Computing: Networking, Applications and Worksharing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Corfu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 October 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 October 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"colcom2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Cony +","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"176","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"72","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}