BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:Simulating few by many: k-concurrency via k-set consensus 
DTSTART:20090617T151500
DTSTAMP:20260509T234325Z
UID:1807b3e713997836188084df9336743de0ce79162233d6b95fb30314
CATEGORIES:Conferences - Seminars
DESCRIPTION:Prof. Eli Gafni\, University of California\, Los Angeles\nPerf
 ection is the enemy of the good. Most backoff schemes wait until a single 
 contending candidate survives. But it is ``the last mile'' which is usuall
 y the most costly: backoff systems which wait on some fixed $k>1$ perform 
 better that those that require perfection\, i.e. $k=1$.  \nThis paper asks
  what tasks are read-write solvable ``k-concurrently '' i.e.  tasks where 
 progress can be guaranteed when contention goes below $k+1$. That's it\, w
 hat good is backoff to $k>1$? While backoff to $k=1$ is omnipotent what se
 t of tasks can be solved with $k>1$?\nWe show that the set of these tasks 
  is exactly the set of tasks that are solvable wait-free with the availabi
 lity of $k$-set consensus.\nIt is now for the system designer to decide wh
 ether good is good enough.\nProf. Gafni's homepage
LOCATION:BC 01 https://plan.epfl.ch/?room==BC%2001
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR