Prior work has shown that the global earliest-deadline-first (GEDF) scheduling algorithm ensures bounded deadline tardiness on multiprocessors with no utilization loss; therefore...
Abstract-- Scheduling problems are already difficult on traditional parallel machines, and they become extremely challenging on heterogeneous clusters. In this paper we deal with t...
Anne Benoit, Loris Marchal, Jean-Francois Pineau, ...
Aggregate traffic loads and topology in multi-hop wireless networks may vary slowly, permitting MAC protocols to `learn' how to spatially coordinate and adapt contention patte...
Although the diversity of platforms for network experimentation is a boon to the development of protocols and distributed systems, it is challenging to exploit its benefits. Impl...
In multi-core processors there are several ways to pair a thread to a particular core. These load-balancing techniques result in a quite different power, performance and thermal b...