Randomized Work-Competitive Scheduling for Cooperative Computing on $k$-partite Task Graphs

Details Randomized Work-Competitive Scheduling for Cooperative Computing on $k$-partite Task Graphs Randomized Work-Competitive Scheduling for Cooperative Computing on $k$-partite Task Graphs

2008-05-09

arxiv.org/abs/0805.1257v2

Computer Science

Distributed, Parallel, and Cluster Computing

Scientific paper

A fundamental problem in distributed computing is the task of cooperatively executing a given set of $t$ tasks by $p$ processors where the communication medium is dynamic and subject to failures. The dynamics of the communication medium lead to groups of processors being disconnected and possibly reconnected during the entire course of the computation furthermore tasks can have dependencies among them. In this paper, we present a randomized algorithm whose competitive ratio is dependent on the dynamics of the communication medium and also on the nature of the dependencies among the tasks.

Affiliated with

Also associated with

No associations

Rating

Randomized Work-Competitive Scheduling for Cooperative Computing on $k$-partite Task Graphs 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 Randomized Work-Competitive Scheduling for Cooperative Computing on $k$-partite Task Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Randomized Work-Competitive Scheduling for Cooperative Computing on $k$-partite Task Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-331993