CORR
2007
Springer
13 years 11 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 ...
IJHPCA
2006
13 years 11 months ago
2006
In this paper we study the scheduling of multiple divisible loads on a star network of processors. We show that this problem is computationally hard. Special cases solvable in pol...
ISPDC
2005
IEEE
14 years 5 months ago
2005
IEEE
An important scheduling problem is the one in which there are no dependencies between tasks and the tasks can be of arbitrary size. This is known as the divisible load scheduling ...
IPPS
2007
IEEE
14 years 5 months ago
2007
IEEE
In this paper we augment DLT (Divisible Load Theory) with incentives such that it is beneficial for processors to report their true processing capacity and compute their assignme...
ICPP
2007
IEEE
14 years 5 months ago
2007
IEEE
Providing QoS and performance guarantees to arbitrarily divisible loads has become a significant problem for many cluster-based research computing facilities. While progress is b...