Scale Up with Lock Free Algorithms
Roman Elizarov, Manager, JetBrains Modern back-end systems routinely pack dozens of CPU cores with dozens of gigabytes of memory. The JVM platform provides a unique opportunity to built vertically scalable systems that fully utilize this power by working with large datasets from multiple threads. This session shows how a well-defined Java memory model (JMM), combined with state-of-the-art garbage collection (GC) memory management makes it a prime choice for implementing scalable lock-free data structures and algorithms. You’ll see how you can design and implement your own lock-free algorithms in Java without having to complete a PhD.

▶︎
G1GC Concepts and Performance Tuning

▶︎
Adam Morrison — Designing fast lock free algorithms by understanding cache coherence dynamics

▶︎
Adventures with concurrent programming in Java: A quest for predictable latency by Martin Thompson

▶︎
Pedro Ramalhete — Wait-free data structures and wait-free transactions

▶︎
Java EE: Heavyweight or Lightweight—Mythbusters

▶︎
Full App Building Course with Cursor (3+ Hours)

▶︎
Roman Elizarov — Structured concurrency

▶︎
How low can you go? Ultra low latency Java in the real world - Daniel Shaya

▶︎
System Design Explained: APIs, Databases, Caching, CDNs, Load Balancing & Production Infra

▶︎
G1 Garbage Collector Details and Tuning by Simone Bordet

▶︎
Turing Award Winner: Disagreeing with Google, Postgres, Future Problems | Mike Stonebraker

▶︎
Billionaire's WARNING: I'm SELLING. The Crash Is Already Here!

▶︎
The Power and Perils of Parallel Streams

▶︎
Parallel Streams, CompletableFuture, and All That: Concurrency in Java 8

▶︎
Deep Dive into LLMs like ChatGPT

▶︎
Full 2025 Kotlin Crash Course For Beginners

▶︎
SIMD Parallel Programming with the Vector API By José Paumard

▶︎
The Ultimate FastAPI + React Full Stack Project (Deploy This and You’re Set)

▶︎
Understanding the Disruptor, a Beginner's Guide to Hardcore Concurrency -Trisha Gee & Mike Barker

▶︎
