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
Streaming processing is an important technology that finds applications in networking, multimedia, s...
We aim at finding optimal mappings for concurrent streaming applications. Each application consists ...
International audienceIn this paper, we study the problem of finding optimal mappings for several in...
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 ...
Mapping applications onto heterogeneous platforms is a difficult challenge, even for simple applicat...
In this report, we consider the problem of scheduling streaming applications described by complex ta...
(ENG) Mapping applications onto heterogeneous platforms is a difficult challenge, even for simple ap...
International audienceIn this paper, we investigate how to compute the throughput of probabilistic a...
In this paper, we explore the problem of mapping filtering streaming applications on large-scale hom...
20 pagesIn this paper, we focus on computing the throughput of replicated workflows. Given a streami...
Streaming processing is an important technology that finds applications in networking, multimedia, s...
We aim at finding optimal mappings for concurrent streaming applications. Each application consists ...
International audienceIn this paper, we study the problem of finding optimal mappings for several in...
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 ...
Mapping applications onto heterogeneous platforms is a difficult challenge, even for simple applicat...
In this report, we consider the problem of scheduling streaming applications described by complex ta...
(ENG) Mapping applications onto heterogeneous platforms is a difficult challenge, even for simple ap...
International audienceIn this paper, we investigate how to compute the throughput of probabilistic a...
In this paper, we explore the problem of mapping filtering streaming applications on large-scale hom...
20 pagesIn this paper, we focus on computing the throughput of replicated workflows. Given a streami...
Streaming processing is an important technology that finds applications in networking, multimedia, s...
We aim at finding optimal mappings for concurrent streaming applications. Each application consists ...
International audienceIn this paper, we study the problem of finding optimal mappings for several in...