Influence maximization (IM) is the problem of finding the k most influential nodes in a graph.
We propose distributed-memory parallel algorithms for the two main kernels of a state-of-the …

The field of computational science [1] emerged at the crossroads of computer science,
information technologies, and mathematical modeling. As a vast interdisciplinary domain, it …

The ubiquitous usage of social media and other internet platforms has led to the widespread
proliferation of naturally occurring social networks. This has caused a revolution in …

With the growing complexity of modern internet networks, we introduce a distributed,
asynchronous, and scalable algorithm tailored for determining the centrality and importance …

In this work-in-progress research paper, we make the case for using Rust to develop
applications in the High Performance Computing (HPC) domain which is critically …

The computation of genome similarity is important in computational biology applications,
and is assessed by calculating the Jaccard similarity of DNA sequencing sets. However, it's …

We use genome assembly as a representative case to showcase the use of the 'actor
model', a novel programming system for highperformance data-intensive workloads. The …

Bulk synchronous programming (in distributedmemory systems) and the fork-join pattern (in
shared-memory systems) are often used for problems where independent processes must …

A Fine-grained Asynchronous Bulk Synchronous Parallel (FA-BSP) model is an extended
version of the existing BSP model that facilitates fine-grained asynchronous point-topoint …

The discussion around “safe” programming languages has significantly increased in recent
years, and is impacting how governments, industry, and academia plan to develop current …