Add to ORKGWe consider the dynamic task allocation problem in multicomputer system with multiprogramming. Programs are given as task interaction graphs that have to be mapped onto the processors at run-time. We propose a fast two-phase heuristic algorithm where phase 1 performs a hierarchic clustering of the tasks which is used by the second phase to map clusters of suitable size onto free partitions of the processor graph.
Static scheduling of a program represented by a directed task graph on a multiprocessor system to mi...
One of the key problems in the design of any incompletely connected multiprocessor system is to ...
[[abstract]]In loosely-coupled multiprocessor systems, a parallel program has its modules distribute...
A fundamental issue affecting the performance of a parallel application running on message-passing p...
The recent development of distributed processing platforms, such as clusters of workstations, makes ...
Task graphs are used for scheduling tasks on parallel processors when the tasks have dependencies. I...
The task-to-processor mapping problem is addressed in the context of a local-memory multiprocessor w...
In a distributed heterogeneous computing system, the resources have different capabilities and tasks...
In this paper, we propose a static scheduling algorithm for allocating task graphs to fully connecte...
In order to minimize the execution time of a parallel application running on a heterogeneously distr...
In order to minimize the execution time of a parallel application running on a heterogeneously distr...
Static scheduling of a program represented by a directed task graph on a multiprocessor system to mi...
In order to minimize the execution time of a parallel application running on a heterogeneously distr...
In this paper, we propose a static scheduling algorithm for allocating task graphs to fully connecte...
In this paper, we present a sub-optimal solution to the problem of mapping application tasks onto he...
Static scheduling of a program represented by a directed task graph on a multiprocessor system to mi...
One of the key problems in the design of any incompletely connected multiprocessor system is to ...
[[abstract]]In loosely-coupled multiprocessor systems, a parallel program has its modules distribute...
A fundamental issue affecting the performance of a parallel application running on message-passing p...
The recent development of distributed processing platforms, such as clusters of workstations, makes ...
Task graphs are used for scheduling tasks on parallel processors when the tasks have dependencies. I...
The task-to-processor mapping problem is addressed in the context of a local-memory multiprocessor w...
In a distributed heterogeneous computing system, the resources have different capabilities and tasks...
In this paper, we propose a static scheduling algorithm for allocating task graphs to fully connecte...
In order to minimize the execution time of a parallel application running on a heterogeneously distr...
In order to minimize the execution time of a parallel application running on a heterogeneously distr...
Static scheduling of a program represented by a directed task graph on a multiprocessor system to mi...
In order to minimize the execution time of a parallel application running on a heterogeneously distr...
In this paper, we propose a static scheduling algorithm for allocating task graphs to fully connecte...
In this paper, we present a sub-optimal solution to the problem of mapping application tasks onto he...
Static scheduling of a program represented by a directed task graph on a multiprocessor system to mi...
One of the key problems in the design of any incompletely connected multiprocessor system is to ...
[[abstract]]In loosely-coupled multiprocessor systems, a parallel program has its modules distribute...