Smoothed Analysis of Balancing Networks

Details Smoothed Analysis of Balancing Networks Smoothed Analysis of Balancing Networks

2010-06-08

arxiv.org/abs/1006.1443v1

Computer Science

Data Structures and Algorithms

26 pages, to appear in Random Structures and Algorithms

Scientific paper

In a balancing network each processor has an initial collection of unit-size jobs (tokens) and in each round, pairs of processors connected by balancers split their load as evenly as possible. An excess token (if any) is placed according to some predefined rule. As it turns out, this rule crucially affects the performance of the network. In this work we propose a model that studies this effect. We suggest a model bridging the uniformly-random assignment rule, and the arbitrary one (in the spirit of smoothed-analysis). We start with an arbitrary assignment of balancer directions and then flip each assignment with probability $\alpha$ independently. For a large class of balancing networks our result implies that after $\Oh(\log n)$ rounds the discrepancy is $\Oh( (1/2-\alpha) \log n + \log \log n)$ with high probability. This matches and generalizes known upper bounds for $\alpha=0$ and $\alpha=1/2$. We also show that a natural network matches the upper bound for any $\alpha$.

Affiliated with

Also associated with

No associations

Rating

Smoothed Analysis of Balancing Networks 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 Smoothed Analysis of Balancing Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Smoothed Analysis of Balancing Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-29562