Computer Science – Distributed – Parallel – and Cluster Computing
Scientific paper
2009-08-12
Computer Science
Distributed, Parallel, and Cluster Computing
22 pages, 7 figures, epsf and pstricks in LaTeX
Scientific paper
Self-stabilizing distributed control is often modeled by token abstractions. A system with a single token may implement mutual exclusion; a system with multiple tokens may ensure that immediate neighbors do not simultaneously enjoy a privilege. For a cyber-physical system, tokens may represent physical objects whose movement is controlled. The problem studied in this paper is to ensure that a synchronous system with m circulating tokens has at least d distance between tokens. This problem is first considered in a ring where d is given whilst m and the ring size n are unknown. The protocol solving this problem can be uniform, with all processes running the same program, or it can be non-uniform, with some processes acting only as token relays. The protocol for this first problem is simple, and can be expressed with Petri net formalism. A second problem is to maximize d when m is given, and n is unknown. For the second problem, the paper presents a non-uniform protocol with a single corrective process.
Dastidar Kajari Ghosh
Herman Ted
No associations
LandOfFree
Separation of Circulating Tokens 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 Separation of Circulating Tokens, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Separation of Circulating Tokens will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-699881