The authors resolve the contradiction between deterministic crash-tolerant consensus in a fully asynchronous environment and the FLP impossibility result by demonstrating that one protocol phase separ…

This paper establishes a timing attack against network-agnostic guardians in time-triggered communication protocols, causing collisions with critical messages and remaining undetected.

This paper proposes CAPS, a scheduling layer for data centers that separates rate computation and packet scheduling, reducing queue occupancy by up to 10x without throughput loss.

The paper proposes a method to improve the performance of fine-grained offloads on servers by overlapping the offload with other requests using server-side routing.

Gatling is a new atomic broadcast protocol that achieves arbitrarily small inter-proposal times, even smaller than the network delay, by running multiple parallel instances of a black-box atomic broad…

This paper presents an automated verification technique for safety properties of affine distributed protocols with an unbounded number of actors.

The paper introduces RePoT, a method that significantly improves Program-of-Thought (PoT) planning by deterministically verifying the initial plan prefix and using a single LLM call to resume planning…

The paper analyzes transaction fee mechanisms in modern blockchains that use parallel execution and contingency, proving an inherent trade-off between minimizing risks for users and maximizing revenue…

This paper proposes improvements to rotating-leader consensus protocols and their underlying P2P networks in blockchain systems, achieving up to 7.26x peak throughput improvement.

This paper explores five methods for making a linked list work efficiently with multiple threads, from using one big lock to a lock-free design.

A new lock, SemanticLock, is proposed based on conflict graphs between operations, demonstrated effective in two applications: a toy data structure and ConcurrentHashMap.

This paper compares two cryptocurrency sender untraceability designs, Linear Untraceable Asset Transfer Objects (LUAT) and Constant-State Untraceable Asset Transfer Objects (CUAT), and analyzes their…

This paper presents a simpler variation of the NC detection criterion for perfect matchings in bipartite graphs with improved parameters.

The paper introduces Tofu, a generalizable tool that automatically performs rigorous channel fault analysis on distributed protocols, synthesizing attack traces or proving their absence for given LTL…

The paper introduces Post-Deterministic Distributed Systems (PDDS) as a new model to coordinate autonomous infrastructure where participants, including stochastic agents, produce divergent reasoning p…

This paper introduces Virtual Time-Sensitive Networking (V-TSN), a software-defined overlay for gPTP-based synchronization and TSN traffic shaping over general-purpose networks without specialized har…