论文信息 - Synchronizers for Local Computations

Synchronizers for Local Computations

A synchronizer is intended to allow synchronous algorithms to be executed on asynchronous networks. It is useful because designing synchronous algorithms is generally much easier than designing asynchronous ones. In this paper, we provide synchronization protocols described as local computations. We obtain a general and an unified approach for handling synchrony in the framework of local computations.

[1] Gerard Tel,et al. Introduction to Distributed Algorithms: Contents , 2000 .

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

[3] Ronald C. Read,et al. Graph theory and computing , 1972 .

[4] Yves Métivier,et al. Graph relabelling systems and distributed algorithms , 1999 .

[5] Boleslaw K. Szymanski,et al. Terminating iterative solution of simultaneous equations in distributed message passing systems , 1985, PODC '85.

[6] P. Rosenstiehl,et al. INTELLIGENT GRAPHS: NETWORKS OF FINITE AUTOMATA CAPABLE OF SOLVING GRAPH PROBLEMS , 1972 .

[7] Seif Haridi,et al. Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[8] David Peleg,et al. Distributed Computing: A Locality-Sensitive Approach , 1987 .

[9] Hagit Attiya,et al. Distributed Computing: Fundamentals, Simulations and Advanced Topics , 1998 .

[10] Anca Muscholl,et al. Characterizations of Classes of Graphs Recognizable by Local Computations , 2004, Theory of Computing Systems.

[11] Nancy A. Lynch,et al. Distributed Computing: Models and Methods , 1990, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.