55 citations · 111 across the 14 of their papers we have counts for
15 papers
A Tunable Incentive Mechanism for Binary Aggregation Without Verification
Chien-Chih Chen, Wojciech Golab
Binary aggregation without verifiable ground truth arises when agents' reports must be aggregated without access to gold-standard labels. This paper studies a tunable reward--penal…
Analyzing Linearizability in Relativistic Distributed Systems
Kahbod Aeini, Wojciech Golab
Einstein's theory of relativity correctly predicted that time is relative, and subject to both kinematic and gravitational dilation. Therefore, executions of distributed systems ca…
IRS: An Incentive-compatible Reward Scheme for Algorand
Maizi Liao, Wojciech Golab, Seyed Majid Zahedi
Founded in 2017, Algorand is one of the world's first carbon-negative, public blockchains inspired by proof of stake. Algorand uses a Byzantine agreement protocol to add new blocks…
Shallow Overlay Trees Suffice for High-Throughput Consensus
Hao Tan, Wojciech Golab
All-to-all data transmission is a typical data transmission pattern in blockchain systems. Developing an optimization scheme that provides high throughput and low latency data tran…
RCanopus: Making Canopus Resilient to Failures and Byzantine Faults
S. Keshav, W. Golab, B. Wong +2
Distributed consensus is a key enabler for many distributed systems including distributed databases and blockchains. Canopus is a scalable distributed consensus protocol that ensur…
Recoverable Consensus in Shared Memory
Wojciech Golab
Herlihy's consensus hierarchy ranks the power of various synchronization primitives for solving consensus in a model where asynchronous processes communicate through shared memory…
OptCon: An Adaptable SLA-Aware Consistency Tuning Framework for Quorum-based Stores
Subhajit Sidhanta, Wojciech Golab, Supratik Mukhopadhyay +1
Users of distributed datastores that employ quorum-based replication are burdened with the choice of a suitable client-centric consistency setting for each storage operation. The a…
OptEx: A Deadline-Aware Cost Optimization Model for Spark
Subhajit Sidhanta, Wojciech Golab, Supratik Mukhopadhyay
We present OptEx, a closed-form model of job execution on Apache Spark, a popular parallel processing engine. To the best of our knowledge, OptEx is the first work that analyticall…
Continuous Partial Quorums for Consistency-Latency Tuning in Distributed NoSQL Storage Systems
Marlon McKenzie, Hua Fan, Wojciech Golab
NoSQL storage systems are used extensively by web applications and provide an attractive alternative to conventional databases when the need for scalability outweighs the need for…
Deconstructing Queue-Based Mutual Exclusion
Wojciech Golab
We formulate a modular approach to the design and analysis of a particular class of mutual exclusion algorithms for shared memory multiprocessor systems. Specifically, we consider…
On the k-Atomicity-Verification Problem
Wojciech Golab, Jeremy Hurwitz, Xiaozhou +1
Modern Internet-scale storage systems often provide weak consistency in exchange for better performance and resilience. An important weak consistency property is k-atomicity, which…
Toward a Principled Framework for Benchmarking Consistency
Muntasir Raihan Rahman, Wojciech Golab, Alvin AuYoung +2
Large-scale key-value storage systems sacrifice consistency in the interest of dependability (i.e., partition tolerance and availability), as well as performance (i.e., latency). S…
Minuet: A Scalable Distributed Multiversion B-Tree
Benjamin Sowell, Wojciech Golab, Mehul A. Shah
Data management systems have traditionally been designed to support either long-running analytics queries or short-lived transactions, but an increasing number of applications need…
A Complexity Separation Between the Cache-Coherent and Distributed Shared Memory Models
Wojciech Golab
We consider asynchronous multiprocessor systems where processes communicate by accessing shared memory. Exchange of information among processes in such a multiprocessor necessitate…
Linearizable Implementations Do Not Suffice for Randomized Distributed Computation
Wojciech Golab, Lisa Higham, Philipp Woelfel
Linearizability is the gold standard among algorithm designers for deducing the correctness of a distributed algorithm using implemented shared objects from the correctness of the…