Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Attiya, H., Welch, J.: Distributed computing. McGraw-Hill, New York (1998)
Bauderon, M., Métivier, Y., Mosbah, M., Sellami, A.: From local computations to asynchronous message passing systems. Technical Report RR-1271-02, University of Bordeaux 1 (2002)
Chandy, K.M., Misra, J.: Parallel program design - A foundation. Addison-Wesley, Reading (1988)
Godard, E., Métivier, Y., Muscholl, A.: Characterizations of Classes of Graphs Recognizable by Local Computations. In: Theory of Computing Systems, pp. 249–293 (2004)
L. Lamport and N. Lynch. Distributed computing: models and methods. Handbook of theoretical computer science, B:1157–1199, 1990.
Litovsky, I., Métivier, Y., Sopena, E.: Graph relabelling systems and distributed algorithms. In: Ehrig, H., Kreowski, H.J., Montanari, U., Rozenberg, G. (eds.) Handbook of graph grammars and computing by graph transformation, vol. 3, pp. 1–56. World Scientific, Singapore (1999)
Lynch, N.A.: Distributed algorithms. Morgan Kaufmann, San Francisco (1996)
Métivier, Y., Mosbah, M., Ossamy, R., Sellami, A.: Synchronizers for local computations. Technical Report 1322-04, LaBRI - University of Bordeaux 1 (2004)
Peleg, D.: Distributed computing - A locality-sensitive approach. SIAM Monographs on discrete mathematics and applications (2000)
Rosenstiehl, P., Fiksel, J.-R., Holliger, A.: Intelligent graphs. In: Read, R. (ed.) Graph theory and computing, pp. 219–265. Academic Press, New York (1972)
Tel, G.: Introduction to distributed algorithms. Cambridge University Press, Cambridge (2000)
Szymanski, B., Shi, Y., Prywes, N.: Terminating iterative solutions of simultaneous equations in distributed message passing systems. In: 4th International Conference on Distributed Computing Systems, pp. 287–292 (1985)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Métivier, Y., Mosbah, M., Ossamy, R., Sellami, A. (2004). Synchronizers for Local Computations. In: Ehrig, H., Engels, G., Parisi-Presicce, F., Rozenberg, G. (eds) Graph Transformations. ICGT 2004. Lecture Notes in Computer Science, vol 3256. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30203-2_20
Download citation
DOI: https://doi.org/10.1007/978-3-540-30203-2_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23207-0
Online ISBN: 978-3-540-30203-2
eBook Packages: Springer Book Archive