Skip to Main content Skip to Navigation
Journal articles

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

Abstract : 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.
Document type :
Journal articles
Complete list of metadata

https://hal.inria.fr/hal-01262049
Contributor : Coordination Episciences Iam <>
Submitted on : Tuesday, January 26, 2016 - 10:56:37 AM
Last modification on : Wednesday, October 30, 2019 - 4:34:07 PM
Long-term archiving on: : Wednesday, April 27, 2016 - 1:14:43 PM

File

arima00403.pdf
Publisher files allowed on an open archive

Identifiers

  • HAL Id : hal-01262049, version 1

Collections

Citation

Clémentin Tayou Djamegni. Exécution d'un graphe cubique de tâches sur un réseau bi-dimensionnel et asymptotiquement optimal. Revue Africaine de la Recherche en Informatique et Mathématiques Appliquées, INRIA, 2006, 4, pp.53-65. ⟨hal-01262049⟩

Share

Metrics

Record views

144

Files downloads

919