TS2025 - Robust Lock-Free Ring-Buffer Protocol over Shared Memory
This presentation outlines an augmented lock‑free transaction protocol for LTTng-UST shared‑memory ring buffers that resolves long‑standing robustness problems when a producer stalls during a transaction (e.g., at breakpoints or when receiving a termination signal). By extending the transaction protocol with a sub-buffer ownership semantic and allowing the consumer daemon to safely abort or recover from incomplete transactions, the updated protocol prevents loss of events and eliminates situations where a destroyed session becomes stuck, waiting indefinitely for a stalled producer to finish its transaction, while preserving the high‑performance lock‑free nature of the original design. Extensive reproducible testing confirms the correctness of the protocol. The upcoming LTTng 2.15 release will integrate these improvements, delivering a more reliable and adaptable LTTng ecosystem.

User API & C++ Implementation of a Multi Producer, Multi Consumer, Lock Free, Atomic Queue - CppCon

TS2025 - Deferred stack traces, how they work and the issues they have

DIGITAL HARDWARE DESIGN USING VHDL | DAY-10

Ring Buffer

The French Do Not Care About Work

io_uring Looks Illegal

Keynote: After the AI Hype – What’s Real, and What’s Next - Richard Campbell - 2026

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

MIT Just Revealed the AI Bubble's Fatal Flaw

If You Have A Bad Memory, I’ll Help You Fix It In 28 Minutes

TS2015 - DejaView: time-travel debugging and tracing

TS2025 - Analyzing scheduler traces

Watch Ukrainian Drones OBLITERATE a Russian Jet

Passkeys Explained: Are They Actually Better Than Passwords?

No Celebrity Has ZERO Filter Like Harrison Ford _ and It’s HILARIOUS!

Creator of C++: Bell Labs, Negative Overhead Abstraction, Mistakes | Bjarne Stroustrup

Ex-Google Insider: You're Not Ready For The Next Phase of AI

TS2025 - LTTng Ecosystem Update

I Outsmarted Pro Car Thieves

