Filters








4,013 Hits in 5.1 sec

Recording distributed snopshots based on causal order of message delivery

Arup Acharya, B.R. Badrinath
1992 Information Processing Letters  
This paper presents a simple and efficient algorithm to record a global snapshot of a distributed system, where all messages are sent and delivered in causal order.  ...  For a system with N processes, the algorithm requires N control messages to record a distributed snapshot of the system.  ...  Misra and the anonymous referees for their comments on an earlier version of the paper. Bibliography  ... 
doi:10.1016/0020-0190(92)90107-7 fatcat:opqj5omy55aozdz763cpcqr6pi

An introduction to snapshot algorithms in distributed computing

A D Kshemkalyani, M Raynal, M Singhal
1995 Distributed Systems Engineering  
Recording on-the-fly global states of distributed executions is an important paradigm when one is interested in analysing, testing, or verifying properties associated with these executions.  ...  Then several algorithms which determine on-the-fly such snapshots are presented for several types of networks (according to the properties of their communication channels, namely, FIFO, non-FIFO, and causal  ...  Acknowledgments The authors are grateful to Professors F Mattem and S Venkatesan for providing useful feedback on an earlier version of the paper.  ... 
doi:10.1088/0967-1846/2/4/005 fatcat:jea5erm5xvg45ht7qe36ot4beq

Taking snapshots of virtual networked environments

Ardalan Kangarlou, Dongyan Xu, Paul Ruth, Patrick Eugster
2007 Proceedings of the 3rd international workshop on Virtualization technology in distributed computing - VTDC '07  
More specifically, by adapting and implementing a distributed snapshot algorithm, we enable the capture of causally consistent snapshots of virtual machines in a virtual networked environment.  ...  Despite the large body of work at the application, library, and operating system levels, we identify a void in the spectrum of distributed snapshot techniques: taking snapshots of the entire distributed  ...  As such, VIOLIN switches are not required to achieve reliable, in-order delivery of the layer-2 (virtual) network frames.  ... 
doi:10.1145/1408654.1408658 dblp:conf/sc/KangarlouXRE07 fatcat:xe4tmbhtxbe7ffqkfaaoirpt7y

Verified Causal Broadcast with Liquid Haskell [article]

Patrick Redmond, Gan Shen, Niki Vazou, Lindsey Kuper
2022 arXiv   pre-print
on the existence of an underlying causally-ordered messaging layer to ensure that geo-distributed replicas eventually converge to the same state.  ...  Protocols to ensure that messages are delivered in causal order are a ubiquitous building block of distributed systems.  ...  Not unrelatedly, some snapshot algorithms for recording the global state of a distributed system [Acharya and Badrinath 1992; Alagar and Venkatesan 1994] rely on causal delivery, which simplifies their  ... 
arXiv:2206.14767v1 fatcat:nveqoc4nmfatlpdtvdmfem5ysa

Understanding the limitations of causally and totally ordered communication

David R. Cheriton, Dale Skeen
1993 Proceedings of the fourteenth ACM symposium on Operating systems principles - SOSP '93  
Causally and totally ordered communication support  ...  Consequently, many systems use or provide what we call prescriptive ordering where message delivery order is effectively based on ordering constraints explicitly specified or prescribed by a process at  ...  Our concern is with the merits of implementing ordering relationships on delivery of messages from multiple sources within the communication system.  ... 
doi:10.1145/168619.168623 dblp:conf/sosp/CheritonS93 fatcat:obqrakdk2fdjxekde52bqafs5e

Understanding the limitations of causally and totally ordered communication

David R. Cheriton, Dale Skeen
1993 ACM SIGOPS Operating Systems Review  
Causally and totally ordered communication support  ...  Consequently, many systems use or provide what we call prescriptive ordering where message delivery order is effectively based on ordering constraints explicitly specified or prescribed by a process at  ...  Our concern is with the merits of implementing ordering relationships on delivery of messages from multiple sources within the communication system.  ... 
doi:10.1145/173668.168623 fatcat:3cesoqj4z5dzjlo7stkis3i6ve

Detecting Arbitrary Stable Properties Using Efficient Snapshots

Ajay Kshemkalyani, Bin Wu
2007 IEEE Transactions on Software Engineering  
number of messages per global snapshot, or alter application message headers, or use inhibition, or use the execution history, or assume a strong property such as causal delivery of messages in the system  ...  A key feature of our algorithms is that they do not rely on the processes continually and pessimistically reporting their activity.  ...  A preliminary conference version of this result appears in [13] .  ... 
doi:10.1109/tse.2007.1000 fatcat:zfjcnmfocrcbzohylq3t5newqu

Impact of the Consistency Model on Checkpointing of Distributed Shared Memory [article]

Sandeep Kulkarni and Duong Nguyen and Lewis Tseng and Nitin Vaidya
2022 arXiv   pre-print
In this report, we consider the impact of the consistency model on checkpointing and rollback algorithms for distributed shared memory.  ...  In particular, we consider specific implementations of four consistency models for distributed shared memory, namely, linearizability, sequential consistency, causal consistency and eventual consistency  ...  The use of Marker messages below is motivated by analogous messages used in the Chandy-Lamport snapshot algorithm [2] .  ... 
arXiv:2208.02411v1 fatcat:l6isgjauvjfjzclcehk2ap2xu4

Logical Physical Clocks [chapter]

Sandeep S. Kulkarni, Murat Demirbas, Deepak Madappa, Bharadwaj Avva, Marcelo Leone
2014 Lecture Notes in Computer Science  
HLC captures the causality relationship like logical clocks, and enables easy identification of consistent snapshots in distributed systems.  ...  We show that HLC has many benefits for wait-free transaction ordering and performing snapshot reads in multiversion globally distributed databases.  ...  The material is based upon work supported by National Science Foundation awards NS-1329807 and CNS-1318678.  ... 
doi:10.1007/978-3-319-14472-6_2 fatcat:kkucyeh6pzahjhc6irwigxsyee

The Shape of Reactive Coordination Tasks [article]

Ido Ben-Zvi, Yoram Moses
2013 arXiv   pre-print
Altogether, the results presented provide a broad view of the causal shape underlying partially ordered coordinated actions.  ...  Necessary conditions are given for the causal structure in coordination problems consisting of orchestrating a set of actions in a manner that satisfies a variety of temporal ordering assumptions.  ...  Figure 4 : 4 An Optimal Distributed Snapshot Protocol Theorem 3 . 3 The Optimal Distributed Snapshot protocol ofFigure 4is all-case optimal: For every behavior of nature it records the state as soon  ... 
arXiv:1310.6407v1 fatcat:2o2s3o5yyjcopinxx2h2faixzm

An efficient validation approach for quasi-synchronous checkpointing oriented to distributed diagnosability

Houda Khlif, Hatem Hadj Kacem, Saúl E. Pomares Hernandez, Ahmed Hadj Kacem, Cédric Eichler, Alberto Calixto Simón
2016 Journal of Systems and Software  
In this paper, we propose an efficient validation approach based on a graph transformation oriented towards the automatic detection of the aforementioned properties.  ...  Based on this technique, several checkpointing algorithms have been developed.  ...  This graph is based on the Causal Order Set Abstraction (CAOS) to present causal dependencies in terms of sets of events.  ... 
doi:10.1016/j.jss.2016.04.070 fatcat:pxoh3wj3mjgz5mvsmvtrcu5aby

Edelweiss

Neil Conway, Peter Alvaro, Emily Andrews, Joseph M. Hellerstein
2014 Proceedings of the VLDB Endowment  
Event Log Exchange (ELE) is a common programming pattern based on immutable state and messaging.  ...  ELE sidesteps traditional challenges in distributed consistency, at the expense of introducing new challenges in designing space reclamation protocols to avoid consuming unbounded storage.  ...  Gross, Evan Sparks, and the reviewers for their helpful feedback on this paper.  ... 
doi:10.14778/2732279.2732285 fatcat:r3iypge3kfa4jaomirspdyea2q

Annotated bibliography on global states and times in distributed systems

Zhonghua Yang, T. Anthony Marsland
1993 ACM SIGOPS Operating Systems Review  
It deals with the need to take snapshots of global states in a distributed system, and the need for global time obtained through one of the following two methods: synchronizing local clocks with reference  ...  A distributed system consists of a collection of concurrently executing processes that do not use shared memory; processes communicate with each other solely through message-passing and coordinate among  ...  Note that the distributed snapshots exposed are based on a partial ordering view of the computation. SL87] S. K. Sarin and N. Lynch.  ... 
doi:10.1145/155870.155878 fatcat:4no65d2vt5clvlzh26hae7zdyq

