{"id":19941,"date":"2020-03-08T14:20:17","date_gmt":"2020-03-08T12:20:17","guid":{"rendered":"https:\/\/hgpu.org\/?p=19941"},"modified":"2020-03-08T14:20:17","modified_gmt":"2020-03-08T12:20:17","slug":"fast-gunrock-subgraph-matching-gsm-on-gpus","status":"publish","type":"post","link":"https:\/\/hgpu.org\/?p=19941","title":{"rendered":"Fast Gunrock Subgraph Matching (GSM) on GPUs"},"content":{"rendered":"<p>In this paper, we propose a novel method, GSM (Gunrock Subgraph Matching), to compute graph matching (subgraph isomorphism) on GPUs. In contrast to previous approaches, GSM is BFS-based: possible matches are explored simultaneously in a breadth-first strategy and thus can be mapped onto GPUs in a massively parallel fashion. Our implementation on the Gunrock graph analytics framework follows a filtering-and-verification strategy. While previous work requires one-\/two-step joining, we use one-step verification to decide the candidates in current frontier of nodes. Our implementation has a speedup up to 4x over previous GPU state-of-the-art implementation.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>In this paper, we propose a novel method, GSM (Gunrock Subgraph Matching), to compute graph matching (subgraph isomorphism) on GPUs. In contrast to previous approaches, GSM is BFS-based: possible matches are explored simultaneously in a breadth-first strategy and thus can be mapped onto GPUs in a massively parallel fashion. Our implementation on the Gunrock graph [&hellip;]<\/p>\n","protected":false},"author":351,"featured_media":0,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"_jetpack_memberships_contains_paid_content":false,"footnotes":"","jetpack_publicize_message":"","jetpack_publicize_feature_enabled":true,"jetpack_social_post_already_shared":true,"jetpack_social_options":{"image_generator_settings":{"template":"highway","default_image_id":0,"font":"","enabled":false},"version":2}},"categories":[11,3],"tags":[1782,158,20,2035,1991,176],"class_list":["post-19941","post","type-post","status-publish","format-standard","hentry","category-computer-science","category-paper","tag-computer-science","tag-graph-theory","tag-nvidia","tag-nvidia-geforce-gtx-titan-v","tag-nvidia-geforce-gtx-titan-xp","tag-package"],"views":2131,"jetpack_publicize_connections":[],"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/hgpu.org\/index.php?rest_route=\/wp\/v2\/posts\/19941","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/hgpu.org\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/hgpu.org\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/hgpu.org\/index.php?rest_route=\/wp\/v2\/users\/351"}],"replies":[{"embeddable":true,"href":"https:\/\/hgpu.org\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=19941"}],"version-history":[{"count":0,"href":"https:\/\/hgpu.org\/index.php?rest_route=\/wp\/v2\/posts\/19941\/revisions"}],"wp:attachment":[{"href":"https:\/\/hgpu.org\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=19941"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/hgpu.org\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=19941"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/hgpu.org\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=19941"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}