{"id":3752,"date":"2025-09-08T17:19:00","date_gmt":"2025-09-08T16:19:00","guid":{"rendered":"https:\/\/blogs.qub.ac.uk\/dipsa\/?p=3752"},"modified":"2026-05-01T02:27:09","modified_gmt":"2026-05-01T01:27:09","slug":"poster-presentation-at-the-cluster-2025-conference","status":"publish","type":"post","link":"https:\/\/blogs.qub.ac.uk\/dipsa\/poster-presentation-at-the-cluster-2025-conference\/","title":{"rendered":"Poster presentation on NI-ORCA at the CLUSTER 2025 conference"},"content":{"rendered":"\n
\n
\"\"<\/figure>\n\n\n\n
\"\"<\/figure>\n\n\n\n
\"\"<\/figure>\n\n\n\n
\"\"<\/figure>\n<\/figure>\n\n\n\n

We attended the CLUSTER 2025 <\/strong>conference organised at the University of Edinburgh, Scotland, United Kingdom, between 2 and 5 September 2025.<\/p>\n\n\n\n

Syed Tauhidi <\/strong>presented a poster on NI-ORCA<\/strong>, a parallel algorithm designed for multi-core processors to efficiently count non-induced graphlet orbits up to four-clique (K4<\/sub>). Extending the existing ORCA framework, the algorithm operates in three main stages: counting per-edge triangles, enumerating 4-cliques by intersecting neighbourhoods, and probing local substructures to solve per-vertex orbit equations. To overcome the challenge of data contention in shared structures during the computationally heavy second and third stages, NI-ORCA employs several parallelisation strategies, including the use of per-thread buffers, atomic arrays, and hash maps. Experimental evaluations conducted on AMD EPYC and Intel Xeon systems across four real-world datasets (DBLP, HUMAN, PATENTS, and YOUTUBE) demonstrate that NI-ORCA achieves substantial speedups over prior state-of-the-art methods like EVOKE and JESSE, making it a highly effective tool for graph search and the analysis of large, complex networks.<\/p>\n\n\n\n

The abstract for the poster is available here:<\/p>\n\n\n\n

\n

S. I. Tauhidi, A. Karmakar, T. S. Mai and H. Vandierendonck, “Parallel Counting of Non-Induced Graphlet Orbits,” 2025 IEEE International Conference on Cluster Computing Workshops (CLUSTER Workshops)<\/em>, Edinburgh, United Kingdom, 2025, pp. 1-2, doi: 10.1109\/CLUSTERWorkshops65972.2025.11164209<\/a>.<\/p>\n<\/blockquote>\n\n\n\n

The poster is given below:<\/p>\n\n\n\n

\"\"<\/figure>\n","protected":false},"excerpt":{"rendered":"

We attended the CLUSTER 2025 conference organised at the University of Edinburgh, Scotland, United Kingdom, between 2 and 5 September 2025. Syed Tauhidi presented a poster on NI-ORCA, a parallel algorithm designed for multi-core processors to efficiently count non-induced graphlet orbits up to four-clique (K4). Extending the existing ORCA framework, the algorithm operates in three […]<\/p>\n","protected":false},"author":1149,"featured_media":3762,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"_jetpack_memberships_contains_paid_content":false,"footnotes":""},"categories":[152,69],"tags":[],"class_list":{"0":"post-3752","1":"post","2":"type-post","3":"status-publish","4":"format-standard","5":"has-post-thumbnail","7":"category-kelvin-living-lab","8":"category-subgraph-isomorphism","9":"czr-hentry"},"jetpack_featured_media_url":"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-content\/uploads\/sites\/14\/2025\/09\/PXL_20250905_122328203-scaled.jpg","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-json\/wp\/v2\/posts\/3752","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-json\/wp\/v2\/users\/1149"}],"replies":[{"embeddable":true,"href":"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-json\/wp\/v2\/comments?post=3752"}],"version-history":[{"count":2,"href":"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-json\/wp\/v2\/posts\/3752\/revisions"}],"predecessor-version":[{"id":3857,"href":"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-json\/wp\/v2\/posts\/3752\/revisions\/3857"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-json\/wp\/v2\/media\/3762"}],"wp:attachment":[{"href":"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-json\/wp\/v2\/media?parent=3752"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-json\/wp\/v2\/categories?post=3752"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-json\/wp\/v2\/tags?post=3752"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}