Filters








16,181 Hits in 4.8 sec

A New Insight into Local Coin-Based Randomized Consensus

Achour Mostefaoui, Matthieu Perrin, Michel Raynal
2019 2019 IEEE 24th Pacific Rim International Symposium on Dependable Computing (PRDC)  
To attain this goal the algorithm combines Ben-Or's randomized consensus algorithm (PODC 1983) and the condition-based approach to solve consensus (JACM 2003).  ...  We conjecture that if t > O( √ n) it is no longer possible to implement a randomized consensus algorithm ensuring a constant number of communication steps despite unfair channels.  ...  It combines the condition-based approach with randomization to obtain a hybrid binary consensus algorithm, denoted Algo1 in Table I that is based on both a condition and local coins.  ... 
doi:10.1109/prdc47002.2019.00051 dblp:conf/prdc/MostefaouiPR19 fatcat:qw7a7nlf75ek5coyb5wrj432oq

A modular approach to shared-memory consensus, with applications to the probabilistic-write model

James Aspnes
2011 Distributed computing  
We observe that most known randomized consensus algorithms have this structure.  ...  Combining these objects gives a consensus protocol for the probabilistic-write model that uses O(log m + log n) individual work and O(n log m) total work.  ...  Acknowledgments The decomposition of consensus into conciliator and adopt-commit objects was inspired in part by a desire to give a better unified presentation of known consensus protocols.  ... 
doi:10.1007/s00446-011-0134-8 fatcat:hi3fprj5tngtxj2trlnpfblybq

A modular approach to shared-memory consensus, with applications to the probabilistic-write model

James Aspnes
2010 Proceeding of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing - PODC '10  
We observe that most known randomized consensus algorithms have this structure.  ...  Combining these objects gives a consensus protocol for the probabilistic-write model that uses O(log m + log n) individual work and O(n log m) total work.  ...  Acknowledgments The decomposition of consensus into conciliator and adopt-commit objects was inspired in part by a desire to give a better unified presentation of known consensus protocols.  ... 
doi:10.1145/1835698.1835802 dblp:conf/podc/Aspnes10 fatcat:iypthg5uuvf5forxrycu2n5qkq

Experimental Comparison of Local and Shared Coin Randomized Consensus Protocols

Henrique Moniz, Nuno Neves, Miguel Correia, Paulo Verissimo
2006 Symposium on Reliable Distributed Systems. Proceedings  
The paper presents a comparative performance study of the two main classes of randomized binary consensus protocols: a local coin protocol, with an expected high communication complexity and cheap symmetric  ...  The analysis shows that there is a significant gap between the theoretical and the practical performance results of these protocols, and provides an important insight into what actually happens during  ...  Virtually all randomized consensus protocols are based on a random operation, tossing a coin, which returns values 0 or 1 with equal probability.  ... 
doi:10.1109/srds.2006.19 dblp:conf/srds/MonizNCV06 fatcat:x6jre46cizfznprexnlvoagsqq

Tight bounds for asynchronous randomized consensus

Hagit Attiya, Keren Censor
2008 Journal of the ACM  
However, consensus becomes solvable using randomization when a process only has to terminate with probability 1.  ...  A distributed consensus algorithm allows n processes to reach a common decision value starting from individual inputs.  ...  We would like to thank Faith Ellen, Javier Garcia, David Hay, Danny Hendler, Sergio Rajsbaum and an anonymous referee for insightful comments on earlier versions of the paper.  ... 
doi:10.1145/1411509.1411510 fatcat:mhbfuaan7fdxxcpfcj2hyr63gy

Tight bounds for asynchronous randomized consensus

Hagit Attiya, Keren Censor
2007 Proceedings of the thirty-ninth annual ACM symposium on Theory of computing - STOC '07  
However, consensus becomes solvable using randomization when a process only has to terminate with probability 1.  ...  A distributed consensus algorithm allows n processes to reach a common decision value starting from individual inputs.  ...  We would like to thank Faith Ellen, Javier Garcia, David Hay, Danny Hendler, Sergio Rajsbaum and an anonymous referee for insightful comments on earlier versions of the paper.  ... 
doi:10.1145/1250790.1250814 dblp:conf/stoc/AttiyaC07 fatcat:jdvqnhfqtbh27bm7kf3mzfvceq

Deconstructing Blockchains: A Comprehensive Survey on Consensus, Membership and Structure [article]

Christopher Natoli, Jiangshan Yu, Vincent Gramoli, Paulo Esteves-Verissimo
2019 arXiv   pre-print
We propose an evaluation framework with insight into system models, desired properties and analysis criteria, using the decoupled components as criteria.  ...  : membership selection, consensus mechanism and structure.  ...  Proof-of-Retrievability employs this by requiring the consensus member to create a block through local random access to segments of files.  ... 
arXiv:1908.08316v1 fatcat:aca6xwvfmrb2le35z77wqjv5sq

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

