Computer Science – Distributed – Parallel – and Cluster Computing
Scientific paper
2010-11-14
Computer Science
Distributed, Parallel, and Cluster Computing
Scientific paper
The classic renaming protocol of Moir and Anderson (1995) uses a network of
Theta(n^2) splitters to assign unique names to n processes with unbounded
initial names. We show how to reduce this bound to Theta(n^{3/2}) splitters.
No associations
LandOfFree
Slightly smaller splitter 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 Slightly smaller splitter networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Slightly smaller splitter networks will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-455910