{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T04:56:37Z","timestamp":1783572997944,"version":"3.55.0"},"reference-count":151,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2020,4,24]],"date-time":"2020-04-24T00:00:00Z","timestamp":1587686400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Marie Curie Actions for People COFUND program"},{"name":"ETH Zurich Postdoctoral Fellowship"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Reconfigurable Technol. Syst."],"published-print":{"date-parts":[[2020,6,30]]},"abstract":"<jats:p>\n            Developing high-performance and energy-efficient algorithms for maximum matchings is becoming increasingly important in social network analysis, computational sciences, scheduling, and others. In this work, we propose the first maximum matching algorithm designed for FPGAs; it is energy-efficient and has provable guarantees on accuracy, performance, and storage utilization. To achieve this, we forego popular graph processing paradigms, such as vertex-centric programming, that often entail large communication costs. Instead, we propose a\n            <jats:italic>substream-centric<\/jats:italic>\n            approach, in which the input stream of data is divided into substreams processed independently to enable more parallelism while lowering communication costs. We base our work on the\n            <jats:italic>theory of streaming graph algorithms<\/jats:italic>\n            and analyze 14 models and 28 algorithms. We use this analysis to provide theoretical underpinning that matches the physical constraints of FPGA platforms. Our algorithm delivers high performance (more than 4\u00d7 speedup over tuned parallel CPU variants), low memory, high accuracy, and effective usage of FPGA resources. The substream-centric approach could easily be extended to other algorithms to offer low-power and high-performance graph processing on FPGAs.\n          <\/jats:p>","DOI":"10.1145\/3377871","type":"journal-article","created":{"date-parts":[[2020,5,4]],"date-time":"2020-05-04T11:41:04Z","timestamp":1588592464000},"page":"1-33","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Substream-Centric Maximum Matchings on FPGA"],"prefix":"10.1145","volume":"13","author":[{"given":"Maciej","family":"Besta","sequence":"first","affiliation":[{"name":"Department of Computer Science, ETH Zurich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marc","family":"Fischer","sequence":"additional","affiliation":[{"name":"Department of Computer Science, ETH Zurich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tal","family":"Ben-Nun","sequence":"additional","affiliation":[{"name":"Department of Computer Science, ETH Zurich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dimitri","family":"Stanojevic","sequence":"additional","affiliation":[{"name":"Department of Computer Science, ETH Zurich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Johannes De Fine","family":"Licht","sequence":"additional","affiliation":[{"name":"Department of Computer Science, ETH Zurich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Torsten","family":"Hoefler","sequence":"additional","affiliation":[{"name":"Department of Computer Science, ETH Zurich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2020,4,24]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"10th DIMACS Challenge. 2011. Kronecker Generator Graphs.  10th DIMACS Challenge. 2011. Kronecker Generator Graphs."},{"key":"e_1_2_1_2_1","doi-asserted-by":"crossref","unstructured":"C. Aggarwal and K. Subbian. 2014. Evolutionary network analysis: A survey. CSUR.  C. Aggarwal and K. Subbian. 2014. Evolutionary network analysis: A survey. CSUR.","DOI":"10.1145\/2601412"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.48"},{"key":"e_1_2_1_4_1","first-page":"3","volume-title":"Proceedings of the 2006 27th IEEE International Real-Time Systems Symposium (RTSS\u201906)","author":"Agron J.","unstructured":"J. Agron , W. Peck , E. Anderson , D. Andrews , E. Komp , R. Sass , F. Baijot , and J. Stevens . 2006. Run-time services for hybrid CPU\/FPGA systems on chip . In Proceedings of the 2006 27th IEEE International Real-Time Systems Symposium (RTSS\u201906) . IEEE, pp. 3 -- 12 . J. Agron, W. Peck, E. Anderson, D. Andrews, E. Komp, R. Sass, F. Baijot, and J. Stevens. 2006. Run-time services for hybrid CPU\/FPGA systems on chip. In Proceedings of the 2006 27th IEEE International Real-Time Systems Symposium (RTSS\u201906). IEEE, pp. 3--12."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2872887.2750386"},{"key":"e_1_2_1_6_1","doi-asserted-by":"crossref","unstructured":"K. J. Ahn and S. Guha. 2011. Linear programming in the semi-streaming model with application to the maximum matching problem. In ICALP.  K. J. Ahn and S. Guha. 2011. Linear programming in the semi-streaming model with application to the maximum matching problem. In ICALP.","DOI":"10.1007\/978-3-642-22012-8_42"},{"key":"e_1_2_1_7_1","first-page":"459","volume-title":"Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM","author":"Ahn K. J.","unstructured":"K. J. Ahn , S. Guha , and A. McGregor . 2012. Analyzing graph structure via linear measurements . In Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM , pp. 459 -- 467 . K. J. Ahn, S. Guha, and A. McGregor. 2012. Analyzing graph structure via linear measurements. In Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, pp. 459--467."},{"key":"e_1_2_1_8_1","doi-asserted-by":"crossref","unstructured":"K. J. Ahn S. Guha and A. McGregor. 2012. Graph sketches: sparsification spanners and subgraphs. In PODS.  K. J. Ahn S. Guha and A. McGregor. 2012. Graph sketches: sparsification spanners and subgraphs. In PODS.","DOI":"10.1145\/2213556.2213560"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2004.1260732"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/MM.2004.36"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2012.v008a006"},{"key":"e_1_2_1_12_1","first-page":"1345","volume-title":"Proceedings of the 27th Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM","author":"Assadi S.","unstructured":"S. Assadi , S. Khanna , Y. Li , and G. Yaroslavtsev . 2016. Maximum matchings in dynamic graph streams and the simultaneous communication model . In Proceedings of the 27th Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM , pp. 1345 -- 1364 . S. Assadi, S. Khanna, Y. Li, and G. Yaroslavtsev. 2016. Maximum matchings in dynamic graph streams and the simultaneous communication model. In Proceedings of the 27th Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, pp. 1345--1364."},{"key":"e_1_2_1_13_1","first-page":"228","volume-title":"Proceedings of the 2014 IEEE International Parallel 8 Distributed Processing Symposium Workshops (IPDPSW). IEEE","author":"Attia O. G.","unstructured":"O. G. Attia , T. Johnson , K. Townsend , P. Jones , and J. Zambreno . 2014. Cygraph: A reconfigurable architecture for parallel breadth-first search . In Proceedings of the 2014 IEEE International Parallel 8 Distributed Processing Symposium Workshops (IPDPSW). IEEE , pp. 228 -- 235 . O. G. Attia, T. Johnson, K. Townsend, P. Jones, and J. Zambreno. 2014. Cygraph: A reconfigurable architecture for parallel breadth-first search. In Proceedings of the 2014 IEEE International Parallel 8 Distributed Processing Symposium Workshops (IPDPSW). IEEE, pp. 228--235."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/502102.502107"},{"key":"e_1_2_1_15_1","first-page":"1935","article-title":"Local ratio: A unified framework for approximation algorithms. In memoriam","author":"Bar-Yehuda R.","year":"2004","unstructured":"R. Bar-Yehuda , K. Bendel , A. Freund , and D. Rawitz . 2004 . Local ratio: A unified framework for approximation algorithms. In memoriam : Shimon Even 1935 - 2004 . ACM Computing Surveys (CSUR) 36, 4 (2004), 422--463. R. Bar-Yehuda, K. Bendel, A. Freund, and D. Rawitz. 2004. Local ratio: A unified framework for approximation algorithms. In memoriam: Shimon Even 1935-2004. ACM Computing Surveys (CSUR) 36, 4 (2004), 422--463.","journal-title":"Shimon Even"},{"key":"e_1_2_1_16_1","doi-asserted-by":"crossref","unstructured":"R. Bar-Yehuda and S. Even. 1985. A local-ratio theorem for approximating the weighted vertex cover problem. North-Holland Mathematics Studies 109 (1985) 27--45.  R. Bar-Yehuda and S. Even. 1985. A local-ratio theorem for approximating the weighted vertex cover problem. North-Holland Mathematics Studies 109 (1985) 27--45.","DOI":"10.1016\/S0304-0208(08)73101-3"},{"key":"e_1_2_1_17_1","doi-asserted-by":"crossref","unstructured":"T. Ben-Nun M. Besta S. Huber A. N. Ziogas D. Peter and T. Hoefler. 2019. A modular benchmarking infrastructure for high-performance and reproducible deep learning. arXiv preprint arXiv:1901.10183.  T. Ben-Nun M. Besta S. Huber A. N. Ziogas D. Peter and T. Hoefler. 2019. A modular benchmarking infrastructure for high-performance and reproducible deep learning. arXiv preprint arXiv:1901.10183.","DOI":"10.1109\/IPDPS.2019.00018"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3295500.3356182"},{"key":"e_1_2_1_19_1","volume-title":"Proceedings of the 27th ACM\/SIGDA International Symposium on Field-Programmable Gate Arrays (Feb.","author":"Besta M.","year":"2019","unstructured":"M. Besta , M. Fischer , T. Ben-Nun , J. D. F. Licht , and T. Hoefler . 2019. Substream-centric maximum matchings on FPGA. Feb. 2019 . In Proceedings of the 27th ACM\/SIGDA International Symposium on Field-Programmable Gate Arrays (Feb. 2019 ). M. Besta, M. Fischer, T. Ben-Nun, J. D. F. Licht, and T. Hoefler. 2019. Substream-centric maximum matchings on FPGA. Feb. 2019. In Proceedings of the 27th ACM\/SIGDA International Symposium on Field-Programmable Gate Arrays (Feb. 2019)."},{"key":"e_1_2_1_20_1","unstructured":"M. Besta M. Fischer V. Kalavri M. Kapralov and T. Hoefler. 2019. Practice of streaming and dynamic graphs: Concepts models systems and parallelism. arXiv preprint arXiv:1912.12740.  M. Besta M. Fischer V. Kalavri M. Kapralov and T. Hoefler. 2019. Practice of streaming and dynamic graphs: Concepts models systems and parallelism. arXiv preprint arXiv:1912.12740."},{"key":"e_1_2_1_21_1","first-page":"43","volume-title":"Proceedings of the 23rd International Conference on Architectural Support for Programming Languages and Operating Systems. ACM","author":"Besta M.","unstructured":"M. Besta , S. M. Hassan , S. Yalamanchili , R. Ausavarungnirun , O. Mutlu , and T. Hoefler . 2018. Slim noc: A low-diameter on-chip network topology for high energy efficiency and scalability . In Proceedings of the 23rd International Conference on Architectural Support for Programming Languages and Operating Systems. ACM , pp. 43 -- 55 . M. Besta, S. M. Hassan, S. Yalamanchili, R. Ausavarungnirun, O. Mutlu, and T. Hoefler. 2018. Slim noc: A low-diameter on-chip network topology for high energy efficiency and scalability. In Proceedings of the 23rd International Conference on Architectural Support for Programming Languages and Operating Systems. ACM, pp. 43--55."},{"key":"e_1_2_1_22_1","doi-asserted-by":"crossref","unstructured":"M. Besta and T. Hoefler. 2014. Fault tolerance for remote memory access programming models. In ACM HPDC. pp. 37--48.  M. Besta and T. Hoefler. 2014. Fault tolerance for remote memory access programming models. In ACM HPDC. pp. 37--48.","DOI":"10.1145\/2600212.2600224"},{"key":"e_1_2_1_23_1","first-page":"161","volume-title":"Proceedings of the 24th International Symposium on High-Performance Parallel and Distributed Computing. ACM","author":"Besta M.","unstructured":"M. Besta and T. Hoefler . 2015. Accelerating irregular computations with hardware transactional memory and active messages . In Proceedings of the 24th International Symposium on High-Performance Parallel and Distributed Computing. ACM , pp. 161 -- 172 . M. Besta and T. Hoefler. 2015. Accelerating irregular computations with hardware transactional memory and active messages. In Proceedings of the 24th International Symposium on High-Performance Parallel and Distributed Computing. ACM, pp. 161--172."},{"key":"e_1_2_1_24_1","doi-asserted-by":"crossref","unstructured":"M. Besta and T. Hoefler. 2015. Active access: A mechanism for high-performance distributed data-centric computations. In ACM ICS.  M. Besta and T. Hoefler. 2015. Active access: A mechanism for high-performance distributed data-centric computations. In ACM ICS.","DOI":"10.1145\/2751205.2751219"},{"key":"e_1_2_1_25_1","unstructured":"M. Besta and T. Hoefler. 2018. Survey and taxonomy of lossless graph compression and space-efficient graph representations. arXiv preprint arXiv:1806.01799.  M. Besta and T. Hoefler. 2018. Survey and taxonomy of lossless graph compression and space-efficient graph representations. arXiv preprint arXiv:1806.01799."},{"key":"e_1_2_1_26_1","doi-asserted-by":"crossref","unstructured":"M. Besta R. Kanakagiri H. Mustafa M. Karasikov G. R\u00e4tsch T. Hoefler and E. Solomonik. 2019. Communication-efficient Jaccard similarity for high-performance distributed genome comparisons. arXiv preprint arXiv:1911.04200.  M. Besta R. Kanakagiri H. Mustafa M. Karasikov G. R\u00e4tsch T. Hoefler and E. Solomonik. 2019. Communication-efficient Jaccard similarity for high-performance distributed genome comparisons. arXiv preprint arXiv:1911.04200.","DOI":"10.1109\/IPDPS47924.2020.00118"},{"key":"e_1_2_1_27_1","volume-title":"Proceedings of the IEEE IPDPS","volume":"17","author":"Besta M.","unstructured":"M. Besta , F. Marending , E. Solomonik , and T. Hoefler . 2017. Slimsell: A vectorizable graph representation for breadth-first search . In Proceedings of the IEEE IPDPS , volume 17 . M. Besta, F. Marending, E. Solomonik, and T. Hoefler. 2017. Slimsell: A vectorizable graph representation for breadth-first search. In Proceedings of the IEEE IPDPS, volume 17."},{"key":"e_1_2_1_28_1","unstructured":"M. Besta E. Peter R. Gerstenberger M. Fischer M. Podstawski C. Barthels G. Alonso and T. Hoefler. 2019. Demystifying graph databases: Analysis and taxonomy of data organization system designs and graph queries. arXiv preprint arXiv:1910.09017.  M. Besta E. Peter R. Gerstenberger M. Fischer M. Podstawski C. Barthels G. Alonso and T. Hoefler. 2019. Demystifying graph databases: Analysis and taxonomy of data organization system designs and graph queries. arXiv preprint arXiv:1910.09017."},{"key":"e_1_2_1_29_1","first-page":"93","volume-title":"Proceedings of the 26th International Symposium on High-Performance Parallel and Distributed Computing. ACM","author":"Besta M.","unstructured":"M. Besta , M. Podstawski , L. Groner , E. Solomonik , and T. Hoefler . 2017. To push or to pull: On reducing communication and synchronization in graph computations . In Proceedings of the 26th International Symposium on High-Performance Parallel and Distributed Computing. ACM , pp. 93 -- 104 . M. Besta, M. Podstawski, L. Groner, E. Solomonik, and T. Hoefler. 2017. To push or to pull: On reducing communication and synchronization in graph computations. In Proceedings of the 26th International Symposium on High-Performance Parallel and Distributed Computing. ACM, pp. 93--104."},{"key":"e_1_2_1_30_1","unstructured":"M. Besta D. Stanojevic J. D. F. Licht T. Ben-Nun and T. Hoefler. 2019. Graph processing on FPGAs: Taxonomy survey challenges. arXiv preprint arXiv:1903.06697.  M. Besta D. Stanojevic J. D. F. Licht T. Ben-Nun and T. Hoefler. 2019. Graph processing on FPGAs: Taxonomy survey challenges. arXiv preprint arXiv:1903.06697."},{"key":"e_1_2_1_31_1","first-page":"7","volume-title":"Proceedings of the 27th International Conference on Parallel Architectures and Compilation Techniques. ACM","author":"Besta M.","unstructured":"M. Besta , D. Stanojevic , T. Zivic , J. Singh , M. Hoerold , and T. Hoefler . 2018. Log (graph): A near-optimal high-performance graph representation . In Proceedings of the 27th International Conference on Parallel Architectures and Compilation Techniques. ACM , p. 7 . M. Besta, D. Stanojevic, T. Zivic, J. Singh, M. Hoerold, and T. Hoefler. 2018. Log (graph): A near-optimal high-performance graph representation. In Proceedings of the 27th International Conference on Parallel Architectures and Compilation Techniques. ACM, p. 7."},{"key":"e_1_2_1_32_1","doi-asserted-by":"crossref","unstructured":"B. Betkaoui D. B. Thomas W. Luk and N. Pothersrzulj. 2011. A framework for FPGA acceleration of large graph problems: Graphlet counting case study. In FPT.  B. Betkaoui D. B. Thomas W. Luk and N. Pothersrzulj. 2011. A framework for FPGA acceleration of large graph problems: Graphlet counting case study. In FPT.","DOI":"10.1109\/FPT.2011.6132667"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/FPL.2012.6339247"},{"key":"e_1_2_1_34_1","first-page":"8","volume-title":"Proceedings of the 2012 IEEE 23rd International Conference on Application-Specific Systems, Architectures and Processors (ASAP). IEEE","author":"Betkaoui B.","unstructured":"B. Betkaoui , Y. Wang , D. B. Thomas , and W. Luk . 2012. A reconfigurable computing approach for efficient and scalable parallel graph exploration . In Proceedings of the 2012 IEEE 23rd International Conference on Application-Specific Systems, Architectures and Processors (ASAP). IEEE , pp. 8 -- 15 . B. Betkaoui, Y. Wang, D. B. Thomas, and W. Luk. 2012. A reconfigurable computing approach for efficient and scalable parallel graph exploration. In Proceedings of the 2012 IEEE 23rd International Conference on Application-Specific Systems, Architectures and Processors (ASAP). IEEE, pp. 8--15."},{"key":"e_1_2_1_35_1","doi-asserted-by":"crossref","unstructured":"J. A. Bondy U. S. R. Murty etal 1976. In Graph Theory with Applications Vol. 290. Macmillan London.  J. A. Bondy U. S. R. Murty et al. 1976. In Graph Theory with Applications Vol. 290. Macmillan London.","DOI":"10.1007\/978-1-349-03521-2"},{"key":"e_1_2_1_36_1","doi-asserted-by":"crossref","unstructured":"L. S. Buriol G. Frahling S. Leonardi A. Marchetti-Spaccamela and C. Sohler. 2006. Counting triangles in data streams. In PODS.  L. S. Buriol G. Frahling S. Leonardi A. Marchetti-Spaccamela and C. Sohler. 2006. Counting triangles in data streams. In PODS.","DOI":"10.1145\/1142351.1142388"},{"key":"e_1_2_1_37_1","doi-asserted-by":"crossref","unstructured":"A. Chakrabarti G. Cormode and A. Mcgregor. 2009. Annotations in data streams. In ICALP.  A. Chakrabarti G. Cormode and A. Mcgregor. 2009. Annotations in data streams. In ICALP.","DOI":"10.1007\/978-3-642-02927-1_20"},{"key":"e_1_2_1_38_1","doi-asserted-by":"crossref","unstructured":"Y.-W. Chang J.-M. Lin and D. Wong. 1998. Graph matching-based algorithms for FPGA segmentation design. In ICCAD.  Y.-W. Chang J.-M. Lin and D. Wong. 1998. Graph matching-based algorithms for FPGA segmentation design. In ICCAD.","DOI":"10.1145\/288548.288557"},{"key":"e_1_2_1_39_1","doi-asserted-by":"crossref","unstructured":"A. Ching S. Edunov M. Kabiljo D. Logothetis and S. Muthukrishnan. 2015. One trillion edges: Graph processing at Facebook-scale. In VLDB.  A. Ching S. Edunov M. Kabiljo D. Logothetis and S. Muthukrishnan. 2015. One trillion edges: Graph processing at Facebook-scale. In VLDB.","DOI":"10.14778\/2824032.2824077"},{"key":"e_1_2_1_40_1","first-page":"1326","volume-title":"Proceedings of the 27th Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM","author":"Chitnis R.","unstructured":"R. Chitnis , G. Cormode , H. Esfandiari , M. Hajiaghayi , A. McGregor , M. Monemizadeh , and S. Vorotnikova . 2016. Kernelization via sampling with applications to finding matchings and related problems in dynamic graph streams . In Proceedings of the 27th Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM , pp. 1326 -- 1344 . R. Chitnis, G. Cormode, H. Esfandiari, M. Hajiaghayi, A. McGregor, M. Monemizadeh, and S. Vorotnikova. 2016. Kernelization via sampling with applications to finding matchings and related problems in dynamic graph streams. In Proceedings of the 27th Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, pp. 1326--1344."},{"key":"e_1_2_1_41_1","doi-asserted-by":"crossref","unstructured":"Y.-k. Choi J. Cong Z. Fang Y. Hao G. Reinman and P. Wei. 2016. A quantitative analysis on microarchitectures of modern CPU-FPGA platforms. In DAC.  Y.-k. Choi J. Cong Z. Fang Y. Hao G. Reinman and P. Wei. 2016. A quantitative analysis on microarchitectures of modern CPU-FPGA platforms. In DAC.","DOI":"10.1145\/2897937.2897972"},{"key":"e_1_2_1_42_1","volume-title":"Introduction to Algorithms","author":"Cormen T. H.","unstructured":"T. H. Cormen . 2009. Introduction to Algorithms . MIT press . T. H. Cormen. 2009. Introduction to Algorithms. MIT press."},{"key":"e_1_2_1_43_1","unstructured":"T. H. Cormen C. Stein R. L. Rivest and C. E. Leiserson. 2001. Introduction to Algorithms. McGraw-Hill Higher Education 2nd edition.  T. H. Cormen C. Stein R. L. Rivest and C. E. Leiserson. 2001. Introduction to Algorithms. McGraw-Hill Higher Education 2nd edition."},{"key":"e_1_2_1_44_1","unstructured":"G. Cormode J. Dark and C. Konrad. 2018. Independent sets in vertex-arrival streams. arXiv:1807.08331.  G. Cormode J. Dark and C. Konrad. 2018. Independent sets in vertex-arrival streams. arXiv:1807.08331."},{"key":"e_1_2_1_45_1","unstructured":"G. Cormode H. Jowhari M. Monemizadeh and S. Muthukrishnan. 2016. The sparse awakens: Streaming algorithms for matching size estimation in sparse graphs. arXiv preprint arXiv:1608.03118.  G. Cormode H. Jowhari M. Monemizadeh and S. Muthukrishnan. 2016. The sparse awakens: Streaming algorithms for matching size estimation in sparse graphs. arXiv preprint arXiv:1608.03118."},{"key":"e_1_2_1_46_1","unstructured":"M. Crouch and D. M. Stubbs. 2014. Improved streaming algorithms for weighted matching via unweighted matching. In LIPIcs-Leibniz Inf.  M. Crouch and D. M. Stubbs. 2014. Improved streaming algorithms for weighted matching via unweighted matching. In LIPIcs-Leibniz Inf."},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/2847263.2847339"},{"key":"e_1_2_1_48_1","doi-asserted-by":"crossref","unstructured":"G. Dai T. Huang Y. Chi N. Xu Y. Wang and H. Yang. 2017. ForeGraph: Exploring large-scale graph processing on multi-FPGA architecture. In FPGA.  G. Dai T. Huang Y. Chi N. Xu Y. Wang and H. Yang. 2017. ForeGraph: Exploring large-scale graph processing on multi-FPGA architecture. In FPGA.","DOI":"10.1145\/3020078.3021739"},{"key":"e_1_2_1_49_1","doi-asserted-by":"crossref","unstructured":"M. Datar A. Gionis P. Indyk and R. Motwani. 2002. Maintaining stream statistics over sliding windows. SIAM J. on Comp.  M. Datar A. Gionis P. Indyk and R. Motwani. 2002. Maintaining stream statistics over sliding windows. SIAM J. on Comp.","DOI":"10.1137\/S0097539701398363"},{"key":"e_1_2_1_50_1","unstructured":"J. de Fine Licht S. Meierhans and T. Hoefler. 2018. Transformations of high-level synthesis codes for high-performance computing. arXiv:1805.08288.  J. de Fine Licht S. Meierhans and T. Hoefler. 2018. Transformations of high-level synthesis codes for high-performance computing. arXiv:1805.08288."},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327492"},{"key":"e_1_2_1_52_1","doi-asserted-by":"crossref","unstructured":"C. Demetrescu I. Finocchi and A. Ribichini. 2009. Trading off space for passes in graph streaming problems. TALG.  C. Demetrescu I. Finocchi and A. Ribichini. 2009. Trading off space for passes in graph streaming problems. TALG.","DOI":"10.1145\/1644015.1644021"},{"key":"e_1_2_1_53_1","doi-asserted-by":"crossref","unstructured":"S. Di Girolamo K. Taranov A. Kurth M. Schaffner T. Schneider J. Ber\u00e1nek M. Besta L. Benini D. Roweth and T. Hoefler. 2019. Network-accelerated non-contiguous memory transfers. arXiv preprint arXiv:1908.08590.  S. Di Girolamo K. Taranov A. Kurth M. Schaffner T. Schneider J. Ber\u00e1nek M. Besta L. Benini D. Roweth and T. Hoefler. 2019. Network-accelerated non-contiguous memory transfers. arXiv preprint arXiv:1908.08590.","DOI":"10.1145\/3295500.3356189"},{"key":"e_1_2_1_54_1","unstructured":"W. J. Dixon and F. J. Massey  Jr. 1951. In Introduction to Statistical Analysis. McGraw-Hill.  W. J. Dixon and F. J. Massey Jr. 1951. In Introduction to Statistical Analysis. McGraw-Hill."},{"key":"e_1_2_1_55_1","first-page":"161","volume-title":"Proceedings of the 2014 ACM\/SIGDA International Symposium on Field-Programmable Gate Arrays. ACM.","author":"Dorrance R.","unstructured":"R. Dorrance , F. Ren , and D. Markovi\u0107 . 2014. A scalable sparse matrix-vector multiplication kernel for energy-efficient sparse-BLAS on FPGAS . In Proceedings of the 2014 ACM\/SIGDA International Symposium on Field-Programmable Gate Arrays. ACM. pp. 161 -- 170 . R. Dorrance, F. Ren, and D. Markovi\u0107. 2014. A scalable sparse matrix-vector multiplication kernel for energy-efficient sparse-BLAS on FPGAS. In Proceedings of the 2014 ACM\/SIGDA International Symposium on Field-Programmable Gate Arrays. ACM. pp. 161--170."},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1109\/FPGA.2002.1106681"},{"key":"e_1_2_1_57_1","volume-title":"Gravf: A vertex-centric distributed graph processing framework on FPGAs. In FPL.","author":"Engelhardt N.","year":"2016","unstructured":"N. Engelhardt and H. K.-H. So . 2016 . Gravf: A vertex-centric distributed graph processing framework on FPGAs. In FPL. N. Engelhardt and H. K.-H. So. 2016. Gravf: A vertex-centric distributed graph processing framework on FPGAs. In FPL."},{"key":"e_1_2_1_58_1","doi-asserted-by":"crossref","unstructured":"N. Engelhardt and H. K.-H. So. 2016. Vertex-centric graph processing on FPGA. In FCCM.  N. Engelhardt and H. K.-H. So. 2016. Vertex-centric graph processing on FPGA. In FCCM.","DOI":"10.1109\/FCCM.2016.31"},{"key":"e_1_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1137\/100801901"},{"key":"e_1_2_1_60_1","doi-asserted-by":"crossref","unstructured":"J. Feigenbaum S. Kannan A. McGregor S. Suri and J. Zhang. 2005. On graph problems in a semi-streaming model. Theoretical CS.  J. Feigenbaum S. Kannan A. McGregor S. Suri and J. Zhang. 2005. On graph problems in a semi-streaming model. Theoretical CS.","DOI":"10.1007\/978-3-540-27836-8_46"},{"key":"e_1_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1155\/2014\/571902"},{"key":"e_1_2_1_62_1","unstructured":"M. Ghaffari. 2017. Space-optimal semi-streaming for (2 + \u03b5)-approximate matching. arXiv:1701.03730.  M. Ghaffari. 2017. Space-optimal semi-streaming for (2 + \u03b5)-approximate matching. arXiv:1701.03730."},{"key":"e_1_2_1_63_1","first-page":"219","volume-title":"Proceedings of the 23rd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. ACM","author":"Gianinazzi L.","unstructured":"L. Gianinazzi , P. Kalvoda , A. De Palma , M. Besta , and T. Hoefler . 2018. Communication-avoiding parallel minimum cuts and connected components . In Proceedings of the 23rd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. ACM , pp. 219 -- 232 . L. Gianinazzi, P. Kalvoda, A. De Palma, M. Besta, and T. Hoefler. 2018. Communication-avoiding parallel minimum cuts and connected components. In Proceedings of the 23rd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. ACM, pp. 219--232."},{"key":"e_1_2_1_64_1","first-page":"468","volume-title":"Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM","author":"Goel A.","unstructured":"A. Goel , M. Kapralov , and S. Khanna . 2012. On the communication and streaming complexity of maximum bipartite matching . In Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM , pp. 468 -- 485 . A. Goel, M. Kapralov, and S. Khanna. 2012. On the communication and streaming complexity of maximum bipartite matching. In Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, pp. 468--485."},{"key":"e_1_2_1_65_1","first-page":"2","article-title":"Powergraph: Distributed graph-parallel computation on natural graphs","volume":"12","author":"Gonzalez J. E.","year":"2012","unstructured":"J. E. Gonzalez , Y. Low , H. Gu , D. Bickson , and C. Guestrin . 2012 . Powergraph: Distributed graph-parallel computation on natural graphs . In OSDI volume 12 , p. 2 . J. E. Gonzalez, Y. Low, H. Gu, D. Bickson, and C. Guestrin. 2012. Powergraph: Distributed graph-parallel computation on natural graphs. In OSDI volume 12, p. 2.","journal-title":"OSDI"},{"key":"e_1_2_1_66_1","unstructured":"E. Grigorescu M. Monemizadeh and S. Zhou. 2016. Streaming weighted matchings: Optimal meets greedy. arXiv:1608.01487.  E. Grigorescu M. Monemizadeh and S. Zhou. 2016. Streaming weighted matchings: Optimal meets greedy. arXiv:1608.01487."},{"key":"e_1_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1145\/176979.176984"},{"key":"e_1_2_1_68_1","doi-asserted-by":"crossref","unstructured":"M. R. Henzinger P. Raghavan and S. Rajagopalan. 1998. Computing on data streams. External Mem. Alg.  M. R. Henzinger P. Raghavan and S. Rajagopalan. 1998. Computing on data streams. External Mem. Alg.","DOI":"10.1090\/dimacs\/050\/05"},{"key":"e_1_2_1_69_1","first-page":"73","volume-title":"Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis. ACM","author":"Hoefler T.","unstructured":"T. Hoefler and R. Belli . 2015. Scientific benchmarking of parallel computing systems: Twelve ways to tell the masses when reporting performance results . In Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis. ACM , pp. 73 . T. Hoefler and R. Belli. 2015. Scientific benchmarking of parallel computing systems: Twelve ways to tell the masses when reporting performance results. In Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis. ACM, pp. 73."},{"issue":"2","key":"e_1_2_1_70_1","first-page":"2012","article-title":"The Chimera: An off-the-shelf CPU\/GPGPU\/FPGA hybrid computing platform","volume":"2012","author":"Inta R.","year":"2012","unstructured":"R. Inta , D. J. Bowman , and S. M. Scott . 2012 . The Chimera: An off-the-shelf CPU\/GPGPU\/FPGA hybrid computing platform . International Journal of Reconfigurable Computing , 2012 2 , 2012 . R. Inta, D. J. Bowman, and S. M. Scott. 2012. The Chimera: An off-the-shelf CPU\/GPGPU\/FPGA hybrid computing platform. International Journal of Reconfigurable Computing, 2012:2, 2012.","journal-title":"International Journal of Reconfigurable Computing"},{"key":"e_1_2_1_71_1","unstructured":"Intel. 2017. Intel Core i7-8700K Processor.  Intel. 2017. Intel Core i7-8700K Processor."},{"key":"e_1_2_1_72_1","unstructured":"Intel. 2017. Intel Xeon Processor E5-2680 v4.  Intel. 2017. Intel Xeon Processor E5-2680 v4."},{"key":"e_1_2_1_73_1","unstructured":"Intel. 2017. Stratix 10 GX\/SX Device Overview.  Intel. 2017. Stratix 10 GX\/SX Device Overview."},{"key":"e_1_2_1_74_1","unstructured":"Intel Arria. 2017. Intel Arria 10 Device Overview.  Intel Arria. 2017. Intel Arria 10 Device Overview."},{"key":"e_1_2_1_75_1","volume-title":"Extending the Thread Programming Model across Hybrid FPGA\/CPU Architectures","author":"Jidin R.","unstructured":"R. Jidin . 2005. Extending the Thread Programming Model across Hybrid FPGA\/CPU Architectures . Information Technology and Telecommunications Center (ITTC) , University of Kansas. R. Jidin. 2005. Extending the Thread Programming Model across Hybrid FPGA\/CPU Architectures. Information Technology and Telecommunications Center (ITTC), University of Kansas."},{"key":"e_1_2_1_76_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973105.121"},{"key":"e_1_2_1_77_1","first-page":"734","volume-title":"Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM","author":"Kapralov M.","unstructured":"M. Kapralov , S. Khanna , and M. Sudan . 2014. Approximating matching size from random streams . In Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM , pp. 734 -- 751 . M. Kapralov, S. Khanna, and M. Sudan. 2014. Approximating matching size from random streams. In Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, pp. 734--751."},{"key":"e_1_2_1_78_1","doi-asserted-by":"crossref","unstructured":"N. Kapre. 2015. Custom FPGA-based soft-processors for sparse graph acceleration. In ASAP.  N. Kapre. 2015. Custom FPGA-based soft-processors for sparse graph acceleration. In ASAP.","DOI":"10.1109\/ASAP.2015.7245698"},{"key":"e_1_2_1_79_1","first-page":"151","volume-title":"Proceedings of the 14th Annual IEEE Symposium on Field-Programmable Custom Computing Machines","author":"Kapre N.","year":"2006","unstructured":"N. Kapre , N. Mehta , D. Rizzo , I. Eslick , R. Rubin , T. E. Uribe , F. Thomas , Jr., A. DeHon , 2006 . Graphstep: A system architecture for sparse-graph algorithms . In Proceedings of the 14th Annual IEEE Symposium on Field-Programmable Custom Computing Machines , 2006 (FCCM\u201906). IEEE, pp. 143\u2013 151 . N. Kapre, N. Mehta, D. Rizzo, I. Eslick, R. Rubin, T. E. Uribe, F. Thomas, Jr., A. DeHon, et al. 2006. Graphstep: A system architecture for sparse-graph algorithms. In Proceedings of the 14th Annual IEEE Symposium on Field-Programmable Custom Computing Machines, 2006 (FCCM\u201906). IEEE, pp. 143\u2013151."},{"key":"e_1_2_1_80_1","unstructured":"C. Karande A. Mehta and P. Tripathi. 2001. Online bipartite matching with unknown distributions. In STOC.  C. Karande A. Mehta and P. Tripathi. 2001. Online bipartite matching with unknown distributions. In STOC."},{"key":"e_1_2_1_81_1","first-page":"352","volume-title":"Proceedings of the 22nd Annual ACM Symposium on Theory of Computing. ACM","author":"Karp R. M.","unstructured":"R. M. Karp , U. V. Vazirani , and V. V. Vazirani . 1990. An optimal algorithm for on-line bipartite matching . In Proceedings of the 22nd Annual ACM Symposium on Theory of Computing. ACM , pp. 352 -- 358 . R. M. Karp, U. V. Vazirani, and V. V. Vazirani. 1990. An optimal algorithm for on-line bipartite matching. In Proceedings of the 22nd Annual ACM Symposium on Theory of Computing. ACM, pp. 352--358."},{"key":"e_1_2_1_82_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2016.7761646"},{"key":"e_1_2_1_83_1","unstructured":"A. Khan. 2016. Vertex-centric graph processing: The good the bad and the ugly. arXiv preprint arXiv:1612.07404.  A. Khan. 2016. Vertex-centric graph processing: The good the bad and the ugly. arXiv preprint arXiv:1612.07404."},{"key":"e_1_2_1_84_1","first-page":"239","volume-title":"Proceedings of the 2018 ACM\/SIGDA International Symposium on Field-Programmable Gate Arrays. ACM","author":"Khoram S.","unstructured":"S. Khoram , J. Zhang , M. Strange , and J. Li . 2018. Accelerating graph analytics by co-optimizing storage and access on an FPGA-hmc platform . In Proceedings of the 2018 ACM\/SIGDA International Symposium on Field-Programmable Gate Arrays. ACM , pp. 239 -- 248 . S. Khoram, J. Zhang, M. Strange, and J. Li. 2018. Accelerating graph analytics by co-optimizing storage and access on an FPGA-hmc platform. In Proceedings of the 2018 ACM\/SIGDA International Symposium on Field-Programmable Gate Arrays. ACM, pp. 239--248."},{"key":"e_1_2_1_85_1","unstructured":"KONECT. 2017. Konect network dataset.  KONECT. 2017. Konect network dataset."},{"key":"e_1_2_1_86_1","doi-asserted-by":"crossref","unstructured":"C. Konrad F. Magniez and C. Mathieu. 2012. Maximum matching in semi-streaming with few passes. Approximation Randomization and Combinatorial Optimization. Algorithms and Techniques. pp. 231--242.  C. Konrad F. Magniez and C. Mathieu. 2012. Maximum matching in semi-streaming with few passes. Approximation Randomization and Combinatorial Optimization. Algorithms and Techniques. pp. 231--242.","DOI":"10.1007\/978-3-642-32512-0_20"},{"key":"e_1_2_1_87_1","first-page":"24","volume-title":"ACM\/IEEE Supercomputing. ACM","author":"Kwasniewski G.","unstructured":"G. Kwasniewski , M. Kabi\u0107 , M. Besta , J. VandeVondele , R. Solc\u00e0 , and T. Hoefler . 2019. Red-blue pebbling revisited: Near optimal parallel matrix-matrix multiplication . In ACM\/IEEE Supercomputing. ACM , p. 24 . G. Kwasniewski, M. Kabi\u0107, M. Besta, J. VandeVondele, R. Solc\u00e0, and T. Hoefler. 2019. Red-blue pebbling revisited: Near optimal parallel matrix-matrix multiplication. In ACM\/IEEE Supercomputing. ACM, p. 24."},{"key":"e_1_2_1_88_1","volume-title":"Graphchi: Large-scale graph computation on just a PC. USENIX.","author":"Kyrola A.","year":"2012","unstructured":"A. Kyrola , G. E. Blelloch , and C. Guestrin . 2012 . Graphchi: Large-scale graph computation on just a PC. USENIX. A. Kyrola, G. E. Blelloch, and C. Guestrin. 2012. Graphchi: Large-scale graph computation on just a PC. USENIX."},{"key":"e_1_2_1_89_1","doi-asserted-by":"publisher","DOI":"10.14778\/3137765.3137776"},{"key":"e_1_2_1_90_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCSII.2015.2505998"},{"key":"e_1_2_1_91_1","unstructured":"J. Leskovec and A. Krevl. 2014. SNAP Datasets: Stanford large network dataset collection.  J. Leskovec and A. Krevl. 2014. SNAP Datasets: Stanford large network dataset collection."},{"key":"e_1_2_1_92_1","volume-title":"G. Kwasniewski, and T. Hoefler.","author":"J.","year":"2019","unstructured":"J. d. F. Licht , G. Kwasniewski, and T. Hoefler. 2019 . Flexible communication avoiding matrix multiplication on FPGA with high-level synthesis. arXiv preprint arXiv:1912.06526. J. d. F. Licht, G. Kwasniewski, and T. Hoefler. 2019. Flexible communication avoiding matrix multiplication on FPGA with high-level synthesis. arXiv preprint arXiv:1912.06526."},{"key":"e_1_2_1_93_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:BTTJ.0000047600.45421.6d"},{"key":"e_1_2_1_94_1","volume-title":"Graphlab: A new framework for parallel machine learning. preprint arXiv:1006.4990.","author":"Low Y.","year":"2010","unstructured":"Y. Low , J. Gonzalez , A. Kyrola , D. Bickson , C. Guestrin , and J. M. Hellerstein . 2010 . Graphlab: A new framework for parallel machine learning. preprint arXiv:1006.4990. Y. Low, J. Gonzalez, A. Kyrola, D. Bickson, C. Guestrin, and J. M. Hellerstein. 2010. Graphlab: A new framework for parallel machine learning. preprint arXiv:1006.4990."},{"key":"e_1_2_1_95_1","volume-title":"Challenges in Parallel Graph Processing. Par. Proc. Let.","author":"Lumsdaine A.","unstructured":"A. Lumsdaine , D. Gregor , B. Hendrickson , and J. Berry . 2007 . Challenges in Parallel Graph Processing. Par. Proc. Let. A. Lumsdaine, D. Gregor, B. Hendrickson, and J. Berry. 2007. Challenges in Parallel Graph Processing. Par. Proc. Let."},{"key":"e_1_2_1_96_1","first-page":"227","volume-title":"Proceedings of the 2017 ACM\/SIGDA International Symposium on Field-Programmable Gate Arrays. ACM","author":"Ma X.","unstructured":"X. Ma , D. Zhang , and D. Chiou . 2017. FPGA-accelerated transactional execution of graph workloads . In Proceedings of the 2017 ACM\/SIGDA International Symposium on Field-Programmable Gate Arrays. ACM , pp. 227 -- 236 . X. Ma, D. Zhang, and D. Chiou. 2017. FPGA-accelerated transactional execution of graph workloads. In Proceedings of the 2017 ACM\/SIGDA International Symposium on Field-Programmable Gate Arrays. ACM, pp. 227--236."},{"key":"e_1_2_1_97_1","first-page":"135","volume-title":"Proceedings of the 2010 ACM SIGMOD International Conference on Management of data. ACM","author":"Malewicz G.","unstructured":"G. Malewicz , M. H. Austern , A. J. Bik , J. C. Dehnert , I. Horn , N. Leiser , and G. Czajkowski . 2010. Pregel: A system for large-scale graph processing . In Proceedings of the 2010 ACM SIGMOD International Conference on Management of data. ACM , pp. 135 -- 146 . G. Malewicz, M. H. Austern, A. J. Bik, J. C. Dehnert, I. Horn, N. Leiser, and G. Czajkowski. 2010. Pregel: A system for large-scale graph processing. In Proceedings of the 2010 ACM SIGMOD International Conference on Management of data. ACM, pp. 135--146."},{"key":"e_1_2_1_98_1","first-page":"170","article-title":"Finding graph matchings in data streams","volume":"3624","author":"McGregor A.","year":"2005","unstructured":"A. McGregor . 2005 . Finding graph matchings in data streams . In APPROX-RANDOM. Springer , Vol. 3624 , pp. 170 -- 181 . A. McGregor. 2005. Finding graph matchings in data streams. In APPROX-RANDOM. Springer, Vol. 3624, pp. 170--181.","journal-title":"APPROX-RANDOM. Springer"},{"key":"e_1_2_1_99_1","volume-title":"LIPIcs-Leibniz International Proceedings in Informatics","volume":"60","author":"McGregor A.","unstructured":"A. McGregor and S. Vorotnikova . 2016. Planar matching in streams revisited . In LIPIcs-Leibniz International Proceedings in Informatics , volume 60 . Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik. A. McGregor and S. Vorotnikova. 2016. Planar matching in streams revisited. In LIPIcs-Leibniz International Proceedings in Informatics, volume 60. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik."},{"key":"e_1_2_1_100_1","unstructured":"A. McGregor and S. Vorotnikova. 2018. A simple space-efficient streaming algorithm for matchings in low arboricity graphs. In OASIcs-OpenAccess Series in Informatics volume 61. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik.  A. McGregor and S. Vorotnikova. 2018. A simple space-efficient streaming algorithm for matchings in low arboricity graphs. In OASIcs-OpenAccess Series in Informatics volume 61. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik."},{"key":"e_1_2_1_101_1","doi-asserted-by":"crossref","unstructured":"A. McGregor S. Vorotnikova and H. T. Vu. 2016. Better algorithms for counting triangles in data streams. In PODS.  A. McGregor S. Vorotnikova and H. T. Vu. 2016. Better algorithms for counting triangles in data streams. In PODS.","DOI":"10.1145\/2902251.2902283"},{"key":"e_1_2_1_102_1","unstructured":"F. McSherry M. Isard and D. G. Murray. 2015. Scalability! But at what COST? In HotOS.  F. McSherry M. Isard and D. G. Murray. 2015. Scalability! But at what COST? In HotOS."},{"key":"e_1_2_1_103_1","doi-asserted-by":"publisher","DOI":"10.1561\/9781933019604"},{"key":"e_1_2_1_104_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2004.11.009"},{"key":"e_1_2_1_105_1","first-page":"25","volume-title":"Proceedings of the 2014 IEEE 22nd Annual International Symposium on Field-Programmable Custom Computing Machines (FCCM). IEEE","author":"Nurvitadhi E.","unstructured":"E. Nurvitadhi , G. Weisz , Y. Wang , S. Hurkat , M. Nguyen , J. C. Hoe , J. F. Mart\u00ednez , and C. Guestrin . 2014. Graphgen: An FPGA framework for vertex-centric graph computation . In Proceedings of the 2014 IEEE 22nd Annual International Symposium on Field-Programmable Custom Computing Machines (FCCM). IEEE , pp. 25 -- 28 . E. Nurvitadhi, G. Weisz, Y. Wang, S. Hurkat, M. Nguyen, J. C. Hoe, J. F. Mart\u00ednez, and C. Guestrin. 2014. Graphgen: An FPGA framework for vertex-centric graph computation. In Proceedings of the 2014 IEEE 22nd Annual International Symposium on Field-Programmable Custom Computing Machines (FCCM). IEEE, pp. 25--28."},{"key":"e_1_2_1_106_1","unstructured":"NVidia. 2017. GEFORCE GTX 1080 Ti.  NVidia. 2017. GEFORCE GTX 1080 Ti."},{"key":"e_1_2_1_107_1","doi-asserted-by":"publisher","DOI":"10.1145\/2847263.2847337"},{"key":"e_1_2_1_108_1","doi-asserted-by":"publisher","DOI":"10.1109\/ReConFig.2011.4"},{"key":"e_1_2_1_109_1","volume-title":"Centaur: A framework for hybrid CPU-FPGA databases. In FCCM.","author":"Owaida M.","year":"2017","unstructured":"M. Owaida , D. Sidler , K. Kara , and G. Alonso . 2017 . Centaur: A framework for hybrid CPU-FPGA databases. In FCCM. M. Owaida, D. Sidler, K. Kara, and G. Alonso. 2017. Centaur: A framework for hybrid CPU-FPGA databases. In FCCM."},{"key":"e_1_2_1_110_1","first-page":"166","volume-title":"Proceedings of the 2016 ACM\/IEEE 43rd Annual International Symposium on Computer Architecture (ISCA), IEEE","author":"Ozdal M. M.","unstructured":"M. M. Ozdal , S. Yesil , T. Kim , A. Ayupov , J. Greth , S. Burns , and O. Ozturk . 2016. Energy efficient architecture for graph analytics accelerators . In Proceedings of the 2016 ACM\/IEEE 43rd Annual International Symposium on Computer Architecture (ISCA), IEEE , pp. 166 -- 177 . M. M. Ozdal, S. Yesil, T. Kim, A. Ayupov, J. Greth, S. Burns, and O. Ozturk. 2016. Energy efficient architecture for graph analytics accelerators. In Proceedings of the 2016 ACM\/IEEE 43rd Annual International Symposium on Computer Architecture (ISCA), IEEE, pp. 166--177."},{"key":"e_1_2_1_111_1","unstructured":"L. Page S. Brin R. Motwani and T. Winograd. 1999. The Pagerank Citation Ranking: Bringing Order to the Web. Tech. Rep. Stanford InfoLab.  L. Page S. Brin R. Motwani and T. Winograd. 1999. The Pagerank Citation Ranking: Bringing Order to the Web. Tech. Rep. Stanford InfoLab."},{"key":"e_1_2_1_112_1","volume-title":"Combinatorial Optimization: Algorithms and Complexity","author":"Papadimitriou C. H.","year":"1998","unstructured":"C. H. Papadimitriou and K. Steiglitz . 1998 . Combinatorial Optimization: Algorithms and Complexity . Courier Corporation . C. H. Papadimitriou and K. Steiglitz. 1998. Combinatorial Optimization: Algorithms and Complexity. Courier Corporation."},{"key":"e_1_2_1_113_1","first-page":"2153","volume-title":"Proceedings of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM","author":"Paz A.","unstructured":"A. Paz and G. Schwartzman . 2017. A (2+)-approximation for maximum weight matching in the semi-streaming model . In Proceedings of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM , pp. 2153 -- 2161 . A. Paz and G. Schwartzman. 2017. A (2+)-approximation for maximum weight matching in the semi-streaming model. In Proceedings of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, pp. 2153--2161."},{"key":"e_1_2_1_114_1","first-page":"173","volume-title":"Proceedings of the 2008 International Conference on Field Programmable Logic and Applications. IEEE","author":"Putnam A.","unstructured":"A. Putnam , D. Bennett , E. Dellinger , J. Mason , P. Sundararajan , and S. Eggers . 2008. CHiMPS: A C-level compilation flow for hybrid CPU-FPGA architectures . In Proceedings of the 2008 International Conference on Field Programmable Logic and Applications. IEEE , pp. 173 -- 178 . A. Putnam, D. Bennett, E. Dellinger, J. Mason, P. Sundararajan, and S. Eggers. 2008. CHiMPS: A C-level compilation flow for hybrid CPU-FPGA architectures. In Proceedings of the 2008 International Conference on Field Programmable Logic and Applications. IEEE, pp. 173--178."},{"key":"e_1_2_1_115_1","first-page":"472","volume-title":"Proceedings of the 24th ACM Symposium on Operating Systems Principles. ACM","author":"Roy A.","unstructured":"A. Roy , I. Mihailovic , and W. Zwaenepoel . 2013. X-stream: Edge-centric graph processing using streaming partitions . In Proceedings of the 24th ACM Symposium on Operating Systems Principles. ACM , pp. 472 -- 488 . A. Roy, I. Mihailovic, and W. Zwaenepoel. 2013. X-stream: Edge-centric graph processing using streaming partitions. In Proceedings of the 24th ACM Symposium on Operating Systems Principles. ACM, pp. 472--488."},{"key":"e_1_2_1_116_1","doi-asserted-by":"crossref","unstructured":"S. Salihoglu and J. Widom. 2014. Optimizing graph algorithms on Pregel-like systems. In VLDB.  S. Salihoglu and J. Widom. 2014. Optimizing graph algorithms on Pregel-like systems. In VLDB.","DOI":"10.14778\/2732286.2732294"},{"key":"e_1_2_1_117_1","unstructured":"M. Santarini. 2011. Zynq-7000 EPP sets stage for new era of innovations. Xcell.  M. Santarini. 2011. Zynq-7000 EPP sets stage for new era of innovations. Xcell."},{"key":"e_1_2_1_118_1","doi-asserted-by":"crossref","unstructured":"T. Schank. 2007. Algorithmic aspects of triangle-based network analysis.  T. Schank. 2007. Algorithmic aspects of triangle-based network analysis.","DOI":"10.1155\/2007\/52861"},{"key":"e_1_2_1_119_1","first-page":"19","volume-title":"Proceedings of the 25th ACM International Symposium on High-Performance Parallel and Distributed Computing. ACM","author":"Schmid P.","unstructured":"P. Schmid , M. Besta , and T. Hoefler . 2016. High-performance distributed RMA locks . In Proceedings of the 25th ACM International Symposium on High-Performance Parallel and Distributed Computing. ACM , pp. 19 -- 30 . P. Schmid, M. Besta, and T. Hoefler. 2016. High-performance distributed RMA locks. In Proceedings of the 25th ACM International Symposium on High-Performance Parallel and Distributed Computing. ACM, pp. 19--30."},{"key":"e_1_2_1_120_1","first-page":"445","volume-title":"Proceedings of the 2015 International Conference on Parallel Architecture and Compilation (PACT). IEEE","author":"Schweizer H.","unstructured":"H. Schweizer , M. Besta , and T. Hoefler . 2015. Evaluating the cost of atomic operations on modern architectures . In Proceedings of the 2015 International Conference on Parallel Architecture and Compilation (PACT). IEEE , pp. 445 -- 456 . H. Schweizer, M. Besta, and T. Hoefler. 2015. Evaluating the cost of atomic operations on modern architectures. In Proceedings of the 2015 International Conference on Parallel Architecture and Compilation (PACT). IEEE, pp. 445--456."},{"key":"e_1_2_1_121_1","doi-asserted-by":"crossref","unstructured":"L. Shang A. S. Kaviani and K. Bathala. 2002. Dynamic power consumption in Virtex-II FPGA family. In FPGA.  L. Shang A. S. Kaviani and K. Bathala. 2002. Dynamic power consumption in Virtex-II FPGA family. In FPGA.","DOI":"10.1145\/503048.503072"},{"key":"e_1_2_1_122_1","unstructured":"Y. Shiloach and U. Vishkin. 1980. An o (log n) Parallel Connectivity Algorithm. Technical Report Computer Science Department Technion.  Y. Shiloach and U. Vishkin. 1980. An o (log n) Parallel Connectivity Algorithm. Technical Report Computer Science Department Technion."},{"key":"e_1_2_1_123_1","first-page":"403","volume-title":"Proceedings of the 2017 ACM International Conference on Management of Data ACM","author":"Sidler D.","unstructured":"D. Sidler , Z. Istv\u00e1n , M. Owaida , and G. Alonso . 2017. Accelerating pattern matching queries in hybrid CPU-FPGA architectures . In Proceedings of the 2017 ACM International Conference on Management of Data ACM , pages 403 -- 415 . D. Sidler, Z. Istv\u00e1n, M. Owaida, and G. Alonso. 2017. Accelerating pattern matching queries in hybrid CPU-FPGA architectures. In Proceedings of the 2017 ACM International Conference on Management of Data ACM, pages 403--415."},{"key":"e_1_2_1_124_1","volume-title":"Goffish: A sub-graph centric framework for large-scale graph analytics. In EuroPar.","author":"Simmhan Y.","year":"2014","unstructured":"Y. Simmhan , A. Kumbhare , C. Wickramaarachchi , S. Nagarkar , S. Ravi , C. Raghavendra , and V. Prasanna . 2014 . Goffish: A sub-graph centric framework for large-scale graph analytics. In EuroPar. Y. Simmhan, A. Kumbhare, C. Wickramaarachchi, S. Nagarkar, S. Ravi, C. Raghavendra, and V. Prasanna. 2014. Goffish: A sub-graph centric framework for large-scale graph analytics. In EuroPar."},{"key":"e_1_2_1_125_1","first-page":"47","volume-title":"Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis. ACM","author":"Solomonik E.","unstructured":"E. Solomonik , M. Besta , F. Vella , and T. Hoefler . 2017. Scaling betweenness centrality using communication-efficient sparse matrix multiplication . In Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis. ACM , p. 47 . E. Solomonik, M. Besta, F. Vella, and T. Hoefler. 2017. Scaling betweenness centrality using communication-efficient sparse matrix multiplication. In Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis. ACM, p. 47."},{"key":"e_1_2_1_126_1","doi-asserted-by":"publisher","DOI":"10.1109\/FCCM.2007.56"},{"key":"e_1_2_1_127_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2003.1206509"},{"key":"e_1_2_1_128_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2007.70844"},{"key":"e_1_2_1_129_1","doi-asserted-by":"publisher","DOI":"10.2172\/1172915"},{"key":"e_1_2_1_130_1","doi-asserted-by":"crossref","unstructured":"N. Trinajsti\u0107 D. J. Klein and M. Randi\u0107. 1986. On some solved and unsolved problems of chemical graph theory. International Journal of Quantum Chemistry.  N. Trinajsti\u0107 D. J. Klein and M. Randi\u0107. 1986. On some solved and unsolved problems of chemical graph theory. International Journal of Quantum Chemistry.","DOI":"10.1002\/qua.560300762"},{"key":"e_1_2_1_131_1","volume-title":"Edwin Kok, Wei-Yee Koay, and Boon-Jin Ang.","author":"Tyhach J.","year":"2015","unstructured":"J. Tyhach , M. Hutton , S. Atsatt , A. Rahman , B. Vest , D. Lewis , M. Langhammer , S. Shumarayev , T. Hoang , A. Chan , Dong-Myung Choi , Dan Oh , Hae-Chang Lee , Jack Chui , Ket Chiew Sia , Edwin Kok, Wei-Yee Koay, and Boon-Jin Ang. 2015 . Arria 10 device architecture. In CICC. J. Tyhach, M. Hutton, S. Atsatt, A. Rahman, B. Vest, D. Lewis, M. Langhammer, S. Shumarayev, T. Hoang, A. Chan, Dong-Myung Choi, Dan Oh, Hae-Chang Lee, Jack Chui, Ket Chiew Sia, Edwin Kok, Wei-Yee Koay, and Boon-Jin Ang. 2015. Arria 10 device architecture. In CICC."},{"key":"e_1_2_1_132_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(00)00128-9"},{"key":"e_1_2_1_133_1","doi-asserted-by":"crossref","unstructured":"Y. Umuroglu D. Morrison and M. Jahre. 2015. Hybrid breadth-first search on a single-chip FPGA-CPU heterogeneous platform. In FPL.  Y. Umuroglu D. Morrison and M. Jahre. 2015. Hybrid breadth-first search on a single-chip FPGA-CPU heterogeneous platform. In FPL.","DOI":"10.1109\/FPL.2015.7293939"},{"key":"e_1_2_1_134_1","first-page":"386","volume-title":"Proceedings of the 8th International Symposium on Quality Electronic Design (ISQED\u201907)","author":"Wang X.","unstructured":"X. Wang and S. G. Ziavras . 2007. Performance-energy tradeoffs for matrix multiplication on FPGA-based mixed-mode chip multiprocessors . In Proceedings of the 8th International Symposium on Quality Electronic Design (ISQED\u201907) . IEEE, pp. 386 -- 391 . X. Wang and S. G. Ziavras. 2007. Performance-energy tradeoffs for matrix multiplication on FPGA-based mixed-mode chip multiprocessors. In Proceedings of the 8th International Symposium on Quality Electronic Design (ISQED\u201907). IEEE, pp. 386--391."},{"key":"e_1_2_1_135_1","unstructured":"G. Weisz E. Nurvitadhi and J. Hoe. 2013. Graphgen for coram: Graph computation on FPGAs. In CARL.  G. Weisz E. Nurvitadhi and J. Hoe. 2013. Graphgen for coram: Graph computation on FPGAs. In CARL."},{"key":"e_1_2_1_136_1","doi-asserted-by":"publisher","DOI":"10.14778\/2733085.2733089"},{"key":"e_1_2_1_137_1","unstructured":"C. Yang. 2018. An efficient dispatcher for large scale graph processing on opencl-based FPGAs. arXiv preprint arXiv:1806.11509.  C. Yang. 2018. An efficient dispatcher for large scale graph processing on opencl-based FPGAs. arXiv preprint arXiv:1806.11509."},{"key":"e_1_2_1_138_1","doi-asserted-by":"crossref","unstructured":"P. Yao. 2018. An efficient graph accelerator with parallel data conflict management. arXiv preprint arXiv:1806.00751.  P. Yao. 2018. An efficient graph accelerator with parallel data conflict management. arXiv preprint arXiv:1806.00751.","DOI":"10.1145\/3243176.3243201"},{"key":"e_1_2_1_139_1","doi-asserted-by":"crossref","unstructured":"M. Zaharia R. S. Xin P. Wendell T. Das M. Armbrust A. Dave X. Meng J. Rosen S. Venkataraman M. J. Franklin Ali Ghodsi Joseph Gonzales Scott Shenker and Ion Stoica. 2016. Apache spark: A unified engine for big data processing. CACM.  M. Zaharia R. S. Xin P. Wendell T. Das M. Armbrust A. Dave X. Meng J. Rosen S. Venkataraman M. J. Franklin Ali Ghodsi Joseph Gonzales Scott Shenker and Ion Stoica. 2016. Apache spark: A unified engine for big data processing. CACM.","DOI":"10.1145\/2934664"},{"key":"e_1_2_1_140_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-010-9438-5"},{"key":"e_1_2_1_141_1","doi-asserted-by":"crossref","unstructured":"J. Zhang S. Khoram and J. Li. 2017. Boosting the performance of FPGA-based graph processor using hybrid memory cube: A case for breadth first search. In FPGA.  J. Zhang S. Khoram and J. Li. 2017. Boosting the performance of FPGA-based graph processor using hybrid memory cube: A case for breadth first search. In FPGA.","DOI":"10.1145\/3020078.3021737"},{"key":"e_1_2_1_142_1","first-page":"207","volume-title":"Proceedings of the 2017 ACM\/SIGDA International Symposium on Field-Programmable Gate Arrays (FPGA\u201917)","author":"Zhang J.","unstructured":"J. Zhang , S. Khoram , and J. Li . 2017. Boosting the performance of FPGA-based graph processor using hybrid memory cube: A case for breadth first search . In Proceedings of the 2017 ACM\/SIGDA International Symposium on Field-Programmable Gate Arrays (FPGA\u201917) . ACM, New York , pp. 207 -- 216 . J. Zhang, S. Khoram, and J. Li. 2017. Boosting the performance of FPGA-based graph processor using hybrid memory cube: A case for breadth first search. In Proceedings of the 2017 ACM\/SIGDA International Symposium on Field-Programmable Gate Arrays (FPGA\u201917). ACM, New York, pp. 207--216."},{"key":"e_1_2_1_143_1","first-page":"229","volume-title":"Proceedings of the 2018 ACM\/SIGDA International Symposium on Field-Programmable Gate Arrays. ACM","author":"Zhang J.","unstructured":"J. Zhang and J. Li . 2018. Degree-aware hybrid graph traversal on FPGA-HMC platform . In Proceedings of the 2018 ACM\/SIGDA International Symposium on Field-Programmable Gate Arrays. ACM , pp. 229 -- 238 . J. Zhang and J. Li. 2018. Degree-aware hybrid graph traversal on FPGA-HMC platform. In Proceedings of the 2018 ACM\/SIGDA International Symposium on Field-Programmable Gate Arrays. ACM, pp. 229--238."},{"key":"e_1_2_1_144_1","first-page":"1","volume-title":"Proceedings of the 2016 49th Annual IEEE\/ACM International Symposium on Microarchitecture (MICRO).","author":"Zhang S.","unstructured":"S. Zhang , Z. Du , L. Zhang , H. Lan , S. Liu , L. Li , Q. Guo , T. Chen , and Y. Chen . 2016. Cambricon-x: An accelerator for sparse neural networks . In Proceedings of the 2016 49th Annual IEEE\/ACM International Symposium on Microarchitecture (MICRO). pp. 1 -- 12 . S. Zhang, Z. Du, L. Zhang, H. Lan, S. Liu, L. Li, Q. Guo, T. Chen, and Y. Chen. 2016. Cambricon-x: An accelerator for sparse neural networks. In Proceedings of the 2016 49th Annual IEEE\/ACM International Symposium on Microarchitecture (MICRO). pp. 1--12."},{"key":"e_1_2_1_145_1","volume-title":"Tunao: A high-performance and energy-efficient reconfigurable accelerator for graph processing. In CCGRID.","author":"Zhou J.","year":"2017","unstructured":"J. Zhou , S. Liu , Q. Guo , X. Zhou , T. Zhi , D. Liu , C. Wang , X. Zhou , Y. Chen , and T. Chen . 2017 . Tunao: A high-performance and energy-efficient reconfigurable accelerator for graph processing. In CCGRID. J. Zhou, S. Liu, Q. Guo, X. Zhou, T. Zhi, D. Liu, C. Wang, X. Zhou, Y. Chen, and T. Chen. 2017. Tunao: A high-performance and energy-efficient reconfigurable accelerator for graph processing. In CCGRID."},{"key":"e_1_2_1_146_1","doi-asserted-by":"crossref","unstructured":"S. Zhou C. Chelmis and V. K. Prasanna. 2015. Optimizing memory performance for FPGA implementation of pagerank. In ReConFig. pp. 1--6.  S. Zhou C. Chelmis and V. K. Prasanna. 2015. Optimizing memory performance for FPGA implementation of pagerank. In ReConFig. pp. 1--6.","DOI":"10.1109\/ReConFig.2015.7393332"},{"key":"e_1_2_1_147_1","first-page":"103","volume-title":"Proceedings of the 2016 IEEE 24th Annual International Symposium on Field-Programmable Custom Computing Machines (FCCM). IEEE","author":"Zhou S.","unstructured":"S. Zhou , C. Chelmis , and V. K. Prasanna . 2016. High-throughput and energy-efficient graph processing on FPGA . In Proceedings of the 2016 IEEE 24th Annual International Symposium on Field-Programmable Custom Computing Machines (FCCM). IEEE , pp. 103 -- 110 . S. Zhou, C. Chelmis, and V. K. Prasanna. 2016. High-throughput and energy-efficient graph processing on FPGA. In Proceedings of the 2016 IEEE 24th Annual International Symposium on Field-Programmable Custom Computing Machines (FCCM). IEEE, pp. 103--110."},{"key":"e_1_2_1_148_1","first-page":"69","volume-title":"Proceedings of the 15th ACM International Conference on Computing Frontiers. ACM","author":"Zhou S.","unstructured":"S. Zhou , R. Kannan , H. Zeng , and V. K. Prasanna . 2018. An FPGA framework for edge-centric graph processing . In Proceedings of the 15th ACM International Conference on Computing Frontiers. ACM , pp. 69 -- 77 . S. Zhou, R. Kannan, H. Zeng, and V. K. Prasanna. 2018. An FPGA framework for edge-centric graph processing. In Proceedings of the 15th ACM International Conference on Computing Frontiers. ACM, pp. 69--77."},{"key":"e_1_2_1_149_1","doi-asserted-by":"crossref","unstructured":"S. Zhou and V. K. Prasanna. 2017. Accelerating graph analytics on CPU-FPGA heterogeneous platform. In SBAC-PAD.  S. Zhou and V. K. Prasanna. 2017. Accelerating graph analytics on CPU-FPGA heterogeneous platform. In SBAC-PAD.","DOI":"10.1109\/SBAC-PAD.2017.25"},{"key":"e_1_2_1_150_1","first-page":"1506","volume-title":"Proceedings of the Conference on Design, Automation and Test in Europe. European Design and Automation Association","author":"Zhu J.","unstructured":"J. Zhu , I. Sander , and A. Jantsch . 2009. Buffer minimization of real-time streaming applications scheduling on hybrid CPU\/FPGA architectures . In Proceedings of the Conference on Design, Automation and Test in Europe. European Design and Automation Association , pp. 1506 -- 1511 . J. Zhu, I. Sander, and A. Jantsch. 2009. Buffer minimization of real-time streaming applications scheduling on hybrid CPU\/FPGA architectures. In Proceedings of the Conference on Design, Automation and Test in Europe. European Design and Automation Association, pp. 1506--1511."},{"key":"e_1_2_1_151_1","first-page":"63","volume-title":"Proceedings of the 2005 ACM\/SIGDA 13th International Symposium on Field-Programmable Gate Arrays. ACM","author":"Zhuo L.","unstructured":"L. Zhuo and V. K. Prasanna . 2005. Sparse matrix-vector multiplication on FPGAS . In Proceedings of the 2005 ACM\/SIGDA 13th International Symposium on Field-Programmable Gate Arrays. ACM , pp 63 -- 74 . L. Zhuo and V. K. Prasanna. 2005. Sparse matrix-vector multiplication on FPGAS. In Proceedings of the 2005 ACM\/SIGDA 13th International Symposium on Field-Programmable Gate Arrays. ACM, pp 63--74."}],"container-title":["ACM Transactions on Reconfigurable Technology and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3377871","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3377871","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:38:52Z","timestamp":1750199932000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3377871"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4,24]]},"references-count":151,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,6,30]]}},"alternative-id":["10.1145\/3377871"],"URL":"https:\/\/doi.org\/10.1145\/3377871","relation":{},"ISSN":["1936-7406","1936-7414"],"issn-type":[{"value":"1936-7406","type":"print"},{"value":"1936-7414","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,4,24]]},"assertion":[{"value":"2019-05-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-12-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-04-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}