Towards a New Democracy: Consensus Through Quantum Parliament [article]

Diederik Aerts
2005 arXiv   pre-print
We compare different actual forms of democracy and analyse in which way they are variations of a 'natural consensus decision process'.  ...  We introduce the combined notion of 'quantum parliament' and 'quantum decision procedure', and prove it to be the only one, when applied after consensus decision, that is immune to false play.  ...  This proposal for a new form of democracy is, however, not a mere attempt to apply insights into the nature of quantum processes to the political processes in our society.  ... 
arXiv:physics/0503078v1 fatcat:5pqf2kbvqvbmrkjvub4wfkyona

Computational Modeling of Collective Human Behavior: The Example of Financial Markets [chapter]

Andy Kirou, Błażej Ruszczycki, Markus Walser, Neil F. Johnson
2008 Lecture Notes in Computer Science  
based on common global information but lack local information from their social network, and a model in which the traders form a dynamically evolving social network but lack any decision-making based  ...  As a result of the increased availability of higher precision spatiotemporal datasets, coupled with the realization that most realworld human systems are complex, a new field of computational modeling  ...  Otherwise there is no consensus and the group fragments into single individuals.  ... 
doi:10.1007/978-3-540-69384-0_8 fatcat:2dcvkkowhzdurorb7ybmwhnqhu

Individual Green Certificates on Blockchain: A Simulation Approach

Fangyuan Zhao, Xin Guo, Wai Kin (Victor) Chan
2020 Sustainability  
This paper proposes I-Green, a blockchain-based individual green certificates system for promoting voluntary adoption of distributed renewable energy.  ...  Blockchain shows an advantage of incorporating a galaxy of distributed prosumers in a transparent and low-cost manner.  ...  The chance of being selected to create a new block is proportional to the coin age of staked coins.  ... 
doi:10.3390/su12093942 fatcat:ndddfo5rj5af7htknzebne3lxm

Computational modeling of collective human behavior: Example of financial markets [article]

Andy Kirou, Blazej Ruszczycki, Markus Walser, Neil F. Johnson
2008 arXiv   pre-print
based on common global information but lack local information from their social network, and a model in which the traders form a dynamically evolving social network but lack any decision-making based  ...  We show that a suitable combination of these two models -- in particular, a population of virtual traders with access to both global and local information -- produces results for the price return distribution  ...  The standard model of a financial market -based on the efficient market hypothesis -is that pricechanges are like the toss of a coin.  ... 
arXiv:0812.2603v1 fatcat:icdxg2tmbrf3zb7gki5if72geq

Article A Review of Blockchain Architecture and Consensus Protocols: Use Cases, Challenges, and Solutions

Ismail, Materwala
2019 Symmetry  
We introduce aclassification of those architectures helping developers to choose a suitable platform for applicationsand providing insights for future research directions in the field to build new frameworks  ...  In this paper, we discuss the evolution of blockchain architectureand consensus protocols, bringing a retrospective analysis and discussing the rationale of theevolution of the various architectures and  ...  There are two forger selection methods in PoS: (1) coin-age selection based on the number of the days the coins are held at stake, and (2) randomized block selection based on the calculation of a hit value  ... 
doi:10.3390/sym11101198 fatcat:ktozespsjvc2rbhr56fjtnbyvy

Untangling Blockchain: A Data Processing View of Blockchain Systems [article]

Tien Tuan Anh Dinh, Rui Liu, Meihui Zhang, Gang Chen, Beng Chin Ooi, Ji Wang
2017 arXiv   pre-print
We conduct a comprehensive evaluation of three major blockchain systems based on BLOCKBENCH, namely Ethereum, Parity and Hyperledger Fabric.  ...  We analyze both in-production and research systems in four dimensions: distributed ledger, cryptography, consensus protocol and smart contract.  ...  Each federate runs a local consensus protocol among its members, which does not run into scalability problems because of the small network size.  ... 
arXiv:1708.05665v1 fatcat:tf3fuh2fxnbdjaxywuhc3qz6ra

Quantum mechanics and modelling of physical reality

Marian Kupczynski
2018 Physica Scripta  
Quantum mechanics led to spectacular technological developments, discovery of new constituents of matter and new materials. However there is still no consensus on its interpretation and limitations.  ...  We explain how a simple probabilistic locally causal model is able to reproduce quantum correlations in Bell tests.  ...  A button is pushed and a mechanical arm picks at random one of the coins in a box and inserts it into the device D3.  ... 
doi:10.1088/1402-4896/aae212 fatcat:5edwcev7gfddzae2vvew4y5mee
« Previous Showing results 1 — 15 out of 16,181 results