Filters








2,289 Hits in 4.9 sec

Bounded concurrent timestamp systems using vector clocks

Sibsankar Haldar, Paul Vitányi
<span title="2002-01-01">2002</span> <i title="Association for Computing Machinery (ACM)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/r72grtxx6jad5hjzl7fxcunwhi" style="color: black;">Journal of the ACM</a> </i> &nbsp;
We propose a very efficient wait-free construction of bounded concurrent timestamp systems from 1-writer shared registers.  ...  That work partially initiated the current interest in wait-free concurrent objects, and introduced a notion of discrete vector clocks in distributed algorithms.  ...  have shown how these routines are used in constructing a bounded concurrent timestamp system.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/505241.505246">doi:10.1145/505241.505246</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/37leuywznvhini6rnk5fjt73vy">fatcat:37leuywznvhini6rnk5fjt73vy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170808225657/http://www.phil.uu.nl/ozsl/articles/Vitanyi03.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/d9/d7/d9d76e4c6cf2c4f0dfba332711ce1e281c2259ea.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/505241.505246"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Bounded Concurrent Timestamp Systems Using Vector Clocks [article]

Sibsankar Haldar and Paul Vitanyi (CWI and University of Amsterdam)
<span title="2001-08-02">2001</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We propose a very efficient wait-free construction of bounded concurrent timestamp systems from 1-writer multireader registers.  ...  That work partially initiated the current interest in wait-free concurrent objects, and introduced a notion of discrete vector clocks in distributed algorithms.  ...  It is used as a basis in the reference text [4] to describe bounded concurrent timestamp system.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/cs/0108002v1">arXiv:cs/0108002v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/yfpv6ifus5byxlfuwr7u5y6psu">fatcat:yfpv6ifus5byxlfuwr7u5y6psu</a> </span>
<a target="_blank" rel="noopener" href="https://archive.org/download/arxiv-cs0108002/cs0108002.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> File Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/03/11/0311c3e62b787946cba41213898b73f130ecb819.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/cs/0108002v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

k-Dependency Vectors: a scalable causality-tracking protocol

R. Baldoni, G. Melideo
<span title="">2003</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/f3hr4iv3tvhrldoukhnurnloh4" style="color: black;">Eleventh Euromicro Conference on Parallel, Distributed and Network-Based Processing, 2003. Proceedings.</a> </i> &nbsp;
These integers are selected from a vector of size Ò which is local at each process.  ...  In this paper we present a scalable causality-tracking protocol, called -Dependency Vectors, which piggybacks on each application message a constant number of integers (with Ò).  ...  As plausible clocks may violate concurrency, they are useful in systems where ordering of concurrent events impacts performance not correctness.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/empdp.2003.1183592">doi:10.1109/empdp.2003.1183592</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/pdp/BaldoniM03.html">dblp:conf/pdp/BaldoniM03</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/nwvwzs3a35gency46hbrashr7y">fatcat:nwvwzs3a35gency46hbrashr7y</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170822003009/http://midlab.diag.uniroma1.it:80/articoli/BM_PDNBP03.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/22/36/22363b627aaea2588d9368dc999cd285d48e366d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/empdp.2003.1183592"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

An Online Algorithm for Dimension-Bound Analysis [chapter]

PaulA.S. Ward
<span title="">1999</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
Most vector clock algorithms, and all online ones, simply use a vector of size equal to the number of processes. In practice the dimension may be much smaller.  ...  The vector-clock size necessary to characterize causality in a distributed computation is bounded by the dimension of the partial order induced by that computation.  ...  Acknowledgment The author would like to thank IBM for supporting this work and David Taylor for many useful discussions.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-48311-x_16">doi:10.1007/3-540-48311-x_16</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/zfru5xipzjd5hbenb7lgkjrxca">fatcat:zfru5xipzjd5hbenb7lgkjrxca</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20040715173349/http://www.shoshin.uwaterloo.ca:80/~pasward/Publications/icpp99.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/8f/b2/8fb2b3b560ba949a8c003e39d4b56ba173102cae.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-48311-x_16"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Optimistic replication

