SLC : Symbolic Scheduling for Executing Parameterized Task Graphs on Multiprocessors

Michel Cosnard 1 Emmanuel Jeannot 2 Tao Yang
1 RESEDAS - Software Tools for Telecommunications and Distributed Systems
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : This paper deals with allocating and executing parallel tasks on a distributed memory machine. A parameterized task graph (PTG) is a model of computation which is small and problem size independent (i.e. it requires the same amount of memory, whatever the size of the program parameters is). In this paper we present and study SLC (Symbolic Linear Clustering). SLC is an algorithm that: (1) build a linear clustering for a given parameterized task graph; (2) finds a symbolic allocation of each cluster. This means that the processor where each task is going to be executed is a function that is generated at compile time. We show and study the results of this method on various compute-intensive kernels that can be found in scientific applications.
Type de document :
Communication dans un congrès
IEEE. International Conférence on Parallel Processing - ICPP'99, 1999, Aizu-Wakamatsu, Japan, IEEE Computer Press, 25 p, 1999
Liste complète des métadonnées

https://hal.inria.fr/inria-00098842
Contributeur : Publications Loria <>
Soumis le : mardi 26 septembre 2006 - 08:39:07
Dernière modification le : jeudi 11 janvier 2018 - 06:20:00

Identifiants

  • HAL Id : inria-00098842, version 1

Collections

Citation

Michel Cosnard, Emmanuel Jeannot, Tao Yang. SLC : Symbolic Scheduling for Executing Parameterized Task Graphs on Multiprocessors. IEEE. International Conférence on Parallel Processing - ICPP'99, 1999, Aizu-Wakamatsu, Japan, IEEE Computer Press, 25 p, 1999. 〈inria-00098842〉

Partager

Métriques

Consultations de la notice

85