TY - GEN
T1 - Possible and impossible vector clock sets
AU - Meneses, Esteban
AU - Torres-Rojas, Francisco J.
PY - 2004
Y1 - 2004
N2 - It is well known that vector docks capture perfectly the causality relationship among events in a distributed system. However, there are some interesting properties of vector clocks that are still to be explored. In particular, we are interested in discovering whether there is an efficient procedure for deciding if a given set of vector clocks is contained in some distributed history. We call this the possible vector clock set problem.
AB - It is well known that vector docks capture perfectly the causality relationship among events in a distributed system. However, there are some interesting properties of vector clocks that are still to be explored. In particular, we are interested in discovering whether there is an efficient procedure for deciding if a given set of vector clocks is contained in some distributed history. We call this the possible vector clock set problem.
KW - Distributed Computing
KW - Logical Clocks
KW - Vector Clocks
UR - https://www.scopus.com/pages/publications/12244308652
M3 - Contribución a la conferencia
AN - SCOPUS:12244308652
SN - 1932415262
SN - 9781932415261
T3 - Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA'04
SP - 1416
EP - 1422
BT - Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA'04
A2 - Arabnia, H.R.
T2 - Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA'04
Y2 - 21 June 2004 through 24 June 2004
ER -