Yasushi Saito, Marc Shapiro
<span title="2005-03-01">2005</span> <i title="Association for Computing Machinery (ACM)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/eiea26iqqjcatatlgxdpzt637y" style="color: black;">ACM Computing Surveys</a> </i> &nbsp;
This paper identifies key challenges facing optimistic replication systems -ordering operations, detecting and resolving conflicts, propagating changes efficiently, and bounding replica divergence -and  ...  Data replication is a key technology in distributed data sharing systems, enabling higher availability and performance.  ...  Several statetransfer systems use vector clocks to detect conflicts, defining any two concurrent updates to the same object to be in conflict.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1057977.1057980">doi:10.1145/1057977.1057980</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/e3uc7nrlyfc25mazo7qlwt6kge">fatcat:e3uc7nrlyfc25mazo7qlwt6kge</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20060908084226/http://www.cs.wisc.edu/~remzi/Classes/739/Spring2004/Papers/optimistic-survey.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/8c/7f/8c7fcb3cfcec240ad957b40a3ab925cd3dd1f772.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1057977.1057980"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Causality and the spatial-temporal ordering of events in mobile systems

R. Prakash, R. Baldoni
<span title="">1999</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/mfwemajbqjcy7hji6w3ztzfccu" style="color: black;">Proceedings. Tenth International Workshop on Database and Expert Systems Applications. DEXA 99</a> </i> &nbsp;
We introduce then the notion of space-time vector used by processes to track the mobility of nodes.  ...  In this paper we present a framework, based on the capabilities of Global Positioning System, which provides processes with a global virtual clock and a positioning service.  ...  Until now the usual approach has been to order events based on their scalar or vector timestamps, and if two events were mutually concurrent the tie was broken using the identities of the processes on  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/dexa.1999.795153">doi:10.1109/dexa.1999.795153</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/dexaw/PrakashB99.html">dblp:conf/dexaw/PrakashB99</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/6gvjdpo57zditgp2jgrkbihc3e">fatcat:6gvjdpo57zditgp2jgrkbihc3e</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809060724/http://midlab.diag.uniroma1.it/articoli/02810116.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/33/d0/33d0ed3b6a44d664252db207c3597a2bbcae04a4.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/dexa.1999.795153"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Efficient dependency tracking for relevant events in concurrent systems

Anurag Agarwal, Vijay K. Garg
<span title="2006-05-04">2006</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/c5flcyc6ozdv3p2dehbhbc7pqy" style="color: black;">Distributed computing</a> </i> &nbsp;
In a concurrent system with N processes, vector clocks of size N are used for tracking dependencies between the events. Using vectors of size N leads to scalability problems.  ...  With 1% of total events being relevant events, DCC requires 10 times fewer components than vector clock and the timestamp traces are smaller by a factor of 100.  ...  Chain clocks use this idea to generalize the vector clock algorithm. In the vector clock algorithm, a component of the vector is associated with a process in the system.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s00446-006-0004-y">doi:10.1007/s00446-006-0004-y</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/xpys4wwuh5aotlmm3uv4j3a62y">fatcat:xpys4wwuh5aotlmm3uv4j3a62y</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20070418160335/http://users.ece.utexas.edu/~garg/dist/agarwal-garg-DC.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/39/34/39344582a98b03e45c77a4bcd786b400c43f4c63.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s00446-006-0004-y"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Registers [article]