High availability, elasticity, and strong consistency for massively parallel scans over relational data

Philipp Unterbrunner, Gustavo Alonso, Donald Kossmann
2013 The VLDB journal  
This paper focuses on the distribution layer of Crescando/RB, the problem and theory behind it, the rationale underlying key design decisions, and the novel multicast protocol and replication framework  ...  This paper presents a solution to these problems: Crescando/RB; a distributed, scan-based, main memory, relational data store (single table) with robust performance and high availability.  ...  Acknowledgments It requires the help of many people to build a real  ... 
doi:10.1007/s00778-013-0343-9 fatcat:byucle2e5jeavoho4qb5cjnofi

A Mechanism for the Causal Ordered Set Representation in Large-Scale Distributed Systems

Houda Khlif, Hatem Hadj Kacem, Saul E. Pomares Hernandez, Ahmed Hadj Kacem
2015 2015 IEEE 24th International Conference on Enabling Technologies: Infrastructure for Collaborative Enterprises  
The HBR is a strict partial order, and therefore, one main problem linked to it is the combinatorial state explosion.  ...  The resultant causal graphs can be used for different purposes, such as for the design of more efficient algorithms, validation, verification, and/or the debugging of the existing ones, among others.  ...  Such solutions are based on causal ordering property.  ... 
doi:10.1109/wetice.2015.20 dblp:conf/wetice/KhlifKHK15 fatcat:k6pomlk6d5hzreoetuoku5eyp4
« Previous Showing results 1 — 15 out of 4,013 results