TY - GEN
T1 - The buck stops here
T2 - 9th International Symposium on Automated Technology for Verification and Analysis, ATVA 2011
AU - Katz, Gal
AU - Peled, Doron
AU - Schewe, Sven
N1 - Funding Information: This work was partly supported by the Israel Science Foundation Grant 1262/09 and by the Engineering and Physical Science Research Council Grant EP/H046623/1.
PY - 2011
Y1 - 2011
N2 - Distributed control for enforcing a global invariant can be achieved based on calculating the knowledge of processes. When the local knowledge of individual processes is insufficient, processes can temporarily join their knowledge by means of synchronization. While synchronization can be used to guarantee progress, it is computationally expensive and should be used sparsely. In this paper, we introduce several solutions for minimizing the synchronization overhead. One possibility is to calculate the knowledge of a process of whether or not the system can progress without it. This knowledge can be used by the process to avoid unnecessary synchronization. Because of the distributed nature of the system, mutual passing of responsibility, based on such knowledge may result in deadlocks. We discuss three independent solutions to this problem. Our first solution breaks the symmetry between processes in order to avoid such situations, while our second solution is based on chance (coin tossing). Finally, we use automatically constructed stable properties to increase the joint knowledge of processes in order to minimize the number of processes that need to interact.
AB - Distributed control for enforcing a global invariant can be achieved based on calculating the knowledge of processes. When the local knowledge of individual processes is insufficient, processes can temporarily join their knowledge by means of synchronization. While synchronization can be used to guarantee progress, it is computationally expensive and should be used sparsely. In this paper, we introduce several solutions for minimizing the synchronization overhead. One possibility is to calculate the knowledge of a process of whether or not the system can progress without it. This knowledge can be used by the process to avoid unnecessary synchronization. Because of the distributed nature of the system, mutual passing of responsibility, based on such knowledge may result in deadlocks. We discuss three independent solutions to this problem. Our first solution breaks the symmetry between processes in order to avoid such situations, while our second solution is based on chance (coin tossing). Finally, we use automatically constructed stable properties to increase the joint knowledge of processes in order to minimize the number of processes that need to interact.
UR - http://www.scopus.com/inward/record.url?scp=80054067592&partnerID=8YFLogxK
U2 - https://doi.org/10.1007/978-3-642-24372-1_31
DO - https://doi.org/10.1007/978-3-642-24372-1_31
M3 - منشور من مؤتمر
SN - 9783642243714
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 422
EP - 431
BT - Automated Technology for Verification and Analysis - 9th International Symposium, ATVA 2011, Proceedings
Y2 - 11 October 2011 through 14 October 2011
ER -