# US 2016/0259666 A1 · System and method for intelligent timer services

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2016/0259666 A1
- Document ID: US20160259666A1
- Status: Published application
- Kind: A1
- Application number: 15/156,480
- Filed: 2016-05-17
- Published: 2016-09-08
- Earliest claimed: 2012-09-07
- Assignees: Accedian Networks Inc.
- Applicants: Accedian Networks Inc.
- Inventors: Andre Dupont; Thierry DeCorte
- Web page: https://patentgrep.com/patent/US20160259666A1

## CPC

- G06F 1/14: Time supervision arrangements, e.g. real time clock
- G06F 9/4881: {Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues}
- G06F 9/4825: {Interrupt from clock, e.g. time of day}
- G06F 9/4831: {with variable priority}
- G06F 9/4837: {time dependent}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A method is provided for efficiently scheduling timer events within an operating system by allocating a plurality of timers, each of which has an expiry time, to a set of available timer slots. The method defines a timer spread value that denotes the allowed variance of the expiry times of each of the timers, calculates a set of available timer slots for each of the timers based on the timer spread value, and adjusts the expiry times of the timers so as to insert and evenly spread the timers across the set of available timer slots. In one implementation, the set of available timer slots is located in a timer wheel existing within the operating system, and the timer wheel uses a plurality of timer vectors arranged into successively increasing levels, beginning with level zero.

## Claims

### Claim at position 1

1-13. (canceled)

### Claim 14

A method of efficiently scheduling timer events within an operating system by allocating a plurality of timers to a set of available timer slots located in a timer wheel existing within the operating system, the timer wheel using a plurality of timer vectors arranged into successively increasing levels, beginning with level zero, each of the plurality of timers having an expiry time, the method comprising:
defining a timer spread value for each of the plurality of timers which is a measure of an allowed variance of the expiry times of each of the plurality of timers;
specifying a timer interval for each of the plurality of timers;
calculating a set of available timer slots for each of the plurality of timers based on the timer spread value;
comparing the timer interval for each of the plurality of timers to each slot in the plurality of timer vectors; and
adjusting the expiry times of each of the plurality of timers so as to insert and spread the plurality of timers across the set of available timer slots.

### Claim 15 (depends on 14)

The method of claim 14, wherein at least one of the plurality of timers is designated as a non-periodic timer.

### Claim 16 (depends on 14)

The method of claim 14, wherein at least one of the plurality of timers is designated as a periodic timer.

### Claim 17 (depends on 14)

The method of claim 14, wherein the timer interval is specified in microseconds.

### Claim 18 (depends on 14)

The method of claim 14, wherein the timer interval is specified in nanoseconds.

### Claim 19 (depends on 14)

The method of claim 14, further comprising converting the timer interval into a number of operating system (OS) ticks as
t_tick=timer_tick/t
wherein t_tick is the timer interval in number of OS ticks, timer_tick is the timer interval, and t is the OS time period.

### Claim 20 (depends on 14)

The method of claim 14, wherein calculating the set of available timer slots comprises applying a maximum positive spread and a maximum negative spread.

### Claim 21

A system for efficiently scheduling timer events within an operating system by allocating a plurality of timers to a set of available timer slots located in a timer wheel existing within the operating system, the timer wheel using a plurality of timer vectors arranged into successively increasing levels, beginning with level zero, each of the timers having an expiry time, the system comprising:
one or more processors; and
one or more modules stored on a memory and executable by the one or more processors, the one or more modules configured to:
define a timer spread value which is a measure of an allowed variance of the expiry times of each of the plurality of timers;
specify a timer interval for each of the plurality of timers;
calculate a set of available timer slots for each of the timers based on the timer spread value;
compare the timer interval for each of the plurality of timers to each slot in the plurality of timer vectors; and
adjust the expiry times of the timers so as to insert and spread the timers across the set of available timer slots.

### Claim 22 (depends on 14)

The system of claim 14, wherein at least one of the plurality of timers is designated as a non-periodic timer.

### Claim 23 (depends on 14)

The system of claim 14, wherein at least one of the plurality of timers is designated as a periodic timer.

### Claim 24 (depends on 14)

The system of claim 14, wherein the timer interval is specified in microseconds.

### Claim 25 (depends on 14)

The system of claim 14, wherein the timer interval is specified in nanoseconds.

### Claim 26 (depends on 14)

The system of claim 14, further comprising converting the timer interval into a number of operating system (OS) ticks as t_tick=timer_tick/t
wherein t_tick is the timer interval in number of OS ticks, timer_tick is the timer interval, and t is the OS time period.

### Claim 27 (depends on 14)

The system of claim 14, wherein the calculating comprises applying a maximum positive spread and a maximum negative spread.
