• Reading Group Paper List. Papers ##37-50

    ·

    Placeholder Icon

    This week we are on the 35th paper in our reading group. We will be discussing “Autoscaling Tiered Cloud Storage in Anna” from VLDB 2019. It is exciting that the reading group has managed to go through this many papers since we have started in April!  Today I and Murat have sat down and picked…

    Read More

  • Reading Group. Compositional Programming and Testing of Dynamic Distributed Systems

    ·

    Placeholder Icon

    We have resumed the reading group after one week of Thanksgiving break. On Wednesday, we have discussed “Compositional Programming and Testing of DynamicDistributed Systems.” This paper is on the edge between programming languages, distributed systems, and some formal methods/verification. The premise of the paper is to decompose large monolithic distributed programs into smaller pieces and…

    Read More

  • Reading Group. Aria: A Fast and Practical Deterministic OLTP Database.

    ·

    Placeholder Icon

    In our 33rd reading group meeting, we discussed “Aria: A Fast and Practical Deterministic OLTP Database.” by Yi Lu, Xiangyao Yu, Lei Cao, Samuel Madden. We had a very nice presentation by Alex Miller: Quick Summary Aria is a transaction protocol, heavily influenced by Calvin, and it largely adopts Calvin’s transaction model, with one big…

    Read More

  • Reading Group. High availability in cheap distributed key value storage

    ·

    Placeholder Icon

    Our recent paper was “High availability in cheap distributed key value storage”. And what a paper that was! It was definitely a mind-tingling read the lead to a very interesting and long discussion session with the group. Short Summary The paper addresses the problem of fast recovery from the leader (primary) crashes in key-value stores…

    Read More

  • Reading Group. RMWPaxos: Fault-Tolerant In-Place Consensus Sequences

    ·

    Placeholder Icon

    Quick Summary In the last reading group discussion, we talked about RMWPaxos. The paper argues that under some circumstances, log-based replication schemes and replicated state machines (RSMs), like Multi-Paxos, are a waste of resources. For example, when the state is small, it may be more efficient to just manage the state directly instead of managing…

    Read More

  • Ocean Vista: Gossip-Based Visibility Control for Speedy Geo-Distributed Transactions

    ·

    Placeholder Icon

    Ocean Vista On Wednesday we had a presentation and discussion of the Ocean Vista (OV) replication and distributed transaction protocol. OV works in the WANs, where each region has all data-partitions, and transactions can originate in any region. OV separates replication from transaction execution, by making replication conflict-free with a FastPaxos-inspired protocol. For the transaction…

    Read More

  • One Page Summary. Gryff: Unifying Consensus and Shared Registers

    ·

    Placeholder Icon

    This paper by Matthew Burke, Audrey Cheng, and Wyatt Lloyd appeared in NSDI 2020 and explores an interesting idea of a hybrid replication protocol. The premise is very simple – we can take one protocol that solves a part of the problem well, and marry it with another protocol that excels at the second half…

    Read More

  • PigPaxos: continue devouring communication bottlenecks in distributed consensus.

    ·

    This is a short follow-up to Murat’s PigPaxos post. I strongly recommend reading it first as it provides full context for what is to follow. And yes, it also includes the explanation of what pigs have to do with Paxos. Short Recap of PigPaxos. In our recent SIGMOD paper we looked at the bottleneck of…

    Read More

  • One Page Summary. Aegean: Replication beyond the client-server model

    ·

    Placeholder Icon

    One Page Summary.  Aegean: Replication beyond the client-server model This paper builds o n a key observation about the operation of complex distributed applications. Namely, microservice style of application rarely follows a simple client-server architecture, where a client makes a request and the server (or servers) respond to a request. Instead, many applications often use…

    Read More

  • One Page Summary: Ring Paxos

    ·

    Placeholder Icon

    This paper (Ring Paxos: A high-throughput atomic broadcast protocol) has been out for quite some time, but it addresses a problem still relevant in many distributed consensus protocols. Ring Paxos aims to reduce the communication load in the Paxos cluster and provide better scalability. As we have shown in our SIGMOD 2019 paper, communication is…

    Read More

Aleksey CharapkoI am an assistant professor of computer science at the University of New Hampshire. My research interests lie in distributed systems, distributed consensus, fault tolerance, reliability, and scalability.
X (twitter)@AlekseyCharapko
emailaleksey.charapko@unh.edu

Search