An Equivariance Theorem with Applications to Renaming (Preliminary Version)

Details An Equivariance Theorem with Applications to Renaming (Preliminary Version) An Equivariance Theorem with Applications to Renaming (Preliminary Version)

2011-02-24

arxiv.org/abs/1102.4946v1

Computer Science

Distributed, Parallel, and Cluster Computing

20 pages, 2 figures

Scientific paper

In the renaming problem, each process in a distributed system is issued a unique name from a large name space, and the processes must coordinate with one another to choose unique names from a much smaller name space. We show that lower bounds on the solvability of renaming in an asynchronous distributed system can be formulated as a purely topological question about the existence of an equivariant chain map from a topological disk to a topological annulus. Proving the non-existence of such a map implies the non-existence of a distributed renaming algorithm in several related models of computation.

Affiliated with

Also associated with

No associations

Rating

An Equivariance Theorem with Applications to Renaming (Preliminary Version) 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 An Equivariance Theorem with Applications to Renaming (Preliminary Version), we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Equivariance Theorem with Applications to Renaming (Preliminary Version) will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-86416