Bounds on series-parallel slowdown

Details Bounds on series-parallel slowdown Bounds on series-parallel slowdown

2009-04-29

arxiv.org/abs/0904.4512v1

Computer Science

Distributed, Parallel, and Cluster Computing

12 pages, 4 figures

Scientific paper

We use activity networks (task graphs) to model parallel programs and consider series-parallel extensions of these networks. Our motivation is two-fold: the benefits of series-parallel activity networks and the modelling of programming constructs, such as those imposed by current parallel computing environments. Series-parallelisation adds precedence constraints to an activity network, usually increasing its makespan (execution time). The slowdown ratio describes how additional constraints affect the makespan. We disprove an existing conjecture positing a bound of two on the slowdown when workload is not considered. Where workload is known, we conjecture that 4/3 slowdown is always achievable, and prove our conjecture for small networks using max-plus algebra. We analyse a polynomial-time algorithm showing that achieving 4/3 slowdown is in exp-APX. Finally, we discuss the implications of our results.

Affiliated with

Also associated with

No associations

Rating

Bounds on series-parallel slowdown 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 Bounds on series-parallel slowdown, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bounds on series-parallel slowdown will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-511054