Publications related to Online Energy-Efficient Task-Graph Scheduling for Multicore Platforms

Prioritized Distributed Video Delivery with Randomized Network Coding

Pascal Frossard, Nikolaos Thomos, Jakov Cakareski

We address the problem of prioritized video streaming over lossy overlay networks. We propose to exploit network path diversity via a novel Randomized Network Coding (RNC) approach that provides unequal error protection (UEP) to the packets conveying the v ...

2011

EDF-schedulability of synchronous periodic task systems is coNP-hard

Friedrich Eisenbrand, Thomas Rothvoss

In the synchronous periodic task model, a set \tau_1,...,\tau_n of tasks is given, each releasing jobs of running time c_i with relative deadline d_i, at each integer multiple of the period p_i. It is a classical result that Earliest Deadline First (EDF) i ...

2010

Scheduling periodic tasks in a hard real-time environment

Friedrich Eisenbrand, Martin Niemeier, Nicolai Hähnle

We give a rigorous account on the complexity landscape of an important real-time scheduling problem that occurs in the design of software-based aircraft control. The goal is to distribute tasks

\tau_i=(c_i,p_i)

on a minimum number of identical machines a ...

Springer-Verlag2010

Prioritized Distributed Video Delivery with Randomized Network Coding

Pascal Frossard, Nikolaos Thomos, Jakov Cakareski

We address the problem of prioritized video streaming over lossy overlay networks. We propose to exploit network path diversity via a novel Randomized Network Coding (RNC) approach that provides unequal error protection (UEP) to the packets conveying the v ...

2010

On the computational complexity of periodic scheduling

Thomas Rothvoss

In periodic scheduling jobs arrive regularly and have to be executed on one or several machines or processors. An enormous amount of literature has been published on this topic, e.g. the founding work of Liu & Layland [LL73] is among the top cited computer ...

EPFL2009

Exact quantification of the sub-optimality of uniprocessor fixed-priority pre- emptive scheduling

Thomas Rothvoss

This paper examines the relative effectiveness of fixed priority pre-emptive scheduling in a uniprocessor system, compared to an optimal algorithm. The quantitative metric used in this comparison is the processor speedup factor, equivalent to the factor by ...

2009

Forward Error Correction for Multipath Media Streaming

Pascal Frossard, Aleksandar Jovanovic, Dan Jurca

We address the problem of joint optimal rate allocation and scheduling between media source rate and error protection rate in scalable streaming applications over lossy multipath networks. Starting from a distortion representation of the received media inf ...

Institute of Electrical and Electronics Engineers2009

Multi-experts scheduling system for real-time applications

Mario Bellino

This thesis focuses on the decisional process of autonomous systems, and more particularly, on the way to take a decision when the time at disposal in order to assess the whole situation is shorter than necessary. Indeed, numerous systems propose solutions ...

EPFL2009

Multi-Agent Adaptive Mechanism Leading to Optimal Real-Time Load Sharing

Max-Olivier Hongler, Olivier Gallay

We propose a new real-time load sharing policy (LSP), which optimally dispatches the incoming workload according to the current availability of the operators. Optimality means here that the global service permanently requires the engagement of a minimum nu ...

2009

A PTAS for Static Priority Real-Time Scheduling with Resource Augmentation

Friedrich Eisenbrand, Thomas Rothvoss

We present a polynomial time approximation scheme for the real-time scheduling problem with fixed priorities when resource augmentation is allowed. For a fixed ε > 0, our algorithmcomputes an assignment using atmost (1+ε)·OPT +1 processors in polynomial ti ...

Springer2008

Online Energy-Efficient Task-Graph Scheduling for Multicore Platforms

Graph Chatbot

Chat with Graph Search

Prioritized Distributed Video Delivery with Randomized Network Coding

EDF-schedulability of synchronous periodic task systems is coNP-hard

Scheduling periodic tasks in a hard real-time environment

Prioritized Distributed Video Delivery with Randomized Network Coding

On the computational complexity of periodic scheduling

Exact quantification of the sub-optimality of uniprocessor fixed-priority pre- emptive scheduling

Forward Error Correction for Multipath Media Streaming

Multi-experts scheduling system for real-time applications

Multi-Agent Adaptive Mechanism Leading to Optimal Real-Time Load Sharing

A PTAS for Static Priority Real-Time Scheduling with Resource Augmentation

Multi-experts scheduling system for real-time applications

EDF-schedulability of synchronous periodic task systems is coNP-hard

Prioritized Distributed Video Delivery with Randomized Network Coding

Scheduling periodic tasks in a hard real-time environment

Prioritized Distributed Video Delivery with Randomized Network Coding

On the computational complexity of periodic scheduling

Exact quantification of the sub-optimality of uniprocessor fixed-priority pre- emptive scheduling

A PTAS for Static Priority Real-Time Scheduling with Resource Augmentation

Multi-Agent Adaptive Mechanism Leading to Optimal Real-Time Load Sharing

Forward Error Correction for Multipath Media Streaming