Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Naming symmetric processes using shared variables

Naming symmetric processes using shared variables Implementations of inter-process communication and synchronization in distributed systems usually rely on the existence of unique ids for the processes. We consider the problem of generating such ids for identical processes in a shared-variable system. A randomized protocol that assigns distinct ids to the processes within an expected polynomial number of rounds using a polynomial number of boolean atomic variables is presented. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Distributed Computing Springer Journals

Naming symmetric processes using shared variables

Loading next page...
 
/lp/springer-journals/naming-symmetric-processes-using-shared-variables-V6x8dzvkC1

References (37)

Publisher
Springer Journals
Copyright
Copyright © 1994 by Springer-Verlag
Subject
Computer Science; Computer Communication Networks; Computer Hardware; Computer Systems Organization and Communication Networks; Software Engineering/Programming and Operating Systems; Theory of Computation
ISSN
0178-2770
eISSN
1432-0452
DOI
10.1007/BF02283568
Publisher site
See Article on Publisher Site

Abstract

Implementations of inter-process communication and synchronization in distributed systems usually rely on the existence of unique ids for the processes. We consider the problem of generating such ids for identical processes in a shared-variable system. A randomized protocol that assigns distinct ids to the processes within an expected polynomial number of rounds using a polynomial number of boolean atomic variables is presented.

Journal

Distributed ComputingSpringer Journals

Published: Dec 6, 2005

There are no references for this article.