Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Scheduling complex streaming applications on the Cell processor

Matthieu Gallet 1, 2 Mathias Jacquelin 1, 2, * Loris Marchal 1, 2 
* Corresponding author
1 GRAAL - Algorithms and Scheduling for Distributed Heterogeneous Platforms
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
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.
Document type :
Preprints, Working Papers, ...
Complete list of metadata

Cited literature [18 references]  Display  Hide  Download
Contributor : Loris Marchal Connect in order to contact the contributor
Submitted on : Thursday, October 1, 2009 - 11:34:23 AM
Last modification on : Wednesday, March 2, 2022 - 2:12:06 PM
Long-term archiving on: : Tuesday, October 16, 2012 - 11:40:40 AM


Files produced by the author(s)


  • HAL Id : ensl-00421210, version 1



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



Record views


Files downloads