Publications related to Near-optimal Deployment of Dataflow Applications on Many-core Platforms with Real-time Guarantees

Real-Time Hardware Implementation of Multi-Resolution Image Blending

Alexandre Schmid, Yusuf Leblebici, Vladan Popovic, Kerem Seyid

A novel real-time implementation of a multi-resolution image blending algorithm is presented in this paper. A multi-resolution decomposition of the input is used to blend multiple images at different scales. Processing time is shortened by designing a pipe ...

2013

Approximation Algorithms for Modern Multi-Processor Scheduling Problems

Martin Niemeier

This thesis is devoted to the design and analysis of algorithms for scheduling problems. These problems are ubiquitous in the modern world. Examples include the optimization of local transportation, managing access to concurrent resources like runways at a ...

EPFL2012

Enhanced Omnidirectional Image Reconstruction Algorithm and its Real-Time Hardware

Alexandre Schmid, Yusuf Leblebici, Hossein Afshari, Abdulkadir Akin

Omnidirectional stereoscopy and depth estimation are complex problems of image processing to which the Panoptic camera offers a novel solution. The Panoptic camera is a biologically-inspired vision sensor made of multiple cameras. It is a polydioptric syst ...

2012

Partitioned real-time scheduling on heterogeneous shared-memory multiprocessors

Martin Niemeier

We consider several real-time scheduling problems on heterogeneous multiprocessor platforms, in which the different processors share a common memory pool. These include (i)~scheduling a collection of implicit-deadline sporadic tasks with the objective of m ...

2011

Dataflow Programming for Systems Design Space Exploration for Multicore Platforms

Christophe Lucarz

Nowadays processing systems are asked to support increasing complex and demanding high-performance applications, especially in the signal processing and video processing domains. The design of these systems are becoming extremely challenging because of sev ...

EPFL2011

Methodology for the Hardware/Software Co-Design of Dataflow Programs

Marco Mattavelli, Ghislain Roquier, Richard Thavot

New generations of multi-core processors and reconfigurable hardware platforms are expected to provide a dramatic increase of processing capabilities. However, one obstacle for exploiting all the promises of such new platforms is the legacy of current appl ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2011

Methodology For The Hardware/Software Co-Design Of Dataflow Programs

Marco Mattavelli, Ghislain Roquier, Richard Thavot

New generations of multi-core processors and reconfigurable hardware platforms are expected to provide a dramatic increase of processing capabilities. However, one obstacle for exploiting all the promises of such new platforms is the legacy of current appl ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2011

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

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

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

Near-optimal Deployment of Dataflow Applications on Many-core Platforms with Real-time Guarantees

Graph Chatbot

Chat with Graph Search

Real-Time Hardware Implementation of Multi-Resolution Image Blending

Approximation Algorithms for Modern Multi-Processor Scheduling Problems

Enhanced Omnidirectional Image Reconstruction Algorithm and its Real-Time Hardware

Partitioned real-time scheduling on heterogeneous shared-memory multiprocessors

Dataflow Programming for Systems Design Space Exploration for Multicore Platforms

Methodology for the Hardware/Software Co-Design of Dataflow Programs

Methodology For The Hardware/Software Co-Design Of Dataflow Programs

Scheduling periodic tasks in a hard real-time environment

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

On the computational complexity of periodic scheduling

Enhanced Omnidirectional Image Reconstruction Algorithm and its Real-Time Hardware

Real-Time Hardware Implementation of Multi-Resolution Image Blending

Approximation Algorithms for Modern Multi-Processor Scheduling Problems

Dataflow Programming for Systems Design Space Exploration for Multicore Platforms

Partitioned real-time scheduling on heterogeneous shared-memory multiprocessors

Methodology for the Hardware/Software Co-Design of Dataflow Programs

Methodology For The Hardware/Software Co-Design Of Dataflow Programs

On the computational complexity of periodic scheduling

Scheduling periodic tasks in a hard real-time environment

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