Scheduling complex streaming applications on the Cell processor - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year :

Scheduling complex streaming applications on the Cell processor

(1, 2) , (1, 2) , (1, 2)
1
2

Abstract

In this paper, we consider the problem of scheduling streaming applications described by complex task graphs on a heterogeneous multicore processor, the STI Cell BE processor. We first present a theoretical model of the Cell processor. Then, we use this model to express the problem of maximizing the throughput of a streaming application on this processor. Although the problem is proven NP-complete, we present an optimal solution based on mixed linear programming. This allows us to compute the optimal mapping for a number of applications, ranging from a real audio encoder to complex random task graphs. These mappings are then tested on two platforms embedding Cell processors, and compared to simple heuristic solutions. We show that we are able to achieve a good speed-up, whereas the heuristic solutions generally fail to deal with the strong memory and communication constraints.
Fichier principal
Vignette du fichier
RR-2009-29.pdf (367.18 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

ensl-00421210 , version 1 (01-10-2009)

Identifiers

  • HAL Id : ensl-00421210 , version 1

Cite

Matthieu Gallet, Mathias Jacquelin, Loris Marchal. Scheduling complex streaming applications on the Cell processor. 2009. ⟨ensl-00421210⟩
110 View
520 Download

Share

Gmail Facebook Twitter LinkedIn More