A Burns, R Davis - … of Computer Science, University of York …, 2013 - www-users.york.ac.uk
This review covers research on the topic of mixed criticality systems that has been published since Vestal's 2007 paper. It covers the period up to end of 2021. The review is organised …
We consider the problem of routing traffic to optimize the performance of a congested network. We are given a network, a rate of traffic between each pair of nodes, and a latency …
S Albers - Mathematical Programming, 2003 - Springer
During the last 15 years online algorithms have received considerable research interest. In this survey we give an introduction to the competitive analysis of online algorithms and …
In the single-machine non-clairvoyant scheduling problem, the goal is to minimize the total completion time of jobs whose processing times are unknown a priori. We revisit this well …
Many safety-critical embedded systems are subject to certification requirements; some systems may be required to meet multiple sets of certification requirements, from different …
While methods for optimization under uncertainty have been studied intensely over the past decades, the explicit consideration of the interplay between uncertainty and time has gained …
This book provides a comprehensive overview of both theoretical and pragmatic aspects of resource-allocation and scheduling in multiprocessor and multicore hard-real-time systems …
We consider the scheduling of mixed-criticality task systems, that is, systems where each task to be scheduled has multiple levels of worst-case execution time estimates. We design …
We survey recent research that has appeared in the theoretical computer science literature on algorithmic problems related to power management. We will try to highlight some open …