论文信息 - On Randomization Versus Synchronization in Distributed Systems

On Randomization Versus Synchronization in Distributed Systems

We use techniques from concurrency theory to present two new impossibility results for asynchronous distributed systems with randomization. While these results are interesting by themselves, they also complete a picture of how particular liveness assumptions influence the solvability of distributed computation problems in the absence and presence of randomization.

Hagen Völzer

[1] Nancy A. Lynch,et al. Impossibility of distributed consensus with one faulty process , 1985, JACM.

[2] Nissim Francez,et al. Fairness and hyperfairness in multi-party interactions , 2005, Distributed Computing.

[3] Edsger W. Dijkstra,et al. Hierarchical ordering of sequential processes , 1971, Acta Informatica.

[4] Robin Milner,et al. On Observing Nondeterminism and Concurrency , 1980, ICALP.

[5] Hagen Völzer. Randomized Non-sequential Processes , 2001, CONCUR.

[6] Kousha Etessami,et al. A Hierarchy of Polynomial-Time Computable Simulations for Automata , 2002, CONCUR.

[7] K. Mani Chandy,et al. Parallel program design - a foundation , 1988 .

[8] R. Milner,et al. Bigraphical Reactive Systems , 2001, CONCUR.

[9] Micha Sharir,et al. Termination of Probabilistic Concurrent Program , 1983, TOPL.

[10] Michael Ben-Or,et al. Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols , 1983, PODC '83.

[11] Hagen Völzer,et al. Refinement-Robust Fairness , 2002, CONCUR.

[12] Glynn Winskel,et al. Petri Nets, Event Structures and Domains, Part I , 1981, Theor. Comput. Sci..

[13] Walter Vogler. Efficiency of Asynchronous Systems and Read Arcs in Petri Nets , 1997, ICALP.

[14] Ekkart Kindler,et al. Mutex Needs Fairness , 1997, Inf. Process. Lett..