Computing the Scanwidth of Directed Acyclic Graphs

Phylogenetic networks are a specific type of directed acyclic graph (DAG), used to depict evolutionary relationships among, for example, species or other groups of organisms. To solve computationally hard problems, treewidth has been used to parametrize algorithms in phylogenetics. In the hope of simplifying the algorithmic design process, Berry...

Managing complexity of Digital Twin models: Development of NewMODE as a network theory approach to model decomposition

Modelling and simulation is at the heart of Digital Twin technology, which is revolutionising many industries. Organisations have access to legacy models that are too complex to maintain, preventing them from operationalising complex systems like Digital Twin. By creating an automated tool for model decomposition, it is possible to breathe life...

Scheduling Workloads of Workflows in Clusters and Clouds

This dissertation addresses three key challenges that are characteristic to the online scheduling of workloads of workflows in modern distributed computing systems. The first challenge is the realistic estimation of the resource demand of a workflow, as it is important for making good task placement and resource allocation decisions. Usually,...

Automated Multi-core Scheduling for an Industrial-sized Mechatronic Motion Control Platform

Mechatronic embedded control systems are becoming increasingly sophisticated and computationally demanding. These systems typically consists of multiple controllers, which coordinate the actuators and apply feedback based on data collected by sensors. Often the underlying control strategy is entirely described in a software application, which...