We study the problem of scheduling unit size jobs on n processors connected by a ring. We show a distributed algorithm for this problem with an approximation ratio of 3 2 + √ 2....
We present a scheme to guarantee that the execution of real-time tasks can tolerate transient and intermittent faults assuming any queue- based scheduling technique. The scheme is...
In this paper we study the problem of scheduling wireless links in the geometric SINR model, which explicitly uses the fact that nodes are distributed in the Euclidean plane. We p...
Olga Goussevskaia, Yvonne Anne Oswald, Roger Watte...
Abstract—We study the joint power control and minimumframe-length scheduling problem in wireless networks, under the physical interference model and subject to consecutive transm...
We devise the first constant-approximate feasibility test for sporadic multiprocessor real-time scheduling. We give an algorithm that, given a task system and > 0, correctly de...
Vincenzo Bonifaci, Alberto Marchetti-Spaccamela, S...