Complexity analyses of event set algorithms
The Computer Journal
ACM Computing Surveys (CSUR) - The MIT Press scientific computation series
Computer networks
VAXcluster: a closely-coupled distributed system
ACM Transactions on Computer Systems (TOCS)
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
A comparison of simulation event list algorithms
Communications of the ACM
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
ACM '65 Proceedings of the 1965 20th national conference
Time flow mechanisms for use in digital logic simulation
WSC '71 Proceedings of the 5th conference on Winter simulation
A system for computer music performance
ACM Transactions on Computer Systems (TOCS)
Transport protocol processing at GBPS rates
SIGCOMM '90 Proceedings of the ACM symposium on Communications architectures & protocols
Interprocess Communication Dependency on Network Load
IEEE Transactions on Software Engineering
Practical trade-offs for open interconnection
CSC '92 Proceedings of the 1992 ACM annual conference on Communications
Implementing network protocols at user level
SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
Implementing network protocols at user level
IEEE/ACM Transactions on Networking (TON)
A high performance transparent bridge
IEEE/ACM Transactions on Networking (TON)
Packet network simulation: speedup and accuracy versus timing granularity
IEEE/ACM Transactions on Networking (TON)
Hashed and hierarchical timing wheels: efficient data structures for implementing a timer facility
IEEE/ACM Transactions on Networking (TON)
Communications of the ACM
Soft timers: efficient microsecond software timer support for network processing
Proceedings of the seventeenth ACM symposium on Operating systems principles
Soft timers: efficient microsecond software timer support for network processing
ACM Transactions on Computer Systems (TOCS)
Signals, timers, and continuations for multithreaded user-level protocols
Software—Practice & Experience - Research Articles
Collected experience from implementing RSVP
IEEE/ACM Transactions on Networking (TON)
Performance issues in parallelized network protocols
OSDI '94 Proceedings of the 1st USENIX conference on Operating Systems Design and Implementation
Device driver issues in high-performance networking
HSNS'94 Proceedings of the High-Speed Networking Symposium on USENIX 1994 High-Speed Networking Symposium
30 seconds is not enough!: a study of operating system timer usage
Proceedings of the 3rd ACM SIGOPS/EuroSys European Conference on Computer Systems 2008
Overhead and performance study of the general internet signaling transport (GIST) protocol
IEEE/ACM Transactions on Networking (TON)
A new implementation method of timer for periodic tasks
Journal of Embedded Computing - Advanced Topics on Embedded Computing
Approximation of generalized processor sharing with interleaved stratified timer wheels
IEEE/ACM Transactions on Networking (TON)
An overview of interrupt accounting techniques for multiprocessor real-time systems
Journal of Systems Architecture: the EUROMICRO Journal
FIFO Service with Differentiated Queueing
Proceedings of the 2011 ACM/IEEE Seventh Symposium on Architectures for Networking and Communications Systems
| Hi-index | 0.02 |
Conventional algorithms to implement an Operating System timer module take &Ogr;(n) time to start or maintain a timer, where n is the number of outstanding timers: this is expensive for large n. This paper begins by exploring the relationship between timer algorithms, time flow mechanisms used in discrete event simulations, and sorting techniques. Next a timer algorithm for small timer intervals is presented that is similar to the timing wheel technique used in logic simulators. By using a circular buffer or timing wheel, it takes &Ogr;(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 trade-offs are discussed.