Clémentin Tayou Djamegni - Exécution d'un graphe cubique de tâches sur un réseau bi-dimensionnel et asymptotiquement optimal

arima:1848 - Revue Africaine de la Recherche en Informatique et Mathématiques Appliquées, October 12, 2006, Volume 4, 2006 - https://doi.org/10.46298/arima.1848
Exécution d'un graphe cubique de tâches sur un réseau bi-dimensionnel et asymptotiquement optimal

Authors: Clémentin Tayou Djamegni

This work proposes a scheduling strategy, based on re-indexing transformations, for task graphs associated with a linear timing function. This scheduling strategy is used to execute a cubical task graph, for which all the tasks have the sane execution time and inter-tasks communication delays are neglected, on a two-dimensional array of processors which is asymptotically space-optimal with respect to the timing function.


Volume: Volume 4, 2006
Published on: October 12, 2006
Submitted on: April 9, 2006
Keywords: Scheduling, task graph, parallel processing, linear time function, allocation function, re-indexation, optimality,ordonnancement,graphe de tâches,calcul parallèle,fonction de temps linéaire,fonction d'allocation,ré-indexation,optimalité,[INFO] Computer Science [cs],[MATH] Mathematics [math]


Share

Consultation statistics

This page has been seen 73 times.
This article's PDF has been downloaded 192 times.