Lawn is a timing-wheel variant that uses TTL-hashed queues to deliver low-latency, unbounded-range timers without overflow or degradation under typical loads.
Hashed and hierarchical timing wheels: Data structures for the efficient implementation of a timer facility,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Lawn: an Unbound Low Latency Timer Data Structure for Large Scale, High Throughput Systems
Lawn is a timing-wheel variant that uses TTL-hashed queues to deliver low-latency, unbounded-range timers without overflow or degradation under typical loads.