TY - GEN
T1 - Combinatorics and geometry of consistent cuts
T2 - 3rd International Workshop on Distributed Algorithms, WDAG 1989
AU - Charron-Bost, Bernadette
N1 - Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1989.
PY - 1989/1/1
Y1 - 1989/1/1
N2 - We define a concurrency measure of a distributed computation which is based on the number μ of its consistent cuts. We prove that counting consistent cuts takes into account the non-transitivity of the concurrency relation. Besides this combinatorial study, we give a geometric interpretation of μ using the clock designed by Fidge and Mattern for characterizing concurrency between two events. This geometric approach shows how much this clock is also a powerful tool for assessing the global concurrency. Moreover it provides a geometric picture of the concurrency phenomena in a distributed computation.
AB - We define a concurrency measure of a distributed computation which is based on the number μ of its consistent cuts. We prove that counting consistent cuts takes into account the non-transitivity of the concurrency relation. Besides this combinatorial study, we give a geometric interpretation of μ using the clock designed by Fidge and Mattern for characterizing concurrency between two events. This geometric approach shows how much this clock is also a powerful tool for assessing the global concurrency. Moreover it provides a geometric picture of the concurrency phenomena in a distributed computation.
U2 - 10.1007/3-540-51687-5_31
DO - 10.1007/3-540-51687-5_31
M3 - Conference contribution
AN - SCOPUS:2942745660
SN - 9783540516873
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 45
EP - 56
BT - Distributed Algorithms - 3rd International Workshop, Proceedings
A2 - Bermond, Jean-Claude
A2 - Raynal, Michel
PB - Springer Verlag
Y2 - 26 September 1989 through 28 September 1989
ER -