Routing Permutations in Partitioned Optical Passive Star Networks

Details Routing Permutations in Partitioned Optical Passive Star Networks Routing Permutations in Partitioned Optical Passive Star Networks

2001-09-18

arxiv.org/abs/cs/0109027v1

Computer Science

Distributed, Parallel, and Cluster Computing

8 pages, 3 figures

Scientific paper

It is shown that a POPS network with g groups and d processors per group can
efficiently route any permutation among the n=dg processors. The number of
slots used is optimal in the worst case, and is at most the double of the
optimum for all permutations p such that p(i)<>i for all i.

Affiliated with

Also associated with

No associations

Rating

Routing Permutations in Partitioned Optical Passive Star 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 Routing Permutations in Partitioned Optical Passive Star Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Routing Permutations in Partitioned Optical Passive Star Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-424892