Paul M.B. Vitanyi
<span title="2006-12-05">2006</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
The system has no global clock or other synchronization primitives.  ...  Problem Definition: Consider a system of asynchronous processes that communicate among themselves by only executing read and write operations on a set of shared variables (also known as shared registers  ...  The first generally accepted solution of the concurrent case of bounded timestamp system is due to Dolev and Shavit [3] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/cs/0612025v1">arXiv:cs/0612025v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/fm7poejxv5gcnnfdhpfqycsule">fatcat:fm7poejxv5gcnnfdhpfqycsule</a> </span>
<a target="_blank" rel="noopener" href="https://archive.org/download/arxiv-cs0612025/cs0612025.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> File Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/c1/2c/c12ce79979e0b5b86ad89d17b60b6b4647904700.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/cs/0612025v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Efficient dependency tracking for relevant events in shared-memory systems

Anurag Agarwal, Vijay K. Garg
<span title="">2005</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/t5fzg7fyy5byfdcl2vrzbn43ty" style="color: black;">Proceedings of the twenty-fourth annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing - PODC &#39;05</a> </i> &nbsp;
In a concurrent system with N processes, vector clocks of size N are used for tracking dependencies between the events. Using vectors of size N leads to scalability problems.  ...  With 1% of total events being relevant events, DCC requires 10 times fewer components than vector clock and the timestamp traces are smaller by a factor of 100.  ...  One approach to tackle the scalability issue with vector clocks is to weaken the guarantees provided and use clocks with bounded size.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1073814.1073818">doi:10.1145/1073814.1073818</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/podc/AgarwalG05.html">dblp:conf/podc/AgarwalG05</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/kihmtodiczcvlemyvb3cqbpt4a">fatcat:kihmtodiczcvlemyvb3cqbpt4a</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20081031175333/http://users.ece.utexas.edu/~garg/sp07/382n/podc05.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/df/03/df0301a19b8cf404e2bae84a6d72bd4f1b51d3f0.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1073814.1073818"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

A tree clock data structure for causal orderings in concurrent executions

Umang Mathur, Andreas Pavlogiannis, Hünkar Can Tunç, Mahesh Viswanathan
<span title="2022-02-28">2022</span> <i title="ACM"> Proceedings of the 27th ACM International Conference on Architectural Support for Programming Languages and Operating Systems </i> &nbsp;
Often a crucial step in these techniques is to define a causal ordering between events in the execution, which is then computed using vector clocks, a simple data structure that stores logical times of  ...  In this work, we introduce tree clocks, a new data structure that replaces vector clocks for computing causal orderings in program executions.  ...  The use of vector clocks enables designing streaming algorithms, which are also suitable for monitoring the system.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/3503222.3507734">doi:10.1145/3503222.3507734</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/z6bdu45mvfegpijky5rriicnme">fatcat:z6bdu45mvfegpijky5rriicnme</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220314064751/https://dl.acm.org/doi/pdf/10.1145/3503222.3507734" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/8a/0d/8a0d2d4dc72591298b107678d52b83675aca8818.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/3503222.3507734"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

From causal to z-linearizable transactional memory

Torval Riegel, Christof Fetzer, Heiko Sturzrehm, Pascal Felber
<span title="">2007</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/t5fzg7fyy5byfdcl2vrzbn43ty" style="color: black;">Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing - PODC &#39;07</a> </i> &nbsp;
Linearizability matches well the goal of TM to simplify the design and implementation of concurrent applications.  ...  In this paper, we investigate the use of weaker semantics for TM and introduce a new consistency criterion that we call z-linearizability.  ...  Practical Vector Time using Plausible Clocks The main drawbacks of vector clocks are their runtime and space overheads.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1281100.1281162">doi:10.1145/1281100.1281162</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/podc/RiegelFSF07.html">dblp:conf/podc/RiegelFSF07</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/kvht3lf7xfbcrheru2mybf3muu">fatcat:kvht3lf7xfbcrheru2mybf3muu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20130309122709/http://members.unine.ch:80/pascal.felber/publications/RR-I-07-02.1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/ec/8f/ec8f365ee5ee4462b6b5fcd0ac2d300f75b530cc.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1281100.1281162"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Resettable Encoded Vector Clock for Causality Analysis with an Application to Dynamic Race Detection

Tommaso Pozzetti, Ajay Kshemkalyani
<span title="">2020</span> <i title="Institute of Electrical and Electronics Engineers (IEEE)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ll6bfs5o6bahfinh3u5z2cnyoy" style="color: black;">IEEE Transactions on Parallel and Distributed Systems</a> </i> &nbsp;
Several implementations of logical clocks have been proposed, most recently the Encoded Vector Clock (EVC), a protocol to encode Vector Clocks (VC) in scalar numbers through the use of prime numbers, to  ...  We show how our REVC can be applied in both shared memory systems and message passing systems to achieve a consistent logical clock.  ...  Plausible clocks are approximation clocks that use fewer entries in their vector than vector clocks [14] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/tpds.2020.3032293">doi:10.1109/tpds.2020.3032293</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/jl2ozcg5ufg7tncxv5ltzfid7m">fatcat:jl2ozcg5ufg7tncxv5ltzfid7m</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20210717144405/https://ieeexplore.ieee.org/ielx7/71/9257114/09234035.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/e7/fb/e7fbf7bce1719caee98610605102f1e92bfb5e07.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/tpds.2020.3032293"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

A Tree Clock Data Structure for Causal Orderings in Concurrent Executions [article]

Umang Mathur, Andreas Pavlogiannis, Hünkar Can Tunç, Mahesh Viswanathan
<span title="2022-01-17">2022</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Often a crucial step in these techniques is to define a causal ordering between events in the execution, which is then computed using vector clocks, a simple data structure that stores logical times of  ...  In this work, we introduce tree clocks, a new data structure that replaces vector clocks for computing causal orderings in program executions.  ...  CLOCK DATA STRUCTURE the operations on vector timestamps.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2201.06325v1">arXiv:2201.06325v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/pa7dshhvevcvlmoag4pm3ye5ua">fatcat:pa7dshhvevcvlmoag4pm3ye5ua</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220121202348/https://arxiv.org/pdf/2201.06325v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/0d/76/0d764e0af26315e750b67a51a8a6503aceee5b42.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2201.06325v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Clock-SI: Snapshot Isolation for Partitioned Data Stores Using Loosely Synchronized Clocks

Jiaqing Du, Sameh Elnikety, Willy Zwaenepoel
<span title="">2013</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/vb3ehoarofgm5p24f2dqjxmp3a" style="color: black;">2013 IEEE 32nd International Symposium on Reliable Distributed Systems</a> </i> &nbsp;
It derives snapshot and commit timestamps from loosely synchronized clocks, rather than from a centralized timestamp authority as used in current systems.  ...  We verify the model predictions using a system implementation.  ...  Continuous consistency [34] bounds staleness using a real-time vector. These systems do not use physical clocks to assign transaction snapshot and commit timestamps.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/srds.2013.26">doi:10.1109/srds.2013.26</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/srds/DuEZ13.html">dblp:conf/srds/DuEZ13</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ijdwz7h4njcb5a4iwan6xiy2pi">fatcat:ijdwz7h4njcb5a4iwan6xiy2pi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170819052336/https://infoscience.epfl.ch/record/187553/files/srds2013_clocksi.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/8e/8c/8e8cc39a72535aa992662541bbf89c297c198531.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/srds.2013.26"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Logical Physical Clocks [chapter]

Sandeep S. Kulkarni, Murat Demirbas, Deepak Madappa, Bharadwaj Avva, Marcelo Leone
<span title="">2014</span> <i title="Springer International Publishing"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
There is a gap between the theory and practice of distributed systems in terms of the use of time.  ...  Dually, HLC can be used in lieu of physical/NTP clocks since it maintains its logical clock to be always close to the NTP clock.  ...  This is obsolete for today's integrated, loosely-coupled system of systems. In 1988, the vector clock (VC) [9, 22] was proposed to maintain a vectorized version of LC.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-14472-6_2">doi:10.1007/978-3-319-14472-6_2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/kkucyeh6pzahjhc6irwigxsyee">fatcat:kkucyeh6pzahjhc6irwigxsyee</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170829130530/https://www.cse.buffalo.edu//~demirbas/publications/hlc.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/ce/a6/cea6a30d755ddc145bc886a9cb733c81c77b6568.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-14472-6_2"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 2,289 results