Hashed and hierarchical timing wheels: Efficient data structures for implementing a timer facility

doi:10.1109/90.650142

Hashed and hierarchical timing wheels: Efficient data structures for implementing a timer facility

1997-01-01

36

PRE

AI

DOI：10.1109/90.650142

Original

Original request for help

Save

Abstract

En 中文

The performance of timer algorithms is crucial to many network protocol implementations that use timers for failure recovery and rate control, Conventional algorithms to implement an Operating System timer module take O(n) time to start or maintain a timer, where n is the number of outstanding timers: this is expensive for large n,;his paper shows that by using a circular buffer or timing wheel, it takes O(1) time to start, stop, and maintain timers within the range of the wheel, Two extensions for larger values of the interval are described. In the first, the timer interval is hashed into a slot on the timing wheel, In the second, a hierarchy of timing wheels with different granularities is used to span a greater range of intervals, The performance of these two schemes and various implementation tradeoffs are discussed. We have used one of our schemes to replace the current BSD UNIX callout and timer facilities, Our new implementation can support thousands of outstanding timers without much overhead. Our timer schemes have also been implemented in other operating systems and network protocol packages.

Keywords:

callout facilities

hashed wheels

hierarchical wheels

protocol implementations

Timers

Timer Facilities

Hashed and hierarchical timing wheels: Efficient data structures for implementing a timer facility

Abstract

AI Summary

Journal

Organization