| Authors |
: |
|
| Document type |
: |
Communication à un colloque (Conference Paper) – Présentation orale avec comité de sélection
|
| Abstract |
: |
Current multimedia and signal processing applications become more complex. This paper proposes a new parallelism management scheme that can explicitly deal with complex and general parallelism patterns. The parallelism description is based on a task flow graph representation interlaced with control commands. A graph management algorithm is proposed to extract eligible tasks and implement synchronization operations. We show that this management outperforms classical parallelism extraction in case of complex applications. Moreover, the parallelism description can be directly inserted in sequential programs without deep code modifications. |
| Access type |
: |
Accès restreint |
| Publication date |
: |
1999 |
| Language |
: |
Anglais |
| Conference |
: |
"4th International Austrian-Center-for-Parallel-Computation Conference", SALZBURG(Austria) (Feb 16-18, 1999) |
| Journal information |
: |
"Lecture Notes in Computer Science" - Vol. 1557, p. 246-256 (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 ; Task Graph ; Task Scheduling ; Multiprocessors
|
| Links |
: |
|
