Semi-granules and schielding for off-line scheduling

Abstract : In the framework of parallel programming, we use a type of directed graph, which we call the pin-graph, as a model for various applications : the vertices represent the elementary tasks ; the arcs represent the internal dependences ; and the pins represent communication with the outside. The connectivity of pins-graphs is studied in order to classify them into two classes. A pin-graph in the first class is called a semi-granule. The elementary tasks of a semi-granule can be ordered into a sequential scheduled such that no dead-lock due to this sequential schedule can appear ; a schedule that has this last property is called a circuit-consistent schedule. A pin-graph that is not a semi-granule does not have any so scheduled. A partition into semi-granules of a pin-graph in this class is computed. The tasks of every so obtained semi-granule are well-ordered into a circuit-consistent schedule ; and the composition of these schedules builds up a circuit-consistent schedule of the whole pin-graph, which thus cannot generate any dead-lock, whatever the context. Algorithms partitioning pin-graphs into semi-granules are surveyed.
Type de document :
[Research Report] RR-1228, INRIA. 1990
Liste complète des métadonnées
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 17:59:14
Dernière modification le : jeudi 26 juillet 2018 - 09:05:51
Document(s) archivé(s) le : mardi 12 avril 2011 - 22:35:54



  • HAL Id : inria-00075330, version 1


Bernard Le Goff, Paul Le Guernic, Julian Araoz Durand. Semi-granules and schielding for off-line scheduling. [Research Report] RR-1228, INRIA. 1990. 〈inria-00075330〉



Consultations de la notice


Téléchargements de fichiers