61 citations · 124 across the 15 of their papers we have counts for
16 papers · 1 filter
Invited Paper: Fault-tolerant and Expressive Cross-Chain Swaps
Yingjie Xue, Di Jin, Maurice Herlihy
Cross-chain swaps enable exchange of different assets that reside on different blockchains. Several protocols have been proposed for atomic cross-chain swaps. However, those protoc…
Clairvoyant State Machine Replication
Rida Bazzi, Maurice Herlihy
We propose a new protocol for the generalized consensus problem in asynchronous systems subject to Byzantine server failures. The protocol solves the consensus problem in a setting…
Cross-chain Deals and Adversarial Commerce
Maurice Herlihy, Barbara Liskov, Liuba Shrira
Modern distributed data management systems face a new challenge: how can autonomous, mutually-distrusting parties cooperate safely and effectively? Addressing this challenge brings…
An Empirical Study of Speculative Concurrency in Ethereum Smart Contracts
Vikram Saraph, Maurice Herlihy
We use historical data to estimate the potential benefit of speculative techniques for executing Ethereum smart contracts in parallel. We replay transaction traces of sampled block…
SuperNeurons: FFT-based Gradient Sparsification in the Distributed Training of Deep Neural Networks
Linnan Wang, Wei Wu, Junyu Zhang +4
The performance and efficiency of distributed training of Deep Neural Networks highly depend on the performance of gradient averaging among all participating nodes, which is bounde…
Atomic Cross-Chain Swaps
Maurice Herlihy
An atomic cross-chain swap is a distributed coordination task where multiple parties exchange assets across multiple blockchains, for example, trading bitcoin for ether. An atomic…
An Algorithmic Approach to the Asynchronous Computability Theorem
Vikram Saraph, Maurice Herlihy, Eli Gafni
The asynchronous computability theorem (ACT) uses concepts from combinatorial topology to characterize which tasks have wait-free solutions in read-write memory. A task can be expr…
Adding Concurrency to Smart Contracts
Thomas Dickerson, Paul Gazzillo, Maurice Herlihy +1
Modern cryptocurrency systems, such as Ethereum, permit complex financial transactions through scripts called smart contracts. These smart contracts are executed many, many times,…
Proust: A Design Space for Highly-Concurrent Transactional Data Structures
Thomas D. Dickerson, Paul Gazzillo, Maurice Herlihy +1
Most STM systems are poorly equipped to support libraries of concurrent data structures. One reason is that they typically detect conflicts by tracking transactions' read sets and…
Enhancing Accountability and Trust in Distributed Ledgers
Maurice Herlihy, Mark Moir
Permisionless decentralized ledgers ("blockchains") such as the one underlying the cryptocurrency Bitcoin allow anonymous participants to maintain the ledger, while avoiding contro…
The Relative Power of Composite Loop Agreement Tasks
Maurice Herlihy, Vikram Saraph
Loop agreement is a family of wait-free tasks that includes set agreement and simplex agreement, and was used to prove the undecidability of wait-free solvability of distributed ta…
Tight Bounds for Connectivity and Set Agreement in Byzantine Synchronous Systems
Hammurabi Mendes, Maurice Herlihy
In this paper, we show that the protocol complex of a Byzantine synchronous system can remain -connected for up to rounds, where is the maximum num…
The Adaptive Priority Queue with Elimination and Combining
Irina Calciu, Hammurabi Mendes, Maurice Herlihy
Priority queues are fundamental abstract data structures, often used to manage limited resources in parallel programming. Several proposed parallel priority queue implementations a…
Well-Structured Futures and Cache Locality
Maurice Herlihy, Zhiyu Liu
In fork-join parallelism, a sequential program is split into a directed acyclic graph of tasks linked by directed dependency edges, and the tasks are executed, possibly in parallel…
Distributed Computability in Byzantine Asynchronous Systems
Hammurabi Mendes, Christine Tasson, Maurice Herlihy
In this work, we extend the topology-based approach for characterizing computability in asynchronous crash-failure distributed systems to asynchronous Byzantine systems. We give th…
An Equivariance Theorem with Applications to Renaming (Preliminary Version)
Armando Castañeda, Maurice Herlihy, Sergio Rajsbaum
In the renaming problem, each process in a distributed system is issued a unique name from a large name space, and the processes must coordinate with one another to choose unique n…