We investigate the problem of partitioning the vertices of a directed acyclic graph into a
given number of parts. The objective function is to minimize the number or the total weight of …

Finding a good partition of a computational directed acyclic graph associated with an
algorithm can help find an execution pattern improving data locality, conduct an analysis of …

In recent years, great efforts have been made to analyze biological systems to understand
the long-run behaviors. As a well-established formalism for modelling real-life biological …

A typical application tuning cycle repeats the following three steps in a loop: performance
measurement, analysis of results, and code refactoring. While performance measurement is …

We investigate efficient execution of computations, modeled as Directed Acyclic Graphs
(DAGs), on a single processor with a two-level memory hierarchy, where there is a limited …

It is too hot in here! A performance, energy and heat aware scheduler for Asymmetric
multiprocessing processors in embedded syst Page 1 It is too hot in here! A performance, energy …

The scientific computing paradigm has transitioned from compute-intensive to I/O-intensive
and memory-intensive in the past decade, especially when data-driven science has become …

Graph partitioning is one of the fundamental problems in many graph-based applications
and systems. It enables the division of a graph into smaller sub-graphs for subsequent …

Task-based execution models have received considerable attention in recent years to meet
the performance challenges facing high-performance computing (HPC). In this paper we …

We summarise our recent research results on developing efficient and scalable control
methods for gene regulatory networks modelled as asynchronous Boolean networks. Our …