8,144 Hits in 6.4 sec

Generating Fast Atomic Commit from Hyperfast Consensus [chapter]

Fabíola Gonçalves Pereira Greve, Jean-Pierre Le Narzul
2005 Lecture Notes in Computer Science  
One of the presented protocols outperforms existing equivalent solutions that are based on the use of failure detectors.  ...  This work introduces a highly modular derivation of fast non-blocking atomic commit protocols. Modularity is achieved by the use of consensus protocols as completely independent services.  ...  Acknowledgments The authors would like to thank Michel Hurfin from IRISA Labs at Rennes (France) for its valuable contribution to this work.  ... 
doi:10.1007/11572329_18 fatcat:pbbghbk3i5c67mk7odx6ih5ffm

The generic consensus service

R. Guerraoui, A. Schiper
2001 IEEE Transactions on Software Engineering  
AbstractÐThis paper describes a modular approach for the construction of fault-tolerant agreement protocols. The approach is based on a generic consensus service.  ...  We illustrate our approach on the construction of various fault-tolerant agreement protocols, such as nonblocking atomic commitment, group membership, view synchronous communication, and total order multicast  ...  This paper is an extended and revised version of a paper that appeared, under the title ªConsensus Service: A Modular Approach for Building Agreement Protocols in Distributed Systems,º in the Proceedings  ... 
doi:10.1109/32.895986 fatcat:tedqjivnnrg77ehcywfaz5wbgu

Visualizing Transactional Algorithms for DHTs

Boris Mejías, Mikael Högqvist, Peter Van Roy
2008 2008 Eighth International Conference on Peer-to-Peer Computing  
Acknowledgements The authors would like to thank Monika Moser and Seif Haridi for their help on the understanding of the Paxos consensus algorithm.  ...  Demonstrator We implement two-phase commit and the Paxos consensus-based algorithm on top of a Chord-like structured overlay network [5] , extending the PEPINO network inspector [3] for visualization  ...  This problem lead to the recent introduction of [4] based on Paxos consensus [2] .  ... 
doi:10.1109/p2p.2008.48 dblp:conf/p2p/MejiasHR08 fatcat:jjcfafd3oves7cmxkhbpfrxfsi

Brief Announcement: Optimistic Algorithms for Partial Database Replication [chapter]

Nicolas Schiper, Rodrigo Schmidt, Fernando Pedone
2006 Lecture Notes in Computer Science  
In [5] , the authors extend the DBSM for partial replication by adding an extra atomic commit protocol.  ...  In [2] , every operation of a transaction on data item x is multicast to its replicas and a final atomic commit protocol ensures transaction atomicity.  ... 
doi:10.1007/11864219_44 fatcat:hxppjtqbjbayfhg6cu6jqbjug4

Supporting Linearizable Semantics in Replicated Databases

Luis Rodrigues, Nuno Carvalho, Emili Miedes
2008 2008 Seventh IEEE International Symposium on Network Computing and Applications  
The proposed algorithm supports the use of quorums to trade the availability/efficiency of read and write operations, making a bridge between consensus-based and quorum based solutions for database replication  ...  Furthermore, the algorithm offers better performance for linearizable read-only transactions with a negligible impact on write transactions.  ...  Furthermore, contrary to primary-backup style solutions, that redirect all read operations to a single replica, we allow the parallel execution of read-only transactions in multiple replicas.  ... 
doi:10.1109/nca.2008.22 dblp:conf/nca/RodriguesCM08 fatcat:dxp2qmnxaja2vbseis4g5d4wk4

Concurrency versus availability: atomicity mechanisms for replicated data

Maurice Herlihy
1987 ACM Transactions on Computer Systems  
This paper explores an alternative approach to managing replicated data by presenting two replication methods in which concurrency control and replica management are handled by a single integrated protocol  ...  These integrated protocols permit more concurrency than independent protocols, and they allow availability and concurrency to be traded off: Constraints on concurrency may be relaxed if constraints on  ...  If any of these quorums were required to intersect, then G would not be >g-closed, a contradiction.  ... 
doi:10.1145/24068.27643 fatcat:ayrptvmbcja7xirxv3lnuyleo4

Blockchain Interoperability: Towards a Sustainable Payment System

Debasis Mohanty, Divya Anand, Hani Moaiteq Aljahdali, Santos Gracia Villar
2022 Sustainability  
We focused on the atomic transactions between blockchain, a process also known as atomic swap.  ...  We performed a systematic review of the existing literature on Blockchain interoperability and atomic cross-chain transactions.  ...  We provided important suggestions in relation to the issues identified, as well as a discussion on the challenges of inter-chain swap.  ... 
doi:10.3390/su14020913 fatcat:kuprahfrunf5rd6bsngsex4x6u

SoK: Exploring Blockchains Interoperability [article]

Gang Wang
2021 IACR Cryptology ePrint Archive  
We then survey and compare the state-of-the-art solutions to deal with the interoperability of blockchains in detail.  ...  Finally, we discuss several critical challenges and some potential research directions to advance the research on exploring blockchain interoperability.  ...  In a nutshell, Wanchain adopts a PoS consensus protocol to get a consensus, which was originally forked from an Ethereum-based generic ledger.  ... 
dblp:journals/iacr/Wang21a fatcat:qjtwv6yozbcblgsnev7al3z2oe

