Hashed and Hierarchical Timing Wheels: Efficient Data Structures for Implementing a Timer Facility (1996) [8 citations — 0 self]
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
author = {George Varghese and Tony Lauck},
title = {Hashed and Hierarchical Timing Wheels: Efficient Data Structures for Implementing a Timer Facility},
year = {1996}
}
Bookmarks
OpenURL
Abstract:
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. This 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. 1 Introduction In a ...
