Filters








452 Hits in 2.4 sec

Timestamp-based orphan elimination

M.P. Herlihy, M.S. McKendry
1989 IEEE Transactions on Software Engineering  
orphans are eventually eliminated as information propagates through the system.  ...  The method ensures that orphans are detected and eliminated in a timely manner, and it prevents them from observing inconsistent states.  ...  EAGER ORPHAN ELIMINATION This section describes an orphan elimination method based on a system of approximately synchronized realtime clocks (e.g., [13] ).  ... 
doi:10.1109/32.29482 fatcat:5ejeax6birgqfksn4pufuhsete

Timestamp-based orphan elimination

Maurice Herlihy, Martin S. McKendry
2018
[4] Eager Orphan Elimination This section describes an orphan elimination method based on a system of approximately-synchronized real-time clocks (e.g  ...  An orphan elimination scheme based on Walker's method has been implemented as part of the Argus system [11] .  ... 
doi:10.1184/r1/6610916.v1 fatcat:evamcphflrawjbshmgzdttin6e

Vertical and horizontal synchronization services with outlier detection in underwater acoustic networks

Fei Hu, Yamin Malkawi, Sunil Kumar, Yang Xiao
2008 Wireless Communications and Mobile Computing  
Clock synchronization is an important protocol to achieve timing-based sensor communications.  ...  The proposed model can detect outlier timestamp data and identify nodes generating insider attacks.  ...  During DTP we need to eliminate outlier nodes, whose clock variance is above some threshold based on a specific type of variance calculation, termed the Allen variance [17] .  ... 
doi:10.1002/wcm.559 fatcat:mnsmvzysvraavc66rcgx24dmzm

Optimistic distributed simulation based on transitive dependency tracking

Om P. Damani, Yi-Min Wang, Vijay K. Garg
1997 ACM SIGSIM Simulation Digest  
This eliminates the need for output queues and results in simple memory management. It also eliminates the problem of cascading rollbacks and echoing, and results in faster simulation.  ...  The optimistic protocol presented in this paper is based on the optimistic recovery protocol presented in 4, 21] .  ...  It also eliminates the problem of cascading rollbacks and echoing 15], resulting in faster simulation. We use aggressive cancellation 7].  ... 
doi:10.1145/268823.268906 fatcat:g5jadyqeqneqtn4f4mnjz4g2va

Improving Mobile Sensor Connectivity Time in the IEEE 802.15.4 Networks

Kartinah Zen, Daryoush Habibi, Iftekhar Ahmad
2008 2008 Australasian Telecommunication Networks and Applications Conference  
Our method is based on the timestamp of the beacons received from the nearby coordinators and filtering weak beacon signals.  ...  Our method is based on the use of two parameters: link quality indicator (LQI) and timestamps of the received beacons.  ...  Based on the previous example in Fig. 4 , we can calculate the distance from orphan node to b, Δ b and the distance from the orphan node to c, Δ c . Δ b = r a − γ (6) Δ c = γ − (r a − γ) (7) From Equ  ... 
doi:10.1109/atnac.2008.4783343 fatcat:dr6xdns3gzh4df64u3scwt6om4

Hybrid atomicity for nested transactions [chapter]

Alan Fekete, Nancy Lynch, William E. Weihl
1992 Lecture Notes in Computer Science  
It allows more concurrency than dynamic atomicity, by assigning timestamps to transactions at commit. The Avalon system provides exactly this facility.  ...  imposed by commntativity to be eliminated [7, 8] .  ...  Notice the difference between this order and the order local-pseudotime-order(/3) defined in [2], where the order was based on the timestamps of the accesses, rather than on the timestamps of the sibling  ... 
doi:10.1007/3-540-56039-4_43 fatcat:iweldgwcr5hzlngvvdmgd2whim

Hybrid atomicity for nested transactions

Alan Fekete, Nancy Lynch, William E. Weihl
1995 Theoretical Computer Science  
The results in this paper extend earlier work using the same model for locking and timestamp-based algorithms, providing further evidence for the generality of the approach.  ...  It allows more concurrency than dynamic atomicity, by assigning timestamps to transactions at commit. The Avalon system provides exactly this facility.  ...  imposed by commutativity to be eliminated [6, 7] .  ... 
doi:10.1016/0304-3975(95)00029-v fatcat:nlakgskk4beexjohwnogaodbtm

A Lightweight Heuristic-based Mechanism for Collecting Committed Consistent Global States in Optimistic Simulation

