Personne

Marko Vukolic

Cette personne n’est plus à l’EPFL

Publications associées (13)

Dissecting UbuntuOne: Autopsy of a Global-scale Personal Cloud Back-end

Marko Vukolic, Hamza Harkous, Yongchao Tian

Personal Cloud services, such as Dropbox or Box, have been widely adopted by users. Unfortunately, very little is known about the internal operation and general characteristics of Personal Clouds since they are proprietary services. In this paper, we fo ...

ACM Press2015

The Next 700 BFT Protocols

Rachid Guerraoui, Marko Vukolic, Nikola Knezevic

We present Abstract (ABortable STate mAChine replicaTion), a new abstraction for designing and reconfiguring generalized replicated state machines that are, unlike traditional state machines, allowed to abort executing a client's request if "something goes ...

Association for Computing Machinery2015

DiNoDB: Efficient Large-Scale Raw Data Analytics

Marko Vukolic, Anastasia Ailamaki, Ioannis Alagiannis, Erietta Liarou, Yongchao Tian

Modern big data workflows, found in e.g., machine learning use cases, often involve iterations of cycles of batch analytics and interactive analytics on temporary data. Whereas batch analytics solutions for large volumes of raw data are well established (e ...

2014

The complexity of robust atomic storage

Rachid Guerraoui, Marko Vukolic

We study the time-complexity of robust atomic read/write storage from fault-prone storage components in asynchronous message-passing systems. Robustness here means wait-free tolerating the largest possible number t of Byzantine storage component failures ( ...

ACM Press2011

Refined quorum systems

Rachid Guerraoui, Marko Vukolic

It is considered good distributed computing practice to devise object implementations that tolerate contention, periods of asynchrony and a large number of failures, but perform fast if few failures occur, the system is synchronous and there is no contenti ...

2010

The Next 700 BFT Protocols

Rachid Guerraoui, Marko Vukolic, Nikola Knezevic

Modern Byzantine fault-tolerant state machine replication (BFT) protocols involve about 20,000 lines of challenging C++ code encompassing synchronization, networking and cryptography. They are notoriously difficult to develop, test and prove. We present a ...

2010

Abstractions for asynchronous distributed computing with malicious players

Marko Vukolic

In modern distributed systems, failures are the norm rather than the exception. In many cases, these failures are not benign. Settings such as the Internet might incur malicious (also called Byzantine or arbitrary) behavior and asynchrony. As a result, and ...

EPFL2008

Reliable Distributed Storage

Rachid Guerraoui, Marko Vukolic

Storage is nowadays commonly provided as a service, accessed by clients over a network. A distributed storage service provides clients with the abstraction of a single reliable shared storage device, using a collection of possibly unreliable computing unit ...

2009

A scalable and oblivious atomicity assertion

Rachid Guerraoui, Marko Vukolic

This paper presents SOAR: the first oblivious atomicity assertion with polynomial complexity. SOAR enables to check atomicity of a single-writer multi-reader register implementation. The basic idea underlying the low overhead induced by SOAR lies in greedi ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2008

Refined Quorum Systems

Rachid Guerraoui, Marko Vukolic

2007

How Fast Can a Very Robust Read Be?

Rachid Guerraoui, Marko Vukolic

This paper studies the time complexity of reading unauthenticated data from a distributed storage made of a set of failure-prone base objects. More specifically, we consider the abstraction of a robust read/write storage that provides wait-free access to u ...

2006

Lucky Read/Write Access to Robust Atomic Storage

Rachid Guerraoui, Ron Levy, Marko Vukolic

This paper establishes tight bounds on the \emph{best-case} time-complexity of distributed atomic read/write storage implementations that tolerate \emph{worst-case} conditions. We study asynchronous robust implementations where a writer and a set of reader ...

2006

Gracefully Degrading Fair Exchange with Security Modules

Rachid Guerraoui, Gildas Avoine, Marko Vukolic

The fair exchange problem is key to trading electronic items in systems of mutually untrusted parties. In modern variants of such systems, each party is equipped with a security module. The security modules trust each other but can only communicate by exch ...

2005