Dan Alistarh

TL;DR: This article proposes Lease/Release, a simple addition to standard directory-based MESI cache coherence protocols, allowing participants to lease memory, at the granularity of cache lines, by delaying coherence messages for a short, bounded period of time, which can significantly reduce the overheads of contention for both non-blocking and lock-based data structure implementations.

TL;DR: In this paper, the Euler Tour Tree (ET) data structure is used to obtain the first concurrent generalization of dynamic connectivity, which preserves the time complexity of its sequential counterpart, but is also scalable in practice.

TL;DR: In this paper, the authors investigate whether the expensive hardware overprovisioning approach can be supplanted via algorithmic and system design, and propose a framework called CGX, which provides efficient software support for communication compression.

TL;DR: This paper proves that, in long-lived executions, where processes may register and deregister polynomially many times, the technique guarantees constant steps on average and O (log log n) steps with high probability for registering, unit cost for deregistering, and O(n) steps for collect queries, where n is an upper bound on the number of processes that may be active at any point in time.

TL;DR: L-GreCo as discussed by the authors is based on an adaptive algorithm, which automatically picks the optimal compression parameters for model layers guaranteeing the best compression ratio while satisfying an error constraint, and achieves up to 2.5 times training speedup and up to 5 times compression improvement over efficient implementations of existing approaches, while recovering full accuracy.