Scheduling multiple divisible loads on a linear processor network

Details Scheduling multiple divisible loads on a linear processor network Scheduling multiple divisible loads on a linear processor network

2007-06-27

arxiv.org/abs/0706.4038v2

Computer Science

Distributed, Parallel, and Cluster Computing

Scientific paper

Min, Veeravalli, and Barlas have recently proposed strategies to minimize the overall execution time of one or several divisible loads on a heterogeneous linear network, using one or more installments. We show on a very simple example that their approach does not always produce a solution and that, when it does, the solution is often suboptimal. We also show how to find an optimal schedule for any instance, once the number of installments per load is given. Then, we formally state that any optimal schedule has an infinite number of installments under a linear cost model as the one assumed in the original papers. Therefore, such a cost model cannot be used to design practical multi-installment strategies. Finally, through extensive simulations we confirmed that the best solution is always produced by the linear programming approach, while solutions of the original papers can be far away from the optimal.

Affiliated with

Also associated with

No associations

Rating

Scheduling multiple divisible loads on a linear processor network does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Scheduling multiple divisible loads on a linear processor network, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Scheduling multiple divisible loads on a linear processor network will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-256095