User menu

Accès à distance ? S'identifier sur le proxy UCLouvain

A graph-oriented task manager for small multiprocessor systems

Primary tabs

Verians, X Quisquater, Jean-Jacques [UCL] Legat, Jean-Didier [UCL] Macq, Benoît [UCL]

A task manager that dynamically decodes the data-dependent task graph is a key component of general multiprocessor systems. The emergence of small-scale parallel systems for multimedia and general-purpose applications requires the extraction of complex parallelism patterns. The small system size also allows the centralization of the task generation and synchronization. This paper proposes such a task manager. It uses a structured representation of the task dependence graph to issue and synchronize tasks. We describe several optimizations to extract more parallelism, discuss the software/hardware implementation issue and show it produces efficient parallelism exploitation in case of applications with complex parallelism patterns.

Document type Communication à un colloque (Conference Paper) – Présentation orale avec comité de sélection
Access type Accès restreint
Publication date 1999
Language Anglais
Conference "5th International Euro-Par Conference", TOULOUSE(France) (Aug 31-sep 03, 1999)
Journal information "Lecture Notes in Computer Science" - Vol. 1685, p. 735-744 (1999)
Peer reviewed yes
issn 0302-9743
e-issn 1611-3349
Publisher Springer-verlag Berlin (Berlin)
Affiliation UCL - FSA/ELEC - Département d'électricité
Keywords Parallelism ; Dependence Graph ; Synchronization ; Multiprocessors
Links
Bibliographic reference Verians, X ; Quisquater, Jean-Jacques ; Legat, Jean-Didier ; Macq, Benoît. A graph-oriented task manager for small multiprocessor systems.5th International Euro-Par Conference (TOULOUSE(France), Aug 31-sep 03, 1999). In: Lecture Notes in Computer Science, Vol. 1685, p. 735-744 (1999)
Permanent URL http://hdl.handle.net/2078.1/62078