We evaluate the average-case performance of three approximation algorithms for online non-clairvoyant scheduling of parallel tasks with precedence constraints. We show that for a ...
This paper deals with the problem of scheduling aperiodic groups of tasks in distributed systems. It proposes two contributions, namely: i) a distributed scheduling algorithm to b...
Paolo Bizzarri, Andrea Bondavalli, Felicita Di Gia...
— We study the performance of fair physical layer schedulers that select a pair of orthogonal users for simultaneous transmission. The schemes rely on partial channel state infor...
Alexis A. Dowhuszko, Graciela Corral-Briones, Jyri...
The fitness landscape of the resource constrained project scheduling problem is investigated by examining the search space position type distribution and the correlation between t...
Conditional real-time task models, which are generalizations of periodic, sporadic, and multi-frame tasks, represent real world applications more accurately. These models can be c...
Madhukar Anand, Arvind Easwaran, Sebastian Fischme...