Zobrazeno 1 - 10
of 1 629
pro vyhledávání: '"Vector clock"'
We consider an information dissemination problem where the root of an undirected graph constantly updates its information. The goal is to keep every other node in the graph about the root as freshly informed as possible. Our synchronous information s
Externí odkaz:
http://arxiv.org/abs/2111.05450
Autor:
Ramabaja, Lum
The Binary Vector Clock is a simple, yet space-efficient algorithm for generating a partial order of transactions in account-based blockchain systems. The Binary Vector Clock solves the problem of order dependency in systems such as Ethereum, caused
Externí odkaz:
http://arxiv.org/abs/2004.07087
Autor:
Zheng, Xiong, Garg, Vijay
Tracking causality (or happened-before relation) between events is useful for many applications such as debugging and recovery from failures. Consider a concurrent system with $n$ threads and $m$ objects. For such systems, either a vector clock of si
Externí odkaz:
http://arxiv.org/abs/1901.06545
Publikováno v:
In Journal of Parallel and Distributed Computing June 2020 140:37-51
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Resettable Encoded Vector Clock for Causality Analysis With an Application to Dynamic Race Detection
Autor:
Tommaso Pozzetti, Ajay D. Kshemkalyani
Publikováno v:
IEEE Transactions on Parallel and Distributed Systems. 32:772-785
Causality tracking among events is a fundamental challenge in distributed environments. Much previous work on this subject has focused on designing an efficient and scalable protocol to represent logical time. Several implementations of logical clock
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3718045bb66bee897e668976a9ccf89d
https://doi.org/10.1109/tpds.2020.3032293
https://doi.org/10.1109/tpds.2020.3032293
Publikováno v:
Journal of Parallel and Distributed Computing. 140:37-51
The vector clock is a fundamental tool for tracking causality in distributed applications. Unfortunately, it does not scale well to large systems because each process needs to maintain a vector of size n , where n is the total number of processes in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cd2979298721838b690d752b349299c0
https://doi.org/10.1016/j.jpdc.2020.02.008
https://doi.org/10.1016/j.jpdc.2020.02.008
Publikováno v:
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) ISBN: 9781611977554
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a38c0533901356328fff210ba510e208
https://doi.org/10.1137/1.9781611977554.ch93
https://doi.org/10.1137/1.9781611977554.ch93
Conference
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Vijay K. Garg, Xiong Zheng
Publikováno v:
ICDCS
Tracking causality (or happened-before relation) between events is useful for many applications such as debugging and recovery from failures. Consider a concurrent system with n threads and m objects. For such systems, either a vector clock of size n
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::73e6a402e3dbaed790f8ef1c8ee04b58
https://doi.org/10.1109/icdcs.2019.00215
https://doi.org/10.1109/icdcs.2019.00215