Scheduling complex streaming applications on the Cell processor

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 :
Communication dans un congrès
4th Workshop on Multi-threaded Architectures and Applications (MTAAP 2010), May 2010, Atlanta, GA, United States. IEEE, pp.1-8, 2010, 〈10.1109/IPDPSW.2010.5470684〉
Liste complète des métadonnées

https://hal.inria.fr/hal-01062566
Contributeur : Equipe Roma <>
Soumis le : mercredi 10 septembre 2014 - 09:48:44
Dernière modification le : vendredi 20 avril 2018 - 15:44:27

Lien texte intégral

Identifiants

Collections

Citation

Matthieu Gallet, Mathias Jacquelin, Loris Marchal. Scheduling complex streaming applications on the Cell processor. 4th Workshop on Multi-threaded Architectures and Applications (MTAAP 2010), May 2010, Atlanta, GA, United States. IEEE, pp.1-8, 2010, 〈10.1109/IPDPSW.2010.5470684〉. 〈hal-01062566〉

Partager

Métriques

Consultations de la notice

150