Skip to Main content Skip to Navigation
Theses

L'unisson

Abstract : It is easy to see that in a fault-free environment, it is not always true that a synchronized unison is deadlock-free or livelock-free, in the sense that all processes would execute their application code infinitely often. These kinds of problem mandates a deep study of unison. Our contribution is threefold: - understand unision and its convergence to a synchronized deadlock-free state in an arbitrary graph, and inferring new efficient protocols for general graphs; - enhance protocoles in two particular cases: synchronous networks and tree networks; - apply unison to local synchronization, and more generally to distance-d synchronization. These three axes motivate the three chapters of this study.
Complete list of metadatas

Cited literature [119 references]  Display  Hide  Download

https://tel.archives-ouvertes.fr/tel-01511431
Contributor : Stéphane Devismes <>
Submitted on : Monday, May 15, 2017 - 11:42:18 AM
Last modification on : Thursday, January 11, 2018 - 6:19:30 AM
Long-term archiving on: : Thursday, August 17, 2017 - 12:47:50 AM

Identifiers

  • HAL Id : tel-01511431, version 1

Collections

Citation

Christian Boulinier. L'unisson. Réseaux et télécommunications [cs.NI]. Université de Picardie Jules Verne, 2007. Français. ⟨tel-01511431⟩

Share

Metrics

Record views

203

Files downloads

229