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
A graph-theoretic design process and software tool is presented for selecting a multiprocessing sche...
A fundamental issue affecting the performance of a parallel application running on message-passing p...
technical reportThe inherently asynchronous nature of the data flow computation model allows the exp...
A task manager that dynamically decodes the data-dependent task graph is a key component of general ...
In signal processing area, applications involve a large amount of computation, suggesting the use of...
Many parallel algorithms can be modelled as directed acyclic task graphs. Recently, Degree of Simult...
Task graphs are used for scheduling tasks on parallel processors when the tasks have dependencies. I...
Multi-processor systems-on-chips are widely adopted in implementing modern streaming applications to...
Thus far, parallelism at the loop level (or data-parallelism) has been almost exclusively the main t...
Task-parallel languages are increasingly popular. Many of them provide expressive mechanisms for int...
This paper presents a novel method for the analysis and representation of parallel program with MPI....
This dissertation describes selected software issues of mapping tasks onto parallel processing syste...
The need for intuitive parallel programming designs has grown with the rise of modern many-core proc...
To parallelize an application program for a distributed memory architecture, we can use a precedence...
International audienceIn this paper, we consider parallel real-time tasks follow- ing a Directed Acy...
A graph-theoretic design process and software tool is presented for selecting a multiprocessing sche...
A fundamental issue affecting the performance of a parallel application running on message-passing p...
technical reportThe inherently asynchronous nature of the data flow computation model allows the exp...
A task manager that dynamically decodes the data-dependent task graph is a key component of general ...
In signal processing area, applications involve a large amount of computation, suggesting the use of...
Many parallel algorithms can be modelled as directed acyclic task graphs. Recently, Degree of Simult...
Task graphs are used for scheduling tasks on parallel processors when the tasks have dependencies. I...
Multi-processor systems-on-chips are widely adopted in implementing modern streaming applications to...
Thus far, parallelism at the loop level (or data-parallelism) has been almost exclusively the main t...
Task-parallel languages are increasingly popular. Many of them provide expressive mechanisms for int...
This paper presents a novel method for the analysis and representation of parallel program with MPI....
This dissertation describes selected software issues of mapping tasks onto parallel processing syste...
The need for intuitive parallel programming designs has grown with the rise of modern many-core proc...
To parallelize an application program for a distributed memory architecture, we can use a precedence...
International audienceIn this paper, we consider parallel real-time tasks follow- ing a Directed Acy...
A graph-theoretic design process and software tool is presented for selecting a multiprocessing sche...
A fundamental issue affecting the performance of a parallel application running on message-passing p...
technical reportThe inherently asynchronous nature of the data flow computation model allows the exp...