Optimistic Algorithms for Partial Database Replication [chapter]

Nicolas Schiper, Rodrigo Schmidt, Fernando Pedone
2006 Lecture Notes in Computer Science  
Database replication protocols based on group communication have recently received a lot of attention [1, 2, 8, 9, 10, 12, 15, 17] .  ...  In this paper, we extend the Database State Machine (DBSM) [12], a group-communication-based database replication technique, to partial replication.  ...  A final atomic commit protocol ensures transaction atomicity. In [16] , the authors extend the DBSM for partial replication by adding an extra atomic commit protocol.  ... 
doi:10.1007/11945529_7 fatcat:3d7engrnc5fc5f4i7hcko2dhb4

Consensus in a Box: Inexpensive Coordination in Hardware

Zsolt István, David Sidler, Gustavo Alonso, Marko Vukolic
2016 Symposium on Networked Systems Design and Implementation  
to the Proceedings of the 13th USENIX Symposium on Networked Systems Design and Implementation (NSDI '16) is sponsored by USENIX.  ...  We would also like to thank our shepherd, Wyatt Lloyd, for his help in improving our paper.  ...  Acknowledgments We would like to thank Xilinx for the donation of the FPGA boards used in this paper.  ... 
dblp:conf/nsdi/IstvanSAV16 fatcat:6fdkek6lznacxhkh54b3rqqaw4

Model Checking a Modular-Structured Nonblocking Atomic Commitment Protocol for Asynchronous Distributed Systems

Eun-Hye Choi, Keishi Okamoto, Tatsuhiro Tsuchiya, Tohru Kikuno
2009 2009 Software Technologies for Future Dependable Distributed Systems  
Various principal fault-tolerant agreement protocols for asynchronous distributed systems, such as atomic commitment and view synchrony, can be constructed in a modular way which is based on consensus  ...  In this paper, we focus on a modularstructured nonblocking atomic commitment (NBAC) protocol as a case study and propose a method to verify the protocol by model checking.  ...  Just before the completion of a transaction, nodes have to solve an atomic commitment problem [1] in order to decide on commit or abort of the transaction.  ... 
doi:10.1109/stfssd.2009.34 fatcat:spn3zszarjdz7nximb2w2rta4a

Survey: Sharding in Blockchains

Guangsheng Yu, Xu Wang, Kan Yu, Wei Ni, J. Andrew Zhang, Ren Ping Liu
2020 IEEE Access  
The Blockchain technology, featured with its decentralized tamper-resistance based on a Peer-to-Peer network, has been widely applied in financial applications, and even further been extended to industrial  ...  They range from modifying the on-chain data structure and consensus algorithms to adding the off-chain technologies.  ...  UCOT Australia is a full-industry chain anti-counterfeiting traceability solution operator, dedicated to research and development of technology products based on Blockchain.  ... 
doi:10.1109/access.2020.2965147 fatcat:vtvhdid44vckfao3qpgfuvjbn4

SoK: Communication Across Distributed Ledgers [article]

Alexei Zamyatin, Mustafa Al-Bassam, Dionysis Zindros, Eleftherios Kokoris-Kogias, Pedro Moreno-Sanchez, Aggelos Kiayias, William J. Knottenbelt
2019 IACR Cryptology ePrint Archive  
With this result in mind, we develop a framework to design new and evaluate existing CCC protocols, focusing on the inherent trust assumptions thereof, and derive a classification covering the field of  ...  We provide the first systematic exposition of cross-chain communication protocols.  ...  E Acknowledgements We would like express our gratitude to Georgia Avarikioti, Daniel Perez and Dominik Harz for helpful comments and feedback on earlier versions of this manuscript.  ... 
dblp:journals/iacr/ZamyatinAZKMKK19 fatcat:sz5jpi67wvgrbeger74mg6mv4a

Managing Geo-replicated Data in Multi-datacenters [chapter]

Divyakant Agrawal, Amr El Abbadi, Hatem A. Mahmoud, Faisal Nawab, Kenneth Salem
2013 Lecture Notes in Computer Science  
Although protocols based on these models provide high availability, they are not ideal for applications needing a consistent view of the data.  ...  Second, a contrasting method is put forward, which uses gossip-based protocol for providing distributed transactions across datacenters.  ...  protocol based on majority quorums [15] , and gossip-based protocols that ensure causal dissemination of events [50, 51] .  ... 
doi:10.1007/978-3-642-37134-9_2 fatcat:iaejw2jy6zfyrecxeje7a5t4cq

Dependable Systems [chapter]

André Schiper
2006 Lecture Notes in Computer Science  
Improving the dependability of computer systems is a critical and essential task.  ...  Almost the same paper appears under the title Group Communication: from practice to theory in  ...  I would like to thank Sergio Mena and Olivier Rütti for their comments on an earlier version of the paper.  ... 
doi:10.1007/11808107_2 fatcat:otlxfarnp5ekthg6xtsfwro7du
« Previous Showing results 1 — 15 out of 8,144 results