Don’t Hurry be Happy: a Deadline-based Backlling Approach

N’takpé (T.) et Suter (F.). – Don’t hurry be happy : A deadline-based backfilling approach. In Workshop on Job Scheduling Strategies for Parallel Processing, pp. 62–82. Springer, 2017. Résumé Les ressources informatiques des centres de données...

[ read more ]

Scheduling Parallel Task Graphs on (Almost) Homogeneous Multi-cluster Platforms

P.-F. Dutot, T. N’takpé, F. Suter and H. Casanova. Scheduling Parallel Task Graphs on (Almost) Homogeneous Multi-cluster Platforms. in IEEE Transactions on Parallel and Distributed Systems, 2009. Résumé Les applications structurées sous forme de graphiques de...

[ read more ]

A Comparison of Scheduling Approaches for Mixed-Parallel Applications on Heterogeneous Platforms

[5] T. N’takpé and F. Suter and H. Casanova. A Comparison of Scheduling Approaches for Mixed-Parallel Applications on Heterogeneous Platforms. In Proceedings of the 6th International Symposium on Parallel and Distributed Computing, Hagenberg, Austria, July, 2007....

[ read more ]

Critical Path and Area Based Scheduling of Parallel Task Graphs on Heterogeneous Platforms

T. N’takpé and F. Suter. Critical Path and Area Based Scheduling of Parallel Task Graphs on Heterogeneous Platforms. In Proceedings of the Twelfth Résumé Bien que la plupart des graphiques de planification de tâches parallèles aient...

[ read more ]

Algorithmes d’ordonnancement de graphes de tâches parallèles sur plates-formes hétérogènes

Tchimou N’takpé. Algorithmes d’ordonnancement de graphes de tâches parallèles sur plates-formes hétérogènes. In 17ième Rencontres francophones du Parallélisme (RenPar’17), Perpignan, October, 2006. Résumé L’accès possible à des ressources informatiques distribuées sur Internet permet un nouveau type...

[ read more ]