Scheduling and data redistribution strategies on star platforms

Details Scheduling and data redistribution strategies on star platforms Scheduling and data redistribution strategies on star platforms

2006-10-23

arxiv.org/abs/cs/0610131v1

Computer Science

Distributed, Parallel, and Cluster Computing

Scientific paper

In this work we are interested in the problem of scheduling and redistributing data on master-slave platforms. We consider the case were the workers possess initial loads, some of which having to be redistributed in order to balance their completion times. We examine two different scenarios. The first model assumes that the data consists of independent and identical tasks. We prove the NP-completeness in the strong sense for the general case, and we present two optimal algorithms for special platform types. Furthermore we propose three heuristics for the general case. Simulations consolidate the theoretical results. The second data model is based on Divisible Load Theory. This problem can be solved in polynomial time by a combination of linear programming and simple analytical manipulations.

Affiliated with

Also associated with

No associations

Rating

Scheduling and data redistribution strategies on star platforms 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 and data redistribution strategies on star platforms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Scheduling and data redistribution strategies on star platforms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-276947