In this paper, we deal with the problem of scheduling streaming applications on unreliable heterogeneous platforms. We use the realistic one-port model with full computation/communication overlap. We deal with three optimization objectives. The first two, latency and throughput, are performance-related while the third, tolerating a given number of processor failures, is reliability-oriented. The major contribution of this paper is the design of a new scheduling algorithm to minimize latency under both throughput and reliability constraints. We provide a comprehensive set of experimental results, that fully demonstrate the usefulness of the proposed algorithm
International audienceWe aim at finding optimal mappings for concurrent streaming applications. Each...
Abstract—We consider the problem of scheduling packets in an input queued switch with a focus on pro...
International audienceIn this paper, we focus on computing the throughput of replicated workflows. G...
In this paper, we deal with the problem of scheduling streaming applications on unreliable heterogen...
International audienceIn this paper, we study the problem of optimizing the throughput of streaming ...
In this paper, we focus on solving the problem of removing inter-core communication overhead for str...
Streaming processing is an important technology that finds applications in networking, multimedia, s...
Abstract—In this paper, we study the problem of minimiz-ing the number of processors required for sc...
In this paper, we jointly optimize computation and communication task scheduling for streaming appli...
In this document, I explore the problem of scheduling pipelined applications onto large-scale distri...
In this report, we consider the problem of scheduling streaming applications described by complex ta...
International audienceStreaming applications come from various application fields such as physics, w...
International audienceIn this paper, we explore the complexity of mapping filtering streaming applic...
For real-time streaming applications such as video decoding, the rate of the application is very imp...
International audienceWe aim at finding optimal mappings for concurrent streaming applications. Each...
Abstract—We consider the problem of scheduling packets in an input queued switch with a focus on pro...
International audienceIn this paper, we focus on computing the throughput of replicated workflows. G...
In this paper, we deal with the problem of scheduling streaming applications on unreliable heterogen...
International audienceIn this paper, we study the problem of optimizing the throughput of streaming ...
In this paper, we focus on solving the problem of removing inter-core communication overhead for str...
Streaming processing is an important technology that finds applications in networking, multimedia, s...
Abstract—In this paper, we study the problem of minimiz-ing the number of processors required for sc...
In this paper, we jointly optimize computation and communication task scheduling for streaming appli...
In this document, I explore the problem of scheduling pipelined applications onto large-scale distri...
In this report, we consider the problem of scheduling streaming applications described by complex ta...
International audienceStreaming applications come from various application fields such as physics, w...
International audienceIn this paper, we explore the complexity of mapping filtering streaming applic...
For real-time streaming applications such as video decoding, the rate of the application is very imp...
International audienceWe aim at finding optimal mappings for concurrent streaming applications. Each...
Abstract—We consider the problem of scheduling packets in an input queued switch with a focus on pro...
International audienceIn this paper, we focus on computing the throughput of replicated workflows. G...