{"id":2,"date":"2022-06-24T09:52:05","date_gmt":"2022-06-24T08:52:05","guid":{"rendered":"https:\/\/blogs.qub.ac.uk\/dipsa\/?page_id=2"},"modified":"2026-05-01T22:02:58","modified_gmt":"2026-05-01T21:02:58","slug":"sample-page","status":"publish","type":"page","link":"https:\/\/blogs.qub.ac.uk\/dipsa\/","title":{"rendered":"DIPSA: Data-Intensive Parallel and Scaleable Algorithms"},"content":{"rendered":"\n<h2 data-wp-context---core-fit-text=\"core\/fit-text::{&quot;fontSize&quot;:&quot;&quot;}\" data-wp-init---core-fit-text=\"core\/fit-text::callbacks.init\" data-wp-interactive data-wp-style--font-size=\"core\/fit-text::context.fontSize\" class=\"wp-block-heading has-fit-text\">DIPSA: Data-Intensive Parallel and Scaleable Algorithms<\/h2>\n\n\n\n<figure class=\"wp-block-image size-large is-style-default\"><img fetchpriority=\"high\" decoding=\"async\" width=\"1024\" height=\"317\" src=\"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-content\/uploads\/sites\/14\/2026\/05\/PXL_20231027_160242638-1024x317.jpg\" alt=\"\" class=\"wp-image-3833\" srcset=\"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-content\/uploads\/sites\/14\/2026\/05\/PXL_20231027_160242638-1024x317.jpg 1024w, https:\/\/blogs.qub.ac.uk\/dipsa\/wp-content\/uploads\/sites\/14\/2026\/05\/PXL_20231027_160242638-300x93.jpg 300w, https:\/\/blogs.qub.ac.uk\/dipsa\/wp-content\/uploads\/sites\/14\/2026\/05\/PXL_20231027_160242638-768x238.jpg 768w, https:\/\/blogs.qub.ac.uk\/dipsa\/wp-content\/uploads\/sites\/14\/2026\/05\/PXL_20231027_160242638-1536x476.jpg 1536w, https:\/\/blogs.qub.ac.uk\/dipsa\/wp-content\/uploads\/sites\/14\/2026\/05\/PXL_20231027_160242638-2048x634.jpg 2048w\" sizes=\"(max-width: 1024px) 100vw, 1024px\" \/><\/figure>\n\n\n\n<p>The DIPSA group at Queen\u2019s University, led by <strong><a href=\"https:\/\/blogs.qub.ac.uk\/dipsa\/personal-page-hans-vandierendonck\/\" data-type=\"page\" data-id=\"366\">Hans Vandierendonck<\/a><\/strong>, specialises in creating high-performance, parallel computing solutions for data-heavy applications across scientific computing and machine learning.<\/p>\n\n\n\n<p>Our research focuses on optimising both computing systems and algorithms across four main areas:<\/p>\n\n\n\n<div data-wp-context=\"{ &quot;autoclose&quot;: false, &quot;accordionItems&quot;: [] }\" data-wp-interactive=\"core\/accordion\" role=\"group\" class=\"wp-block-accordion is-layout-flow wp-block-accordion-is-layout-flow\">\n<div data-wp-class--is-open=\"state.isOpen\" data-wp-context=\"{ &quot;id&quot;: &quot;accordion-item-1&quot;, &quot;openByDefault&quot;: false }\" data-wp-init=\"callbacks.initAccordionItems\" data-wp-on-window--hashchange=\"callbacks.hashChange\" class=\"wp-block-accordion-item is-layout-flow wp-block-accordion-item-is-layout-flow\">\n<h3 class=\"wp-block-accordion-heading\"><button aria-expanded=\"false\" aria-controls=\"accordion-item-1-panel\" data-wp-bind--aria-expanded=\"state.isOpen\" data-wp-on--click=\"actions.toggle\" data-wp-on--keydown=\"actions.handleKeyDown\" id=\"accordion-item-1\" type=\"button\" class=\"wp-block-accordion-heading__toggle\"><span class=\"wp-block-accordion-heading__toggle-title\">High-Performance Graph Analytics<\/span><span class=\"wp-block-accordion-heading__toggle-icon\" aria-hidden=\"true\">+<\/span><\/button><\/h3>\n\n\n\n<div inert aria-labelledby=\"accordion-item-1\" data-wp-bind--inert=\"!state.isOpen\" id=\"accordion-item-1-panel\" role=\"region\" class=\"wp-block-accordion-panel is-layout-flow wp-block-accordion-panel-is-layout-flow\">\n<p>Designing algorithms and systems capable of handling massive, rapidly growing graph datasets, specifically addressing challenges like memory locality and combinatorial explosion. <a href=\"https:\/\/blogs.qub.ac.uk\/dipsa\/category\/graph-algorithms\/\" data-type=\"category\" data-id=\"151\"><strong>READ MORE<\/strong><\/a>.<\/p>\n<\/div>\n<\/div>\n\n\n\n<div data-wp-class--is-open=\"state.isOpen\" data-wp-context=\"{ &quot;id&quot;: &quot;accordion-item-2&quot;, &quot;openByDefault&quot;: false }\" data-wp-init=\"callbacks.initAccordionItems\" data-wp-on-window--hashchange=\"callbacks.hashChange\" class=\"wp-block-accordion-item is-layout-flow wp-block-accordion-item-is-layout-flow\">\n<h3 class=\"wp-block-accordion-heading\"><button aria-expanded=\"false\" aria-controls=\"accordion-item-2-panel\" data-wp-bind--aria-expanded=\"state.isOpen\" data-wp-on--click=\"actions.toggle\" data-wp-on--keydown=\"actions.handleKeyDown\" id=\"accordion-item-2\" type=\"button\" class=\"wp-block-accordion-heading__toggle\"><span class=\"wp-block-accordion-heading__toggle-title\">Transprecise and Approximate Computing<\/span><span class=\"wp-block-accordion-heading__toggle-icon\" aria-hidden=\"true\">+<\/span><\/button><\/h3>\n\n\n\n<div inert aria-labelledby=\"accordion-item-2\" data-wp-bind--inert=\"!state.isOpen\" id=\"accordion-item-2-panel\" role=\"region\" class=\"wp-block-accordion-panel is-layout-flow wp-block-accordion-panel-is-layout-flow\">\n<p>Improving system speed, power, and energy efficiency by strategically trading off exact computational precision in applications where absolute accuracy is unnecessary. <a href=\"https:\/\/blogs.qub.ac.uk\/dipsa\/category\/transprecision\/\" data-type=\"category\" data-id=\"31\"><strong>READ MORE.<\/strong><\/a><\/p>\n<\/div>\n<\/div>\n\n\n\n<div data-wp-class--is-open=\"state.isOpen\" data-wp-context=\"{ &quot;id&quot;: &quot;accordion-item-3&quot;, &quot;openByDefault&quot;: false }\" data-wp-init=\"callbacks.initAccordionItems\" data-wp-on-window--hashchange=\"callbacks.hashChange\" class=\"wp-block-accordion-item is-layout-flow wp-block-accordion-item-is-layout-flow\">\n<h3 class=\"wp-block-accordion-heading\"><button aria-expanded=\"false\" aria-controls=\"accordion-item-3-panel\" data-wp-bind--aria-expanded=\"state.isOpen\" data-wp-on--click=\"actions.toggle\" data-wp-on--keydown=\"actions.handleKeyDown\" id=\"accordion-item-3\" type=\"button\" class=\"wp-block-accordion-heading__toggle\"><span class=\"wp-block-accordion-heading__toggle-title\">Machine Learning<\/span><span class=\"wp-block-accordion-heading__toggle-icon\" aria-hidden=\"true\">+<\/span><\/button><\/h3>\n\n\n\n<div inert aria-labelledby=\"accordion-item-3\" data-wp-bind--inert=\"!state.isOpen\" id=\"accordion-item-3-panel\" role=\"region\" class=\"wp-block-accordion-panel is-layout-flow wp-block-accordion-panel-is-layout-flow\">\n<p>Developing solutions for new machine learning tasks, building upon their foundational research in transprecise computing and graph algorithms. <strong><a href=\"https:\/\/blogs.qub.ac.uk\/dipsa\/machine-learning\/\" data-type=\"page\" data-id=\"290\">READ MORE.<\/a><\/strong><\/p>\n<\/div>\n<\/div>\n\n\n\n<div data-wp-class--is-open=\"state.isOpen\" data-wp-context=\"{ &quot;id&quot;: &quot;accordion-item-4&quot;, &quot;openByDefault&quot;: false }\" data-wp-init=\"callbacks.initAccordionItems\" data-wp-on-window--hashchange=\"callbacks.hashChange\" class=\"wp-block-accordion-item is-layout-flow wp-block-accordion-item-is-layout-flow\">\n<h3 class=\"wp-block-accordion-heading\"><button aria-expanded=\"false\" aria-controls=\"accordion-item-4-panel\" data-wp-bind--aria-expanded=\"state.isOpen\" data-wp-on--click=\"actions.toggle\" data-wp-on--keydown=\"actions.handleKeyDown\" id=\"accordion-item-4\" type=\"button\" class=\"wp-block-accordion-heading__toggle\"><span class=\"wp-block-accordion-heading__toggle-title\">Software Speculative Execution for Large-Scale Systems<\/span><span class=\"wp-block-accordion-heading__toggle-icon\" aria-hidden=\"true\">+<\/span><\/button><\/h3>\n\n\n\n<div inert aria-labelledby=\"accordion-item-4\" data-wp-bind--inert=\"!state.isOpen\" id=\"accordion-item-4-panel\" role=\"region\" class=\"wp-block-accordion-panel is-layout-flow wp-block-accordion-panel-is-layout-flow\">\n<p>Improving parallel scalability of scientific computations by speculating around communication bottlenecks.<\/p>\n<\/div>\n<\/div>\n<\/div>\n\n\n\n<h2 class=\"wp-block-heading\">Latest Posts<\/h2>\n\n\n<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\/2025\/08\/cf973c88-02be-4493-b13c-3face3e98b73-150x150.jpg\" class=\"attachment-thumbnail size-thumbnail wp-post-image\" alt=\"\" style=\"max-width:150px;max-height:150px;\" \/><\/div><a class=\"wp-block-latest-posts__post-title\" href=\"https:\/\/blogs.qub.ac.uk\/dipsa\/user-behaviour-on-kelvin2-hpc\/\">User behaviour on Kelvin2 HPC<\/a><div class=\"wp-block-latest-posts__post-author\">by Syed Tauhidi<\/div><time datetime=\"2026-05-01T05:11:51+01:00\" class=\"wp-block-latest-posts__post-date\">1 May 2026<\/time><div class=\"wp-block-latest-posts__post-excerpt\">1. User Job Distribution: A Heavy-Tailed Workload The cluster&#8217;s workload is heavily concentrated among a\u2026 <a class=\"wp-block-latest-posts__read-more\" href=\"https:\/\/blogs.qub.ac.uk\/dipsa\/user-behaviour-on-kelvin2-hpc\/\" rel=\"noopener noreferrer\">Read more<span class=\"screen-reader-text\">: User behaviour on Kelvin2 HPC<\/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\/2026\/05\/DATA4-Group-DATACENTER-150x150.jpeg\" class=\"attachment-thumbnail size-thumbnail wp-post-image\" alt=\"\" style=\"max-width:150px;max-height:150px;\" srcset=\"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-content\/uploads\/sites\/14\/2026\/05\/DATA4-Group-DATACENTER-150x150.jpeg 150w, https:\/\/blogs.qub.ac.uk\/dipsa\/wp-content\/uploads\/sites\/14\/2026\/05\/DATA4-Group-DATACENTER-510x510.jpeg 510w\" sizes=\"(max-width: 150px) 100vw, 150px\" \/><\/div><a class=\"wp-block-latest-posts__post-title\" href=\"https:\/\/blogs.qub.ac.uk\/dipsa\/analysis-of-kelvin2-slurm-logs\/\">Analysis of Kelvin2 SLURM logs<\/a><div class=\"wp-block-latest-posts__post-author\">by Syed Tauhidi<\/div><time datetime=\"2026-05-01T04:49:56+01:00\" class=\"wp-block-latest-posts__post-date\">1 May 2026<\/time><div class=\"wp-block-latest-posts__post-excerpt\">1. What predicts the waiting time? The factors that best predict how long a job\u2026 <a class=\"wp-block-latest-posts__read-more\" href=\"https:\/\/blogs.qub.ac.uk\/dipsa\/analysis-of-kelvin2-slurm-logs\/\" rel=\"noopener noreferrer\">Read more<span class=\"screen-reader-text\">: Analysis of Kelvin2 SLURM logs<\/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\/2026\/04\/IMG_5345-150x150.jpeg\" class=\"attachment-thumbnail size-thumbnail wp-post-image\" alt=\"\" style=\"max-width:150px;max-height:150px;\" srcset=\"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-content\/uploads\/sites\/14\/2026\/04\/IMG_5345-150x150.jpeg 150w, https:\/\/blogs.qub.ac.uk\/dipsa\/wp-content\/uploads\/sites\/14\/2026\/04\/IMG_5345-510x510.jpeg 510w\" sizes=\"(max-width: 150px) 100vw, 150px\" \/><\/div><a class=\"wp-block-latest-posts__post-title\" href=\"https:\/\/blogs.qub.ac.uk\/dipsa\/mini-workshop-organised-at-collaboration-workshop-2026-cw26\/\">The Role of Research Software in Sustainable Computing<\/a><div class=\"wp-block-latest-posts__post-author\">by Syed Tauhidi<\/div><time datetime=\"2026-04-30T20:18:42+01:00\" class=\"wp-block-latest-posts__post-date\">30 April 2026<\/time><div class=\"wp-block-latest-posts__post-excerpt\">On 29 April 2026, during the Software Sustainability Institute&#8217;s (SSI) Collaborations Workshop 2026 (CW26) organised\u2026 <a class=\"wp-block-latest-posts__read-more\" href=\"https:\/\/blogs.qub.ac.uk\/dipsa\/mini-workshop-organised-at-collaboration-workshop-2026-cw26\/\" rel=\"noopener noreferrer\">Read more<span class=\"screen-reader-text\">: The Role of Research Software in Sustainable Computing<\/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\/12\/PXL_20241210_082602436-150x150.jpg\" class=\"attachment-thumbnail size-thumbnail wp-post-image\" alt=\"\" style=\"max-width:150px;max-height:150px;\" srcset=\"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-content\/uploads\/sites\/14\/2024\/12\/PXL_20241210_082602436-150x150.jpg 150w, https:\/\/blogs.qub.ac.uk\/dipsa\/wp-content\/uploads\/sites\/14\/2024\/12\/PXL_20241210_082602436-510x510.jpg 510w\" sizes=\"(max-width: 150px) 100vw, 150px\" \/><\/div><a class=\"wp-block-latest-posts__post-title\" href=\"https:\/\/blogs.qub.ac.uk\/dipsa\/introducing-urja\/\">Introducing URJA<\/a><div class=\"wp-block-latest-posts__post-author\">by Syed Tauhidi<\/div><time datetime=\"2026-03-01T03:46:52+00:00\" class=\"wp-block-latest-posts__post-date\">1 March 2026<\/time><div class=\"wp-block-latest-posts__post-excerpt\">In the world of high-performance computing, we often prioritise speed above all else. But as\u2026 <a class=\"wp-block-latest-posts__read-more\" href=\"https:\/\/blogs.qub.ac.uk\/dipsa\/introducing-urja\/\" rel=\"noopener noreferrer\">Read more<span class=\"screen-reader-text\">: Introducing URJA<\/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\/2025\/11\/1-150x150.jpg\" class=\"attachment-thumbnail size-thumbnail wp-post-image\" alt=\"\" style=\"max-width:150px;max-height:150px;\" \/><\/div><a class=\"wp-block-latest-posts__post-title\" href=\"https:\/\/blogs.qub.ac.uk\/dipsa\/paragrapher-a-parallel-and-distributed-graph-loading-library-for-large-scale-compressed-graphs-bigdata25\/\">ParaGrapher: A Parallel and Distributed Graph Loading Library for Large-Scale Compressed Graphs &#8211; BigData&#8217;25 (Short Paper)<\/a><div class=\"wp-block-latest-posts__post-author\">by Mohsen Koohi Esfahani<\/div><time datetime=\"2025-11-08T12:02:51+00:00\" class=\"wp-block-latest-posts__post-date\">8 November 2025<\/time><div class=\"wp-block-latest-posts__post-excerpt\">DOI: 10.1109\/BigData66926.2025.11401782 Whereas the literature describes an increasing number of graph algorithms, loading graphs remains\u2026 <a class=\"wp-block-latest-posts__read-more\" href=\"https:\/\/blogs.qub.ac.uk\/dipsa\/paragrapher-a-parallel-and-distributed-graph-loading-library-for-large-scale-compressed-graphs-bigdata25\/\" rel=\"noopener noreferrer\">Read more<span class=\"screen-reader-text\">: ParaGrapher: A Parallel and Distributed Graph Loading Library for Large-Scale Compressed Graphs &#8211; BigData&#8217;25 (Short Paper)<\/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\/2026\/04\/20251104_120159658_iOS-1-150x150.jpg\" class=\"attachment-thumbnail size-thumbnail wp-post-image\" alt=\"\" style=\"max-width:150px;max-height:150px;\" srcset=\"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-content\/uploads\/sites\/14\/2026\/04\/20251104_120159658_iOS-1-150x150.jpg 150w, https:\/\/blogs.qub.ac.uk\/dipsa\/wp-content\/uploads\/sites\/14\/2026\/04\/20251104_120159658_iOS-1-510x510.jpg 510w\" sizes=\"(max-width: 150px) 100vw, 150px\" \/><\/div><a class=\"wp-block-latest-posts__post-title\" href=\"https:\/\/blogs.qub.ac.uk\/dipsa\/we-were-at-the-ni-hpc-conference\/\">Talk and poster presentation at the NI-HPC 2025 conference<\/a><div class=\"wp-block-latest-posts__post-author\">by Syed Tauhidi<\/div><time datetime=\"2025-11-05T16:40:00+00:00\" class=\"wp-block-latest-posts__post-date\">5 November 2025<\/time><div class=\"wp-block-latest-posts__post-excerpt\">We attended the NI-HPC conference held on 4 November 2025 at Riddel Hall, Queen&#8217;s University,\u2026 <a class=\"wp-block-latest-posts__read-more\" href=\"https:\/\/blogs.qub.ac.uk\/dipsa\/we-were-at-the-ni-hpc-conference\/\" rel=\"noopener noreferrer\">Read more<span class=\"screen-reader-text\">: Talk and poster presentation at the NI-HPC 2025 conference<\/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\/12\/Screenshot-from-2025-11-09-11-46-42-150x150.png\" class=\"attachment-thumbnail size-thumbnail wp-post-image\" alt=\"\" style=\"max-width:150px;max-height:150px;\" \/><\/div><a class=\"wp-block-latest-posts__post-title\" href=\"https:\/\/blogs.qub.ac.uk\/dipsa\/orbitsi-is-now-on-pypi\/\">OrbitSI is now on PyPi<\/a><div class=\"wp-block-latest-posts__post-author\">by Syed Tauhidi<\/div><time datetime=\"2025-11-05T01:08:43+00:00\" class=\"wp-block-latest-posts__post-date\">5 November 2025<\/time><div class=\"wp-block-latest-posts__post-excerpt\">OrbitSI is an open-source Python framework designed to efficiently solve the subgraph isomorphism enumeration problem,\u2026 <a class=\"wp-block-latest-posts__read-more\" href=\"https:\/\/blogs.qub.ac.uk\/dipsa\/orbitsi-is-now-on-pypi\/\" rel=\"noopener noreferrer\">Read more<span class=\"screen-reader-text\">: OrbitSI is now on PyPi<\/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\/08\/trees-150x150.jpg\" class=\"attachment-thumbnail size-thumbnail wp-post-image\" alt=\"\" style=\"max-width:150px;max-height:150px;\" \/><\/div><a class=\"wp-block-latest-posts__post-title\" href=\"https:\/\/blogs.qub.ac.uk\/dipsa\/wasp-efficient-asynchronous-single-source-shortest-path-on-multicore-systems-via-work-stealing-sc25\/\">Wasp: Efficient Asynchronous Single-Source Shortest Path on Multicore Systems via Work Stealing &#8211; SC&#8217;25<\/a><div class=\"wp-block-latest-posts__post-author\">by admin<\/div><time datetime=\"2025-10-20T23:23:52+01:00\" class=\"wp-block-latest-posts__post-date\">20 October 2025<\/time><div class=\"wp-block-latest-posts__post-excerpt\">DIPSA presents a research paper at SC&#8217;25!<\/div><\/li>\n<li><a class=\"wp-block-latest-posts__post-title\" href=\"https:\/\/blogs.qub.ac.uk\/dipsa\/a-novel-multi-view-perspective-on-xai-for-time-series-classification-%f0%9f%a4%96%f0%9f%94%8d\/\">New Research Paper &#8211; A Novel Multi-View Perspective on XAI for Time Series Classification \ud83e\udd16\ud83d\udd0d<\/a><div class=\"wp-block-latest-posts__post-author\">by Hung Viet Tran<\/div><time datetime=\"2025-09-30T23:47:55+01:00\" class=\"wp-block-latest-posts__post-date\">30 September 2025<\/time><div class=\"wp-block-latest-posts__post-excerpt\">The &#8220;black box&#8221; nature of many AI models causes hesitation in trusting their predictions, especially\u2026 <a class=\"wp-block-latest-posts__read-more\" href=\"https:\/\/blogs.qub.ac.uk\/dipsa\/a-novel-multi-view-perspective-on-xai-for-time-series-classification-%f0%9f%a4%96%f0%9f%94%8d\/\" rel=\"noopener noreferrer\">Read more<span class=\"screen-reader-text\">: New Research Paper &#8211; A Novel Multi-View Perspective on XAI for Time Series Classification \ud83e\udd16\ud83d\udd0d<\/span><\/a><\/div><\/li>\n<li><a class=\"wp-block-latest-posts__post-title\" href=\"https:\/\/blogs.qub.ac.uk\/dipsa\/invited-talk-efficient-computation-through-tuned-approximation-by-david-keyes\/\">Invited Talk &#8211; Efficient\u00a0Computation through Tuned Approximation by David Keyes<\/a><div class=\"wp-block-latest-posts__post-author\">by Hans Vandierendonck<\/div><time datetime=\"2025-09-15T16:24:39+01:00\" class=\"wp-block-latest-posts__post-date\">15 September 2025<\/time><div class=\"wp-block-latest-posts__post-excerpt\">21 February 2024 Abstract Numerical\u00a0software is being reinvented to provide opportunities to tune dynamically the\u00a0accuracy\u2026 <a class=\"wp-block-latest-posts__read-more\" href=\"https:\/\/blogs.qub.ac.uk\/dipsa\/invited-talk-efficient-computation-through-tuned-approximation-by-david-keyes\/\" rel=\"noopener noreferrer\">Read more<span class=\"screen-reader-text\">: Invited Talk &#8211; Efficient\u00a0Computation through Tuned Approximation by David Keyes<\/span><\/a><\/div><\/li>\n<\/ul>","protected":false},"excerpt":{"rendered":"<p>DIPSA: Data-Intensive Parallel and Scaleable Algorithms The DIPSA group at Queen\u2019s University, led by Hans Vandierendonck, specialises in creating high-performance, parallel computing solutions for data-heavy applications across scientific computing and machine learning. Our research focuses on optimising both computing systems and algorithms across four main areas: Latest Posts<\/p>\n","protected":false},"author":974,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"open","template":"","meta":{"footnotes":""},"class_list":["post-2","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\/2","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\/974"}],"replies":[{"embeddable":true,"href":"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-json\/wp\/v2\/comments?post=2"}],"version-history":[{"count":93,"href":"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-json\/wp\/v2\/pages\/2\/revisions"}],"predecessor-version":[{"id":3940,"href":"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-json\/wp\/v2\/pages\/2\/revisions\/3940"}],"wp:attachment":[{"href":"https:\/\/blogs.qub.ac.uk\/dipsa\/wp-json\/wp\/v2\/media?parent=2"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}