Diego Cucuzzo, Stefano D'Alessio, Francesco Quaglia, Paolo Romano
2007 11th IEEE International Symposium on Distributed Simulation and Real-Time Applications (DS-RT'07)  
This is done by introducing a heuristic-based mechanism relying on update operations applied to local committed checkpoints of the involved logical processes so to eliminate mutual dependencies among the  ...  Our proposal can support, in a performance effective manner, termination detection schemes based on global predicates evaluated on a committed and consistent global snapshot, which represent an alternative  ...  The timestamps of events destined to the very same LP are not relevant since the scheduling of these events cannot originate (orphan) messages across different LPs.  ... 
doi:10.1109/ds-rt.2007.18 dblp:conf/dsrt/CucuzzoDQR07 fatcat:ehw5dnwwq5audisu44tke7jieu

Fault-tolerant distributed simulation

Om. P. Damani, Vijay K. Garg
1998 ACM SIGSIM Simulation Digest  
In this paper, a rollback based optimistic faulttolerance scheme is integrated with an optimistic distributed simulation scheme.  ...  Our use of transitive dependency tracking eliminates antimessages. LPs are clubbed in clusters to minimize stable storage access time.  ...  They can be classi ed into two broad categories: replication based 4 and checkpointing based 7 .  ... 
doi:10.1145/278009.278014 fatcat:3u2gbuklord7jjytlpyduo3af4

Highly available distributed services and fault-tolerant distributed garbage collection

Barbara Liskov, Rivka Ladin
1986 Proceedings of the fifth annual ACM symposium on Principles of distributed computing - PODC '86  
The lookup operation takes a timestamp as an argument; it returns information based on a state with a timestamp at least as large as that timestamp.  ...  To allow clients to make sense of a response based on partial information, we mark each response with a timestamp [10] .  ... 
doi:10.1145/10590.10593 dblp:conf/podc/LiskovL86 fatcat:bo43bv25nvfqndqf52z7i5xjnu

Online, asynchronous schema change in F1

Ian Rae, Eric Rollins, Jeff Shute, Sukhdeep Sodhi, Radek Vingralek
2013 Proceedings of the VLDB Endowment  
Concurrency control F1 uses a form of timestamp-based optimistic concurrency control similar to that found in Percolator [14] , which is also built on top of a distributed key-value store.  ...  These relational operations are translated into changes to the key-value store based on the schema.  ... 
doi:10.14778/2536222.2536230 fatcat:bblikdhjzjcyvk3do2z2gl6p2q

Rectifying orphan components using group-failover in distributed real-time and embedded systems

Sumant Tambe, Aniruddha Gokhale
2011 Proceedings of the 14th international ACM Sigsoft symposium on Component based software engineering - CBSE '11  
this problem in the context of resource constrained, componentbased, distributed real-time and embedded (DRE) systems that form end-to-end task chains is challenging because conventional transaction-based  ...  Orphan requests stem from the failure(s) of non-deterministic components involved in nested invocations of replicated components.  ...  Finally, timestamp-based orphan elimination techniques [23, 24] have been developed to remove crash and abort orphans from the system.  ... 
doi:10.1145/2000229.2000250 dblp:conf/cbse/TambeG11 fatcat:vwqpirjngfdc5mufqm5aggomcq

Transactional In-Page Logging for multiversion read consistency and recovery

Sang-Won Lee, Bongki Moon
2011 2011 IEEE 27th International Conference on Data Engineering  
Recently, a new buffer and storage management strategy called In-Page Logging (IPL) has been proposed for database systems based on flash memory.  ...  data pages, because their timestamps would be all newer than the timestamp of T long .  ...  The three phase commit policy aims at eliminating the need of redo recovery.  ... 
doi:10.1109/icde.2011.5767889 dblp:conf/icde/LeeM11 fatcat:hilkhhz2tbhytl4yvcpesbqasq

Efficient Migration Algorithm for Mobile Agents in Wired/Wireless Internets [chapter]

Sukwoo Han, Kuinam J. Kim, Young-Sung Kim
2003 Lecture Notes in Computer Science  
If the node N3 dose not recovered, the agent may be orphaned or destroyed by the particular client.  ...  Mole [2] supports the shadow protocol for orphan detection and successful termination for agents in mobile agent systems.  ... 
doi:10.1007/3-540-44864-0_65 fatcat:yw7bkuljnjdzrizzjg3ydndvfm

Clonos

Pedro F. Silvestre, Marios Fragkoulis, Diomidis Spinellis, Asterios Katsifodimos
2021 Proceedings of the 2021 International Conference on Management of Data  
The downstream operator can simply discard the records bearing the already seen logical timestamps. However, receiver-based deduplication wastes bandwidth.  ...  In that case, the downstream operators cannot correctly eliminate duplicates as they cannot distinguish them from non-duplicates.  ... 
doi:10.1145/3448016.3457320 fatcat:vnep7t3np5etnhsevyqn3fggam
« Previous Showing results 1 — 15 out of 452 results