{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T10:06:25Z","timestamp":1742983585788,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031215131"},{"type":"electronic","value":"9783031215148"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-21514-8_37","type":"book-chapter","created":{"date-parts":[[2022,12,16]],"date-time":"2022-12-16T13:23:13Z","timestamp":1671196993000},"page":"453-467","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["CAR: Community Aware Graph Reordering for\u00a0Efficient Cache Utilization in\u00a0Graph Analytics"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1076-2434","authenticated-orcid":false,"given":"Shubham","family":"Singhania","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9444-5064","authenticated-orcid":false,"given":"Neelam","family":"Sharma","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9871-0638","authenticated-orcid":false,"given":"Varun","family":"Venkitaraman","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7237-5878","authenticated-orcid":false,"given":"Chandan Kumar","family":"Jha","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,12,17]]},"reference":[{"key":"37_CR1","doi-asserted-by":"crossref","unstructured":"Cuzzocrea, A., et al.: Big graph analytics: the state of the art and future research agenda. In: Proceedings of the 17th International Workshop on Data Warehousing and OLAP, pp. 99\u2013101 (2014)","DOI":"10.1145\/2666158.2668454"},{"key":"37_CR2","doi-asserted-by":"crossref","unstructured":"Beamer, S., et al.: Direction-optimizing breadth-first search. In: SC 2012: Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis, pp. 1\u201310. IEEE (2012)","DOI":"10.1109\/SC.2012.50"},{"issue":"1","key":"37_CR3","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., et al.: An O(logn) parallel connectivity algorithm. J. Algorithms 3(1), 57\u201367 (1982)","journal-title":"J. Algorithms"},{"key":"37_CR4","unstructured":"Beamer, S., et al.: The gap benchmark suite. arXiv preprint arXiv:1508.03619 (2015)"},{"key":"37_CR5","doi-asserted-by":"crossref","unstructured":"Balaji, V., et\u00a0al.: When is graph reordering an optimization? Studying the effect of lightweight graph reordering across applications and input graphs. In: 2018 IEEE International Symposium on Workload Characterization (IISWC), pp. 203\u2013214. IEEE (2018)","DOI":"10.1109\/IISWC.2018.8573478"},{"key":"37_CR6","doi-asserted-by":"crossref","unstructured":"Faldu, P., et\u00a0al.: A closer look at lightweight graph reordering. In: 2019 IEEE International Symposium on Workload Characterization (IISWC), pp. 1\u201313. IEEE (2019)","DOI":"10.1109\/IISWC47752.2019.9041948"},{"key":"37_CR7","doi-asserted-by":"crossref","unstructured":"Wei, H., et al.: Speedup graph processing by graph ordering. In: Proceedings of the 2016 International Conference on Management of Data, pp. 1813\u20131828 (2016)","DOI":"10.1145\/2882903.2915220"},{"key":"37_CR8","unstructured":"Leskovec, J., et al.: SNAP Datasets: Stanford large network dataset collection, June 2014. http:\/\/snap.stanford.edu\/data"},{"key":"37_CR9","doi-asserted-by":"crossref","unstructured":"Huang, B., et al.: Structure preserved graph reordering for fast graph processing without the pain. In: 2020 IEEE 22nd International Conference on High Performance Computing and Communications; IEEE 18th International Conference on Smart City; IEEE 6th International Conference on Data Science and Systems (HPCC\/SmartCity\/DSS), pp. 44\u201351. IEEE (2020)","DOI":"10.1109\/HPCC-SmartCity-DSS50907.2020.00007"},{"issue":"3","key":"37_CR10","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1023\/A:1011119519789","volume":"29","author":"J Mellor-Crummey","year":"2001","unstructured":"Mellor-Crummey, J., et al.: Improving memory hierarchy performance for irregular applications using data and computation reorderings. Int. J. Parallel Programm. 29(3), 217\u2013247 (2001)","journal-title":"Int. J. Parallel Programm."},{"key":"37_CR11","doi-asserted-by":"crossref","unstructured":"Yu, X. et al.: IMP: indirect memory prefetcher. In: Proceedings of the 48th International Symposium on Microarchitecture, pp. 178\u2013190 (2015)","DOI":"10.1145\/2830772.2830807"},{"key":"37_CR12","doi-asserted-by":"crossref","unstructured":"Faldu, P., et al.: Domain-specialized cache management for graph analytics. In: 2020 IEEE International Symposium on High Performance Computer Architecture (HPCA), pp. 234\u2013248. IEEE (2020)","DOI":"10.1109\/HPCA47549.2020.00028"},{"key":"37_CR13","doi-asserted-by":"crossref","unstructured":"Basak, A., et al.: Analysis and optimization of the memory hierarchy for graph processing workloads. In: 2019 IEEE International Symposium on High Performance Computer Architecture (HPCA), pp. 373\u2013386. IEEE (2019)","DOI":"10.1109\/HPCA.2019.00051"},{"key":"37_CR14","doi-asserted-by":"crossref","unstructured":"Balaji, V., et al.: P-OPT: practical optimal cache replacement for graph analytics. In: 2021 IEEE International Symposium on High-Performance Computer Architecture (HPCA), pp. 668\u2013681. IEEE (2021)","DOI":"10.1109\/HPCA51647.2021.00062"},{"key":"37_CR15","doi-asserted-by":"crossref","unstructured":"Sharma, N., et\u00a0al.: Data-aware cache management for graph analytics. In: 2022 Design, Automation and Test in Europe Conference and Exhibition (DATE), pp. 843\u2013848. IEEE (2022)","DOI":"10.23919\/DATE54114.2022.9774709"},{"key":"37_CR16","unstructured":"Intel VTune Profiler (2021). https:\/\/software.intel.com\/content\/www\/us\/en\/develop\/tools\/oneapi\/components\/vtune-profiler.html#gs.34axdf"},{"key":"37_CR17","doi-asserted-by":"crossref","unstructured":"Wu, C.-J., et al.: SHiP: signature-based hit predictor for high performance caching. In: Proceedings of the 44th Annual IEEE\/ACM International Symposium on Microarchitecture, pp. 430\u2013441 (2011)","DOI":"10.1145\/2155620.2155671"},{"key":"37_CR18","doi-asserted-by":"crossref","unstructured":"Jain, A., et al.: Back to the future: leveraging Belady\u2019s algorithm for improved cache replacement. In: 2016 ACM\/IEEE 43rd Annual International Symposium on Computer Architecture (ISCA), pp. 78\u201389. IEEE (2016)","DOI":"10.1109\/ISCA.2016.17"}],"container-title":["Communications in Computer and Information Science","VLSI Design and Test"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-21514-8_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,16]],"date-time":"2022-12-16T13:23:54Z","timestamp":1671197034000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-21514-8_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031215131","9783031215148"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-21514-8_37","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"17 December 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"VDAT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on VLSI Design and Test","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Jammu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 July 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 July 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"vdat2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iitjammu.ac.in\/vdat2022\/","order":11,"name":"conference_url","label":"Conference URL","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":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"220","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":"32","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":"16","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":"15% - 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":"4","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}