Token Execution Strategies for Distributed Algorithms: Simulation Studies

We study distributed computer systems with bidirectional point- to-point links. In a chaotic algorithm a processor may transmit a message whenever it wishes. In a token algorithm a processor may transmit a message only when it holds a unique token. Many local networks implement only token algorithms. Token algorithms may be easier to design, analyze, and understand than chaotic algorithms, but token algorithms may execute more slowly than chaotic algorithms.