Share This Author
Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services
This conjecture is proved in the asynchronous network model that it is impossible to achieve all three properties of a distributed web service: consistency, availability, and partition tolerance.
A Secure Sharding Protocol For Open Blockchains
- Loi Luu, Viswesh Narayanan, Chaodong Zheng, Kunal Baweja, S. Gilbert, P. Saxena
- Computer Science, MathematicsConference on Computer and Communications…
- 24 October 2016
ELASTICO is the first candidate for a secure sharding protocol with presence of byzantine adversaries, and scalability experiments on Amazon EC2 with up to $1, 600$ nodes confirm ELASTICO's theoretical scaling properties.
On-the-fly maintenance of series-parallel relationships in fork-join multithreaded programs
Two algorithms are provided, one serial and one parallel, to maintain series-parallel SP relationships "on the fly" for fork-join multithreaded programs and SP-order employs an order-maintenance data structure that allows it to implement a more efficient "English-Hebrew" labeling scheme than was used in earlier race detectors.
GeoQuorums: implementing atomic memory in mobile ad hoc networks
- S. Dolev, S. Gilbert, N. Lynch, Alexander A. Shvartsman, J. Welch
- Computer ScienceDistributed Computing
- 1 October 2003
The GeoQuorums algorithm efficiently implements read and write operations in a highly dynamic, mobile network using a quorum-based strategy in which each quorum consists of a set of focal point objects.
Concurrent cache-oblivious b-trees
- M. A. Bender, Jeremy T. Fineman, S. Gilbert, Bradley C. Kuszmaul
- Computer ScienceSPAA '05
- 18 July 2005
The cache-oblivious model is extended to a parallel or distributed setting and three concurrent CO B-trees are presented, showing that these data structures are linearizable, meaning that completed operations appear to an outside viewer as though they occurred in some serialized order.
Broadcast in the Ad Hoc SINR Model
The ad hoc SINR model is introduced, which, it is argued, reduces the gap between theory results and real world deployment, and upper and lower bounds for the canonical problem of broadcast on the graph induced by both strong and weak links are studied.
Reconfigurable distributed storage for dynamic networks
Virtual Mobile Nodes for Mobile Ad Hoc Networks
- S. Dolev, S. Gilbert, N. Lynch, E. Schiller, Alexander A. Shvartsman, J. Welch
- Computer ScienceDISC
- 4 October 2004
The Mobile Point Emulator is presented, a new algorithm that implements the Virtual Mobile Node Abstraction, which consists of robust virtual nodes that are both predictable and reliable and significantly simplifies the design of efficient algorithms for highly dynamic mobile ad hoc networks.
Rambo: a robust, reconfigurable atomic memory service for dynamic networks
The main novelty of Rambo lies in the combination of an efficient reconfiguration mechanism with a quorum-based replication strategy for read/write shared memory, which can tolerate a wide variety of aberrant behavior, including lost and delayed messages, participants with unsynchronized clocks, and, more generally, arbitrary asynchrony.
Etna: A Fault-tolerant Algorithm for Atomic Mutable DHT Data
This paper presents Etna, an algorithm for atomic reads and writes of replicated data stored in a distributed hash table. Etna correctly handles dynamically changing sets of replica hosts, and is…