Scheduling complex streaming applications on the Cell processor

Matthieu Gallet 1, 2 Mathias Jacquelin 1, 2, * Loris Marchal 1, 2
* Auteur correspondant
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.
Type de document :
Pré-publication, Document de travail
RRLIP-2009-29. 2009
Liste complète des métadonnées

Littérature citée [18 références]  Voir  Masquer  Télécharger

https://hal-ens-lyon.archives-ouvertes.fr/ensl-00421210
Contributeur : Loris Marchal <>
Soumis le : jeudi 1 octobre 2009 - 11:34:23
Dernière modification le : vendredi 20 avril 2018 - 15:44:24
Document(s) archivé(s) le : mardi 16 octobre 2012 - 11:40:40

Fichier

RR-2009-29.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : ensl-00421210, version 1

Collections

Citation

Matthieu Gallet, Mathias Jacquelin, Loris Marchal. Scheduling complex streaming applications on the Cell processor. RRLIP-2009-29. 2009. 〈ensl-00421210〉

Partager

Métriques

Consultations de la notice

199

Téléchargements de fichiers

241