Talks

In this talk, we compare modeling the complexities of the Apache BookKeeper replication protocol in both TLA+ and Java with Maelstrom/Jepsen.

This talk surveys how to use multithreading and fine-grained synchronization to structure computations like map-reduce on multicores. The talk will assume some familiarity with Java syntax, but the issues will be addressed from the first principles.

Writing concurrent programs is hard. However, testing them can also be extremely challenging. That's why we have Lincheck – a special framework for testing concurrent data structures on the JVM. Maria will conduct a live workshop on using Lincheck: an online guide on the functionality of the tool applied to a series of concurrency problems that you may face in practice.

Andras will present a novel consensus algorithm over locally replicated consensus groups, which allows for strong consistency, a robust geo-distribution- and a failure recovery model.

In this talk, we will discuss CockroachDB, a scalable, globally distributed NewSQL database that aims to better serve this next generation of applications.

During the session, we will deep dive into the practical aspects of the CAP theorem and its implications for the modern distributed data stores, including Cassandra, Kafka & AWS S3.

In this talk, the audience will learn about the theoretical foundations behind failure detectors: underlying concepts, crucial properties, and differences in guarantees. We will look at applications of failure detection in several practical use cases and dive into the specifics of their implementation in some known distributed systems.

The goal of the talk is to lay a common ground for Distributed Systems so everyone can benefit from the current research on the topic.

In this talk, we will first discuss the origins of the NewSQL movement and its influence on the DBMS marketplace. We will cover the systems that were part of the original NewSQL classification and then how both the category and those systems evolved.

The goal of this workshop is to show developers of concurrent and distributed systems how to model algorithms with TLA+.

In this talk, we are going to see what tests are possible, look at classic concurrency examples on real hardware, talk about all the different ways the harness uses the underlying Hotspot-specific machinery to improve test fidelity and look how real-world projects use it for empirical concurrency testing.

In this talk, Lalith will present Declarative Cluster Managers (DCM), a general approach for building cluster managers that makes them performant and easily extensible.

Agreement algorithms form the underpinning of many reliable services; they provide a consistent state among several machines despite asynchrony, crash failures, and malicious attacks. In this talk, Naama will argue that it is important to design agreement algorithms to optimize for both best-case and worst-case performance.

This talk describes in detail the architecture of distributed newSQL Yandex Database.

During this session, we'll discuss the problem of designing a concurrent FIFO queue, starting from a simple lock-based algorithm, through a lock-free algorithm (that performs poorly), to the LCRQ algorithm, which is based on fetch-and-add (a non-failing primitive).

In this talk, we will talk over the lessons learned building a new storage engine from scratch with no virtual memory, no page cache, with purpose-built read-ahead and write-behind strategies for predictable latencies, co-designed with Raft — data replication model.

This talk is a survey of the various approaches that academic (Carousel, MDCC, SLOG, TAPIR) and industrial (Spanner, CockroachDB, OceanVista) systems use to achieve atomicity in their transactions. We'll explore how each system uniquely composes its transaction model with the underlying replication protocol, each achieving the theoretical minimum latency for atomic commitment: one round-trip between data centers.

Writing concurrent programs is hard. However, testing them can also be extremely challenging. That's why we have Lincheck – a special framework for testing concurrent data structures on the JVM. Maria will conduct a live workshop on using Lincheck: an online guide on the functionality of the tool applied to a series of concurrency problems that you may face in practice.

The goal of this workshop is to show developers of concurrent and distributed systems how to model algorithms with TLA+.

The goal of this workshop is to show developers of concurrent and distributed systems how to model algorithms with TLA+.

The goal of this workshop is to show developers of concurrent and distributed systems how to model algorithms with TLA+.

In this talk, we are going to see what tests are possible, look at classic concurrency examples on real hardware, talk about all the different ways the harness uses the underlying Hotspot-specific machinery to improve test fidelity and look how real-world projects use it for empirical concurrency testing.

We take stock, remember the bright moments and talk about our plans. Join the broadcast, so you don't miss anything!

We will talk about the schedule, sessions, and share the information. Join the broadcast to find out what's on the air soon!

Apache Ignite PMCs Andrey Gura (Architect, GridGain, Russia), Val Kulichenko (Director of Product Management, GridGain, USA), and their colleagues will describe what it is like to work at GridGain in 2021.