26 citations · 50 across the 19 of their papers we have counts for
4 papers · 1 filter
Collecting Coupons is Faster with Friends
Dan Alistarh, Peter Davies
In this note, we introduce a distributed twist on the classic coupon collector problem: a set of collectors wish to each obtain a set of coupons; for this, they can each sa…
How to Elect a Leader Faster than a Tournament
Dan Alistarh, Rati Gelashvili, Adrian Vladu
The problem of electing a leader from among contenders is one of the fundamental questions in distributed computing. In its simplest formulation, the task is as follows: given…
The LevelArray: A Fast, Practical Long-Lived Renaming Algorithm
Dan Alistarh, Justin Kopinsky, Alexander Matveev +1
The long-lived renaming problem appears in shared-memory systems where a set of threads need to register and deregister frequently from the computation, while concurrent operations…
Inherent Limitations of Hybrid Transactional Memory
Dan Alistarh, Justin Kopinsky, Petr Kuznetsov +2
Several Hybrid Transactional Memory (HyTM) schemes have recently been proposed to complement the fast, but best-effort, nature of Hardware Transactional Memory (HTM) with a slow, r…