Summary: Yale University
Department of Computer Science
P.O. Box 208205
New Haven, CT 06520­8285
Slightly smaller splitter networks
James Aspnes1
Yale University
YALEU/DCS/TR-1438
November 2010
1
Supported in part by NSF grant CCF-0916389.
Abstract
The classic renaming protocol of Moir and Anderson [4] uses a network of (n2
) splitters to
assign unique names to n processes with unbounded initial names. We show how to reduce this
bound to (n3/2
) splitters.
1 Introduction
We show how to reduce the (n2) space and output namespace of renaming using a splitter network
in the style of Moir and Anderson [4] to (n3/2). The individual time complexity remains (n),

Source: Aspnes, James - Department of Computer Science, Yale University
Yale University, Department of Computer Science, Haskell Group

Collections: Computer Technologies and Information Sciences