{"id":3133,"date":"2024-06-17T06:33:19","date_gmt":"2024-06-17T05:33:19","guid":{"rendered":"https:\/\/blogs.qub.ac.uk\/dipsa\/?page_id=3133"},"modified":"2026-05-01T04:30:34","modified_gmt":"2026-05-01T03:30:34","slug":"technical-posts","status":"publish","type":"page","link":"https:\/\/blogs.qub.ac.uk\/dipsa\/technical-posts\/","title":{"rendered":"Technical Posts"},"content":{"rendered":"<ul class=\"wp-block-latest-posts__list has-dates has-author wp-block-latest-posts\"><li><div class=\"wp-block-latest-posts__featured-image alignleft\"><img decoding=\"async\" width=\"150\" height=\"150\" src=\"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-content\/uploads\/sites\/14\/2024\/08\/cones2-150x150.jpg\" class=\"attachment-thumbnail size-thumbnail wp-post-image\" alt=\"\" style=\"max-width:80px;max-height:80px;\" \/><\/div><a class=\"wp-block-latest-posts__post-title\" href=\"https:\/\/blogs.qub.ac.uk\/dipsa\/random-vertex-relabelling-in-laganlighter\/\">Random Vertex Relabelling in LaganLighter<\/a><div class=\"wp-block-latest-posts__post-author\">by Mohsen Koohi Esfahani<\/div><time datetime=\"2024-08-21T12:37:52+01:00\" class=\"wp-block-latest-posts__post-date\">21 August 2024<\/time><div class=\"wp-block-latest-posts__post-excerpt\">To evaluate the impacts of locality-optimizing reordering algorithms, a baseline is required. To create the baseline a random\u2026 <a class=\"wp-block-latest-posts__read-more\" href=\"https:\/\/blogs.qub.ac.uk\/dipsa\/random-vertex-relabelling-in-laganlighter\/\" rel=\"noopener noreferrer\">Read more<span class=\"screen-reader-text\">: Random Vertex Relabelling in LaganLighter<\/span><\/a><\/div><\/li>\n<li><div class=\"wp-block-latest-posts__featured-image alignleft\"><img decoding=\"async\" width=\"150\" height=\"150\" src=\"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-content\/uploads\/sites\/14\/2024\/08\/trees-150x150.jpg\" class=\"attachment-thumbnail size-thumbnail wp-post-image\" alt=\"\" style=\"max-width:80px;max-height:80px;\" \/><\/div><a class=\"wp-block-latest-posts__post-title\" href=\"https:\/\/blogs.qub.ac.uk\/dipsa\/minimum-spanning-forest-of-ms-biographs\/\">Minimum Spanning Forest of MS-BioGraphs<\/a><div class=\"wp-block-latest-posts__post-author\">by Mohsen Koohi Esfahani<\/div><time datetime=\"2024-08-09T14:11:36+01:00\" class=\"wp-block-latest-posts__post-date\">9 August 2024<\/time><div class=\"wp-block-latest-posts__post-excerpt\">We use MASTIFF to compute the weight of Minimum Spanning Forest (MST) of MS-BioGraphs while ignoring self-edges of\u2026 <a class=\"wp-block-latest-posts__read-more\" href=\"https:\/\/blogs.qub.ac.uk\/dipsa\/minimum-spanning-forest-of-ms-biographs\/\" rel=\"noopener noreferrer\">Read more<span class=\"screen-reader-text\">: Minimum Spanning Forest of MS-BioGraphs<\/span><\/a><\/div><\/li>\n<li><div class=\"wp-block-latest-posts__featured-image alignleft\"><img decoding=\"async\" width=\"150\" height=\"150\" src=\"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-content\/uploads\/sites\/14\/2024\/08\/affinity-150x150.jpg\" class=\"attachment-thumbnail size-thumbnail wp-post-image\" alt=\"\" style=\"max-width:80px;max-height:80px;\" \/><\/div><a class=\"wp-block-latest-posts__post-title\" href=\"https:\/\/blogs.qub.ac.uk\/dipsa\/topology-based-thread-affinity-setting-thread-pinning-in-openmp\/\">Topology-Based Thread Affinity Setting (Thread Pinning) in OpenMP<\/a><div class=\"wp-block-latest-posts__post-author\">by Mohsen Koohi Esfahani<\/div><time datetime=\"2024-08-03T18:07:31+01:00\" class=\"wp-block-latest-posts__post-date\">3 August 2024<\/time><div class=\"wp-block-latest-posts__post-excerpt\">In applications such as graph processing, it is important how threads are pinned on CPU cores as the\u2026 <a class=\"wp-block-latest-posts__read-more\" href=\"https:\/\/blogs.qub.ac.uk\/dipsa\/topology-based-thread-affinity-setting-thread-pinning-in-openmp\/\" rel=\"noopener noreferrer\">Read more<span class=\"screen-reader-text\">: Topology-Based Thread Affinity Setting (Thread Pinning) in OpenMP<\/span><\/a><\/div><\/li>\n<li><div class=\"wp-block-latest-posts__featured-image alignleft\"><img loading=\"lazy\" decoding=\"async\" width=\"150\" height=\"150\" src=\"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-content\/uploads\/sites\/14\/2024\/04\/hedera-helix-150x150.jpg\" class=\"attachment-thumbnail size-thumbnail wp-post-image\" alt=\"\" style=\"max-width:80px;max-height:80px;\" \/><\/div><a class=\"wp-block-latest-posts__post-title\" href=\"https:\/\/blogs.qub.ac.uk\/dipsa\/an-incomplete-list-of-publicly-available-graph-datasets-generators\/\">An (Incomplete) List of Publicly Available Graph Datasets\/Generators<\/a><div class=\"wp-block-latest-posts__post-author\">by Mohsen Koohi Esfahani<\/div><time datetime=\"2024-06-21T13:25:49+01:00\" class=\"wp-block-latest-posts__post-date\">21 June 2024<\/time><div class=\"wp-block-latest-posts__post-excerpt\">Short URL of this post: https:\/\/blogs.qub.ac.uk\/DIPSA\/graphs-list-2024 Real-World Graphs Smaller Graphs Synthetic Graph Generators Technical Posts<\/div><\/li>\n<li><div class=\"wp-block-latest-posts__featured-image alignleft\"><img loading=\"lazy\" decoding=\"async\" width=\"150\" height=\"150\" src=\"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-content\/uploads\/sites\/14\/2024\/04\/passerine-150x150.jpg\" class=\"attachment-thumbnail size-thumbnail wp-post-image\" alt=\"\" style=\"max-width:80px;max-height:80px;\" \/><\/div><a class=\"wp-block-latest-posts__post-title\" href=\"https:\/\/blogs.qub.ac.uk\/dipsa\/an-evaluation-of-bandwidth-of-different-storage-types-hdd-vs-ssd-vs-lustrefs-for-different-block-sizes-and-different-read-methods-mmap-vs-pread-vs-read\/\">An Evaluation of Bandwidth of Different Storage Types (HDD vs. SSD vs. LustreFS) for Different Block Sizes and Different Parallel Read Methods (mmap vs pread vs read)<\/a><div class=\"wp-block-latest-posts__post-author\">by Mohsen Koohi Esfahani<\/div><time datetime=\"2024-04-20T09:48:10+01:00\" class=\"wp-block-latest-posts__post-date\">20 April 2024<\/time><div class=\"wp-block-latest-posts__post-excerpt\">Short URL of this post: https:\/\/blogs.qub.ac.uk\/DIPSA\/HDD-vs-SSD-vs-LustreFS-2024 We evaluate read bandwidth of three storage types: and for three parallel\u2026 <a class=\"wp-block-latest-posts__read-more\" href=\"https:\/\/blogs.qub.ac.uk\/dipsa\/an-evaluation-of-bandwidth-of-different-storage-types-hdd-vs-ssd-vs-lustrefs-for-different-block-sizes-and-different-read-methods-mmap-vs-pread-vs-read\/\" rel=\"noopener noreferrer\">Read more<span class=\"screen-reader-text\">: An Evaluation of Bandwidth of Different Storage Types (HDD vs. SSD vs. LustreFS) for Different Block Sizes and Different Parallel Read Methods (mmap vs pread vs read)<\/span><\/a><\/div><\/li>\n<li><div class=\"wp-block-latest-posts__featured-image alignleft\"><img loading=\"lazy\" decoding=\"async\" width=\"150\" height=\"150\" src=\"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-content\/uploads\/sites\/14\/2023\/11\/ni2-150x150.jpg\" class=\"attachment-thumbnail size-thumbnail wp-post-image\" alt=\"\" style=\"max-width:80px;max-height:80px;\" \/><\/div><a class=\"wp-block-latest-posts__post-title\" href=\"https:\/\/blogs.qub.ac.uk\/dipsa\/simd-bit-twiddling-hacks\/\">SIMD Bit Twiddling Hacks<\/a><div class=\"wp-block-latest-posts__post-author\">by Hans Vandierendonck<\/div><time datetime=\"2023-11-25T14:13:51+00:00\" class=\"wp-block-latest-posts__post-date\">25 November 2023<\/time><div class=\"wp-block-latest-posts__post-excerpt\">The Bit Twiddling Hacks website collects an array of useful code fragments that implement some very specific computations\u2026 <a class=\"wp-block-latest-posts__read-more\" href=\"https:\/\/blogs.qub.ac.uk\/dipsa\/simd-bit-twiddling-hacks\/\" rel=\"noopener noreferrer\">Read more<span class=\"screen-reader-text\">: SIMD Bit Twiddling Hacks<\/span><\/a><\/div><\/li>\n<li><div class=\"wp-block-latest-posts__featured-image alignleft\"><img loading=\"lazy\" decoding=\"async\" width=\"150\" height=\"150\" src=\"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-content\/uploads\/sites\/14\/2022\/12\/cactus-150x150.jpg\" class=\"attachment-thumbnail size-thumbnail wp-post-image\" alt=\"\" style=\"max-width:80px;max-height:80px;\" \/><\/div><a class=\"wp-block-latest-posts__post-title\" href=\"https:\/\/blogs.qub.ac.uk\/dipsa\/laganlighter-source-code\/\">LaganLighter Source Code<\/a><div class=\"wp-block-latest-posts__post-author\">by Mohsen Koohi Esfahani<\/div><time datetime=\"2022-11-14T13:17:17+00:00\" class=\"wp-block-latest-posts__post-date\">14 November 2022<\/time><div class=\"wp-block-latest-posts__post-excerpt\">Repository https:\/\/github.com\/DIPSA-QUB\/LaganLighter Documentation https:\/\/github.com\/DIPS-QUB\/LaganLighter\/tree\/main\/docs Algorithms in This Repo Cloning git clone https:\/\/github.com\/MohsenKoohi\/LaganLighter.git &#8211;recursive Graph Types LaganLighter supports the\u2026 <a class=\"wp-block-latest-posts__read-more\" href=\"https:\/\/blogs.qub.ac.uk\/dipsa\/laganlighter-source-code\/\" rel=\"noopener noreferrer\">Read more<span class=\"screen-reader-text\">: LaganLighter Source Code<\/span><\/a><\/div><\/li>\n<\/ul>","protected":false},"excerpt":{"rendered":"","protected":false},"author":1315,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-3133","page","type-page","status-publish","czr-hentry"],"jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-json\/wp\/v2\/pages\/3133","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-json\/wp\/v2\/users\/1315"}],"replies":[{"embeddable":true,"href":"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-json\/wp\/v2\/comments?post=3133"}],"version-history":[{"count":10,"href":"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-json\/wp\/v2\/pages\/3133\/revisions"}],"predecessor-version":[{"id":3880,"href":"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-json\/wp\/v2\/pages\/3133\/revisions\/3880"}],"wp:attachment":[{"href":"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-json\/wp\/v2\/media?parent=3133"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}