1156 search results - page 56 / 232 » Optimal scheduling of task graphs on parallel systems |
110
click to vote
EUROPAR
2005
Springer
15 years 5 months ago
2005
Springer
In large-scale parallel applications a graph coloring is often carried out to schedule computational tasks. In this paper, we describe a new distributedmemory algorithm for doing t...
RTSS
1996
IEEE
15 years 4 months ago
1996
IEEE
Several Panwheel schedulers have been reported preuaously for schedulang real-tame systems an whach the temporal dastances between consecutave executaons of tasks must be less tha...
103
click to vote
HPCN
1997
Springer
15 years 4 months ago
1997
Springer
We present a distributed algorithm for determining optimal concurrent communication ow in arbitrary computer networks. Our scheme is applicable to a wide range of network ow applic...
IPPS
1998
IEEE
15 years 4 months ago
1998
IEEE
This paper presents our work on the static task scheduling model using the mean-field annealing (MFA) technique. Mean-field annealing is a technique of thermostatic annealing that...
HPDC
1999
IEEE
15 years 4 months ago
1999
IEEE
Efficient and robust metacomputing requires the decomposition of complex jobs into tasks that must be scheduled on distributed processing nodes. There are various ways of creating...