{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:31:57Z","timestamp":1750221117844,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":67,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,2,20]],"date-time":"2019-02-20T00:00:00Z","timestamp":1550620800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,2,20]]},"DOI":"10.1145\/3289602.3293916","type":"proceedings-article","created":{"date-parts":[[2019,2,22]],"date-time":"2019-02-22T22:12:13Z","timestamp":1550873533000},"page":"152-161","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Substream-Centric Maximum Matchings on FPGA"],"prefix":"10.1145","author":[{"given":"Maciej","family":"Besta","sequence":"first","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"Fischer","sequence":"additional","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tal","family":"Ben-Nun","sequence":"additional","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johannes","family":"De Fine Licht","sequence":"additional","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Torsten","family":"Hoefler","sequence":"additional","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,2,20]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"10thDIMACSChallenge. KroneckerGeneratorGraphs 2011.  10thDIMACSChallenge. KroneckerGeneratorGraphs 2011."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2601412"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.48"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2749469.2750386"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213556.2213560"},{"key":"e_1_3_2_1_6_1","volume-title":"ICALP","author":"Ahn K. J.","year":"2011","unstructured":"K. J. Ahn and S.Guha. Linear programming in the semi-streamingmodelwith application to themaximummatching problem . In ICALP , 2011 . K. J. Ahn and S.Guha. Linear programming in the semi-streamingmodelwith application to themaximummatching problem. In ICALP, 2011."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/2884435.2884528"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/FPT.2011.6132667"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph theorywith applications","author":"Bondy J. A.","year":"1976","unstructured":"J. A. Bondy Graph theorywith applications . 1976 . J. A. Bondy et al. Graph theorywith applications. 1976."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142351.1142388"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02927-1_20"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/288548.288557"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.14778\/2824032.2824077"},{"key":"e_1_3_2_1_14_1","volume-title":"SODA","author":"R.","year":"2016","unstructured":"R. Chitnis et al. Kernelization via samplingwith applications to findingmatchings and related problems in dynamic graph streams . In SODA , 2016 . R.Chitnis et al. Kernelization via samplingwith applications to findingmatchings and related problems in dynamic graph streams. In SODA, 2016."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897937.2897972"},{"volume-title":"Independent sets in vertex-arrival streams. arXiv:1807.08331","year":"2018","key":"e_1_3_2_1_16_1","unstructured":"G.Cormode Independent sets in vertex-arrival streams. arXiv:1807.08331 , 2018 . G.Cormode et al. Independent sets in vertex-arrival streams. arXiv:1807.08331, 2018."},{"key":"e_1_3_2_1_17_1","volume-title":"LIPIcs-Leibniz Inf.","author":"Crouch M.","year":"2014","unstructured":"M. Crouch and D.M. Stubbs . Improved streaming algorithms for weightedmatching, via unweightedmatching . In LIPIcs-Leibniz Inf. , 2014 . M. Crouch and D.M. Stubbs. Improved streaming algorithms for weightedmatching, via unweightedmatching. In LIPIcs-Leibniz Inf., 2014."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2847263.2847339"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3020078.3021739"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539701398363"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327492"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1644015.1644021"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/FPL.2016.7577360"},{"key":"e_1_3_2_1_24_1","volume-title":"FCCM","author":"Engelhardt N.","year":"2016","unstructured":"N. Engelhardt and H. K.-H. So . Vertex-centricGraph Processing on FPGA . In FCCM , 2016 . N. Engelhardt andH. K.-H. So. Vertex-centricGraph Processing on FPGA. In FCCM, 2016."},{"key":"e_1_3_2_1_25_1","volume":"201","author":"Epstein L.","unstructured":"L. Epstein Improved approximation guarantees for weighted matching in the semistreamingmodel. J. onDiscreteMathematics , 201 1. L. Epstein et al. Improved approximation guarantees for weighted matching in the semistreamingmodel. J. onDiscreteMathematics, 2011.","journal-title":"J. onDiscreteMathematics"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.09.013"},{"volume-title":"Space-optimal semi-streamingfor (2+)-approximatematching. arXiv:1701.03730","year":"2017","key":"e_1_3_2_1_27_1","unstructured":"M.Ghaffari. Space-optimal semi-streamingfor (2+)-approximatematching. arXiv:1701.03730 , 2017 . M.Ghaffari. Space-optimal semi-streamingfor (2+)-approximatematching. arXiv:1701.03730, 2017."},{"volume-title":"SODA","year":"2012","key":"e_1_3_2_1_28_1","unstructured":"A.Goeletal.Onthecommunicationandstreamingcomplexityofmaximumbipartitematching. In SODA , 2012 . A.Goeletal.Onthecommunicationandstreamingcomplexityofmaximumbipartitematching. In SODA, 2012."},{"volume-title":"Streamingweightedmatchings:Optimalmeets greedy. arXiv:1608.01487","year":"2016","key":"e_1_3_2_1_29_1","unstructured":"E.Grigorescu Streamingweightedmatchings:Optimalmeets greedy. arXiv:1608.01487 , 2016 . E.Grigorescu et al. Streamingweightedmatchings:Optimalmeets greedy. arXiv:1608.01487, 2016."},{"key":"e_1_3_2_1_30_1","volume-title":"ExternalMem. Alg.","author":"M.","year":"1998","unstructured":"M. R. Henzinger et al. Computing on data streams . ExternalMem. Alg. , 1998 . M. R.Henzinger et al. Computing on data streams. ExternalMem. Alg., 1998."},{"volume-title":"IntelCore i7--8700K Processor","year":"2017","key":"e_1_3_2_1_31_1","unstructured":"Intel. IntelCore i7--8700K Processor , 2017 . Intel. IntelCore i7--8700K Processor, 2017."},{"volume-title":"Intel Xeon Processor E5--2680 v4","year":"2017","key":"e_1_3_2_1_32_1","unstructured":"Intel. Intel Xeon Processor E5--2680 v4 , 2017 . Intel. Intel Xeon Processor E5--2680 v4, 2017."},{"key":"e_1_3_2_1_33_1","unstructured":"Intel. Stratix 10GX\/SXDeviceOverview 2017.  Intel. Stratix 10GX\/SXDeviceOverview 2017."},{"key":"e_1_3_2_1_34_1","unstructured":"Intel Arria. Intel Arria 10DeviceOverview 2017.  Intel Arria. Intel Arria 10DeviceOverview 2017."},{"key":"e_1_3_2_1_35_1","volume-title":"SODA","author":"Kapralov M.","year":"2013","unstructured":"M. Kapralov . Better bounds formatchings in the streamingmodel . In SODA , 2013 . M. Kapralov. Better bounds formatchings in the streamingmodel. In SODA, 2013."},{"key":"e_1_3_2_1_36_1","volume-title":"SODA","author":"Kapralov M.","year":"2014","unstructured":"M. Kapralov Approximatingmatching size fromrandomstreams . In SODA , 2014 . M. Kapralov et al. Approximatingmatching size fromrandomstreams. In SODA, 2014."},{"key":"e_1_3_2_1_37_1","volume-title":"ASAP","author":"Kapre N.","year":"2015","unstructured":"N. Kapre . CustomFPGA-based soft-processors for sparse graph acceleration . In ASAP , 2015 . N. Kapre. CustomFPGA-based soft-processors for sparse graph acceleration. In ASAP, 2015."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993715"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/100216.100262"},{"key":"e_1_3_2_1_40_1","volume-title":"Konect network dataset","author":"KONECT.","year":"2017","unstructured":"KONECT. Konect network dataset , 2017 . KONECT. Konect network dataset, 2017."},{"key":"e_1_3_2_1_41_1","volume-title":"APPROX-RANDOM","author":"Konrad C.","year":"2012","unstructured":"C. Konrad Maximummatching in semi-streamingwith fewpasses . APPROX-RANDOM , 2012 . C. Konrad et al. Maximummatching in semi-streamingwith fewpasses. APPROX-RANDOM, 2012."},{"key":"e_1_3_2_1_42_1","volume-title":"SNAPDatasets: Stanford large network dataset collection","author":"Leskovec J.","year":"2014","unstructured":"J. Leskovec and A. Krevl . SNAPDatasets: Stanford large network dataset collection , 2014 . J. Leskovec and A. Krevl. SNAPDatasets: Stanford large network dataset collection, 2014."},{"key":"e_1_3_2_1_43_1","volume-title":"Challenges in ParallelGraph Processing. Par. Proc. Let.","author":"Lumsdaine A.","year":"2007","unstructured":"A. Lumsdaine Challenges in ParallelGraph Processing. Par. Proc. Let. , 2007 . A. Lumsdaine et al. Challenges in ParallelGraph Processing. Par. Proc. Let., 2007."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/11538462_15"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/2902251.2902283"},{"key":"e_1_3_2_1_46_1","volume-title":"InHotOS","author":"F.","year":"2015","unstructured":"F. McSherry et al. Scalability! but atwhatCOST ? InHotOS , 2015 . F.McSherry et al. Scalability! but atwhatCOST? InHotOS, 2015."},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1561\/0400000002"},{"key":"e_1_3_2_1_48_1","volume-title":"FCCM","author":"E.","year":"2014","unstructured":"E. Nurvitadhi et al. Graphgen: An FPGA framework for vertex-centric graph computation . In FCCM , 2014 . E.Nurvitadhi et al. Graphgen: An FPGA framework for vertex-centric graph computation. In FCCM, 2014."},{"key":"e_1_3_2_1_49_1","unstructured":"NVidia. GEFORCEGTX 1080 Ti 2017.  NVidia. GEFORCEGTX 1080 Ti 2017."},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/2847263.2847337"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1109\/ReConFig.2011.4"},{"key":"e_1_3_2_1_52_1","volume-title":"FCCM","author":"M.","year":"2017","unstructured":"M. Owaida et al. Centaur: A framework for hybridCPU-FPGA databases . In FCCM , 2017 . M.Owaida et al. Centaur: A framework for hybridCPU-FPGA databases. In FCCM, 2017."},{"key":"e_1_3_2_1_53_1","volume-title":"SODA","author":"Paz A.","year":"2017","unstructured":"A. Paz and G. Schwartzman . A (2+epsilon)-approximation formaximumweightmatching in the semi-streamingmodel . In SODA , 2017 . A. Paz andG. Schwartzman. A (2+epsilon)-approximation formaximumweightmatching in the semi-streamingmodel. In SODA, 2017."},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522740"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732286.2732294"},{"key":"e_1_3_2_1_56_1","volume-title":"Xcell","author":"Santarini M.","year":"2011","unstructured":"M. Santarini . Zynq-7000 EPP sets stage for newera of innovations . Xcell , 2011 . M. Santarini. Zynq-7000 EPP sets stage for newera of innovations. Xcell, 2011."},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/503048.503072"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-09873-9_38"},{"volume-title":"International Journal ofQuantumChemistry","year":"1986","key":"e_1_3_2_1_59_1","unstructured":"N.Trinajsticetal.Onsomesolvedandunsolvedproblemsofchemicalgraphtheory. International Journal ofQuantumChemistry , 1986 . N.Trinajsticetal.Onsomesolvedandunsolvedproblemsofchemicalgraphtheory. International Journal ofQuantumChemistry, 1986."},{"key":"e_1_3_2_1_60_1","volume-title":"CICC","author":"Tyhach J.","year":"2015","unstructured":"J. Tyhach Arria?10 device architecture . In CICC , 2015 . J. Tyhach et al. Arria?10 device architecture. In CICC, 2015."},{"key":"e_1_3_2_1_61_1","volume-title":"CARL","author":"G.","year":"2013","unstructured":"G. Weisz et al. Graphgen for coram:Graph computation on FPGAs . In CARL , 2013 . G.Weisz et al. Graphgen for coram:Graph computation on FPGAs. In CARL, 2013."},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1145\/2934664"},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-010-9438-5"},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1145\/3020078.3021737"},{"key":"e_1_3_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCGRID.2017.114"},{"key":"e_1_3_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1109\/FCCM.2016.35"},{"key":"e_1_3_2_1_67_1","unstructured":"S.Zhouetal.AcceleratingGraphAnalyticsonCPU-FPGAHeterogeneousPlatform. SBAC-PAD 2017.  S.Zhouetal.AcceleratingGraphAnalyticsonCPU-FPGAHeterogeneousPlatform. SBAC-PAD 2017."}],"event":{"name":"FPGA '19: The 2019 ACM\/SIGDA International Symposium on Field-Programmable Gate Arrays","sponsor":["SIGDA ACM Special Interest Group on Design Automation"],"location":"Seaside CA USA","acronym":"FPGA '19"},"container-title":["Proceedings of the 2019 ACM\/SIGDA International Symposium on Field-Programmable Gate Arrays"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3289602.3293916","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3289602.3293916","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:02:07Z","timestamp":1750208527000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3289602.3293916"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2,20]]},"references-count":67,"alternative-id":["10.1145\/3289602.3293916","10.1145\/3289602"],"URL":"https:\/\/doi.org\/10.1145\/3289602.3293916","relation":{},"subject":[],"published":{"date-parts":[[2019,2,20]]},"assertion":[{"value":"2019-02-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}