linux kernel timers

linux kernel timers

notes :

quoted: professional linux kernel architecture by Wolfgang Mauerer, page 902.

1. Not only must the data structure hold all the information needed to manage timers, but it must also be capable of being scanned easily at periodic intervals as that expired timers can execute and then be removed.

2. The main difficulty lies in scanning the list for timers that are about to expire and that have just expired.

3. The basis for grouping is the main array with five entries whose elements are again made up of arrays. The five positions of the main array sort the existing timers roughly according to expiry times.

4. The entries in the main table are known as groups and are sometimes referred to as buckets.