• Publications
  • Influence
Group communication specifications: a comprehensive study
TLDR
This survey provides a comprehensive set of clear and rigorous specifications of view-oriented group communication systems, which maybe combined to represent the guarantees of most existing GCSs. Expand
  • 801
  • 90
  • PDF
Trusting the cloud
TLDR
We survey well-known cryptographic tools for providing integrity and consistency for data stored in clouds and discuss recent research in cryptography and distributed computing addressing these problems. Expand
  • 253
  • 17
  • PDF
GPUfs: integrating a file system with GPUs
TLDR
GPUfs provides a POSIX-like API for GPU programs, exploits GPU parallelism for efficiency, and optimizes GPU file access by extending the buffer cache into GPU memory. Expand
  • 116
  • 13
  • PDF
Dynamic atomic storage without consensus
TLDR
This paper deals with the emulation of atomic read/write (R/W) storage in dynamic asynchronous message passing systems. Expand
  • 81
  • 12
  • PDF
Byzantine disk paxos: optimal resilience with byzantine shared memory
TLDR
We present Byzantine Disk Paxos, an asynchronous shared-memory consensus protocol that uses a collection of n > 3t disks, t of which may fail by becoming non-responsive or arbitrarily corrupted. Expand
  • 66
  • 10
On maintaining multiple versions in STM
TLDR
An effective way to reduce the number of aborts in software transactional memory (STM) is to keep multiple versions of transactional objects. Expand
  • 110
  • 9
  • PDF
Venus: verification for untrusted cloud storage
TLDR
This paper presents Venus, a service for securing user interaction with untrusted cloud storage. Expand
  • 130
  • 9
  • PDF
Moshe: A group membership service for WANs
TLDR
We present Moshe, a novel scalable group membership algorithm built specifically for use in wide area networks (WANs), which can suffer partitions. Expand
  • 97
  • 9
  • PDF
Brahms: byzantine resilient random membership sampling
TLDR
We present Brahms, an algorithm for sampling random nodes in a large dynamic system prone to malicious behavior. Expand
  • 74
  • 9
  • PDF
Scaling concurrent log-structured data stores
TLDR
We present cLSM, an algorithm for scalable concurrency in LSM-DS, which exploits multiprocessor-friendly data structures and non-blocking synchronization. Expand
  • 68
  • 8
  • PDF