Add to ORKGThe paper presents an algorithm for scheduling parallel programs for execution in a parallel architecture based on dynamic SMP processor clusters with data transfers on the fly. The algorithm is based on the concept of moldable computational tasks. First, an initial program graph is decomposed into subgraphs, which are then treated as moldable tasks. So identified moldable tasks are then scheduled using an algorithm with warranted schedule length
In this paper, we propose to use a duplication based approach in scheduling tasks to a heterogeneous...
In this article, we revisit the problem of scheduling dy-namically generated directed acyclic graphs...
Clustering and scheduling of tasks for parallel imple-mentation is a well researched problem. Severa...
The paper presents an algorithm for scheduling parallel programs for execution in a parallel archite...
International audienceThe paper presents comparison of the two scheduling algorithms developed for p...
The model of moldable task (MT) was introduced some years ago and has been proved to be an efficient...
International audienceIn this article, we revisit the problem of scheduling dynamically generated di...
Our main goal in this paper is to study the scheduling of parallel BSP tasks on clusters of computer...
The model of malleable task (MT) was introduced some years ago and has been proved to be an efficien...
Scheduling is a crucial problem in parallel and distributed processing. It consists of determining w...
International audienceWe present a new approach for scheduling independent tasks on multiple CPUs an...
International audienceMoldable tasks allow schedulers to determine the number of processors assigned...
International audienceMany scientific applications can be structured as Parallel Task Graphs (PTGs),...
This dissertation studies the development of application programs for parallel and distributed compu...
Scheduling of sporadic task systems on multiprocessor platforms is an area which has received much a...
In this paper, we propose to use a duplication based approach in scheduling tasks to a heterogeneous...
In this article, we revisit the problem of scheduling dy-namically generated directed acyclic graphs...
Clustering and scheduling of tasks for parallel imple-mentation is a well researched problem. Severa...
The paper presents an algorithm for scheduling parallel programs for execution in a parallel archite...
International audienceThe paper presents comparison of the two scheduling algorithms developed for p...
The model of moldable task (MT) was introduced some years ago and has been proved to be an efficient...
International audienceIn this article, we revisit the problem of scheduling dynamically generated di...
Our main goal in this paper is to study the scheduling of parallel BSP tasks on clusters of computer...
The model of malleable task (MT) was introduced some years ago and has been proved to be an efficien...
Scheduling is a crucial problem in parallel and distributed processing. It consists of determining w...
International audienceWe present a new approach for scheduling independent tasks on multiple CPUs an...
International audienceMoldable tasks allow schedulers to determine the number of processors assigned...
International audienceMany scientific applications can be structured as Parallel Task Graphs (PTGs),...
This dissertation studies the development of application programs for parallel and distributed compu...
Scheduling of sporadic task systems on multiprocessor platforms is an area which has received much a...
In this paper, we propose to use a duplication based approach in scheduling tasks to a heterogeneous...
In this article, we revisit the problem of scheduling dy-namically generated directed acyclic graphs...
Clustering and scheduling of tasks for parallel imple-mentation is a well researched problem. Severa...