Global sum on symmetric networks

Details Global sum on symmetric networks Global sum on symmetric networks

2012-01-19

arxiv.org/abs/1201.4153v1

Mathematics

Combinatorics

5 pages

Scientific paper

We are interested in the following problem we call global sum. Each processor starts with a single real value. At each time step, every directed edge in the graph can simultaneously be used to transmit a single (bounded) number between the processors (vertices). How many time steps s are required to ensure that every processor acquires the global sum? We know that s is bounded below by the diameter and above by two times the diameter. We conjecture that for vertex symmetric graphs, s is equal to the diameter. We show this is true if the diameter is 2.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-254967