Slightly smaller splitter networks

TL;DR

This paper presents a method to reduce the number of splitters needed in a classic renaming protocol from quadratic to sub-quadratic, improving efficiency in process naming.

Contribution

It introduces a novel approach that decreases the splitter network size from Theta(n^2) to Theta(n^{3/2}), enhancing the protocol's scalability.

Findings

Reduced splitter network size from Theta(n^2) to Theta(n^{3/2})

Maintained correctness of the renaming protocol

Improved efficiency in process naming protocols

Abstract

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.