Zobrazeno 1 - 10
of 72
pro vyhledávání: '"Crain, Tyler"'
Autor:
Crain, Tyler
This work performs an experimental evaluation of four asynchronous binary Byzantine consensus algorithms [11,16,18] in various configurations. In addition to being asynchronous these algorithms run in rounds, tolerate up to one third of faulty nodes,
Externí odkaz:
http://arxiv.org/abs/2004.09547
Autor:
Crain, Tyler
This work describes two randomized, asynchronous, round based, Binary Byzantine faulty tolerant consensus algorithms based on the algorithms of [25] and [26]. Like the algorithms of [25] and [26] they do not use signatures, use $O(n^2)$ messages per
Externí odkaz:
http://arxiv.org/abs/2002.08765
Autor:
Crain, Tyler
This paper describes a simple and efficient asynchronous Binary Byzantine faulty tolerant consensus algorithm. In the algorithm, non-faulty nodes perform an initial broadcast followed by a executing a series of rounds each consisting of a single mess
Externí odkaz:
http://arxiv.org/abs/2002.04393
A Simple and Efficient Binary Byzantine Consensus Algorithm using Cryptography and Partial Synchrony
Autor:
Crain, Tyler
This paper describes a simple and efficient Binary Byzantine faulty tolerant consensus algorithm using a weak round coordinator and the partial synchrony assumption to ensure liveness. In the algorithm, non-faulty nodes perform an initial broadcast f
Externí odkaz:
http://arxiv.org/abs/2001.07867
Collecting anonymous opinions finds various applications ranging from simple whistleblowing, releasing secretive information, to complex forms of voting, where participants rank candidates by order of preferences. Unfortunately, as far as we know the
Externí odkaz:
http://arxiv.org/abs/1902.10010
In this paper, we present the most extensive evaluation of blockchain system to date. To achieve scalability across servers in more than 10 countries located on 4 different continents, we drastically revisited Byzantine fault tolerant blockchains and
Externí odkaz:
http://arxiv.org/abs/1812.11747
This paper introduces a deterministic Byzantine consensus algorithm that relies on a new weak coordinator. As opposed to previous algorithms that cannot terminate in the presence of a faulty or slow coordinator, our algorithm can terminate even when
Externí odkaz:
http://arxiv.org/abs/1702.03068
Autor:
Crain, Tyler D. (Tyler Dean)
Thesis: M. Arch., Massachusetts Institute of Technology, Department of Architecture, 2015.
Cataloged from PDF version of thesis.
Includes bibliographical references (pages 100-101).
Fundamentally, this project pursues the concept of co
Cataloged from PDF version of thesis.
Includes bibliographical references (pages 100-101).
Fundamentally, this project pursues the concept of co
Externí odkaz:
http://hdl.handle.net/1721.1/97366
Autor:
Crain, Tyler
Les architectures multicœurs changent notre façon d'écrire des programmes. L'écriture de programmes concurrents est bien connue pour être difficile. Traditionnellement, l'utilisation de verrous (locks) permettant au code de s'exécuter en exclus
Externí odkaz:
http://www.theses.fr/2013REN1S022/document
Autor:
Crain, Tyler
Les architectures multicœurs changent notre façon d'écrire des programmes. L'écriture de programmes concurrents est bien connue pour être difficile. Traditionnellement, l'utilisation de verrous (locks) permettant au code de s'exécuter en exclus
Externí odkaz:
http://tel.archives-ouvertes.fr/tel-00861274
http://tel.archives-ouvertes.fr/docs/00/86/12/74/PDF/CRAIN_Tyler.pdf
http://tel.archives-ouvertes.fr/docs/00/86/12/74/PDF/CRAIN_Tyler.pdf