3098 search results - page 134 / 620 » On distributed smooth scheduling |
135
click to vote
PDCAT
2004
Springer
15 years 11 months ago
2004
Springer
DFS has previously been shown to be a simple and efficient strategy for removing cycles in graphs allowing the resulting DAGs to be scheduled using one of the many well-established...
168
click to vote
PPAM
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. This paper investigates the complexity of scheduling biprocessor tasks on dedicated processors to minimize mean flow time. Since the general problem is strongly NP-hard,...
167
click to vote
EUROPAR
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. In this paper we consider the problem of scheduling on computing platforms composed of several independent organizations, known as the Multi-Organization Scheduling Probl...
157
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
Min, Veeravalli, and Barlas have proposed strategies to minimize the overall execution time of one or several divisible loads on a heterogeneous linear network, using one or more ...
148
click to vote
CCGRID
2009
IEEE
16 years 1 months ago
2009
IEEE
The use of today’s multicluster grids exhibits periods of submission bursts with periods of normal use and even of idleness. To avoid resource contention, many users employ obse...