System and method for intelligent timer services

US2016259666A1 · US · A1

Patent metadata
FieldValue
Publication numberUS-2016259666-A1
Application numberUS-201615156480-A
CountryUS
Kind codeA1
Filing dateMay 17, 2016
Priority dateSep 7, 2012
Publication dateSep 8, 2016
Grant date

How to read this patent

A practical reading order for non-experts. Skip the full description unless you need deep technical detail.

  1. Title

    What the patent document calls the invention.

  2. Abstract

    A short plain-language summary of the technical disclosure.

  3. Assignees and inventors

    Who owns or filed the patent and who is credited as inventor.

  4. Key dates

    Filing, priority, publication, and grant dates set the timeline.

  5. First independent claim

    The legal scope of protection — read this for what is actually claimed.

  6. CPC / IPC classifications

    Technology tags used to group this patent with similar filings.

  7. Citations and related patents

    Prior art links and similar publications in this corpus.

Abstract

Official abstract text for this publication.

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.

First claim

Opening claim text (preview).

1 - 13 . (canceled) 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. 15 . The method of claim 14 , wherein at least one of the plurality of timers is designated as a non-periodic timer. 16 . The method of claim 14 , wherein at least one of the plurality of timers is designated as a periodic timer. 17 . The method of claim 14 , wherein the timer interval is specified in microseconds. 18 . The method of claim 14 , wherein the timer interval is specified in nanoseconds. 19 . 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. 20 . The method of claim 14 , wherein calculating the set of available timer slots comprises applying a maximum positive spread and a maximum negative spread. 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. 22 . The system of claim 14 , wherein at least one of the plurality of timers is designated as a non-periodic timer. 23 . The system of claim 14 , wherein at least one of the plurality of timers is designated as a periodic timer. 24 . The system of claim 14 , wherein the timer interval is specified in microseconds. 25 . The system of claim 14 , wherein the timer interval is specified in nanoseconds. 26 . 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. 27 . The system of claim 14 , wherein the calculating comprises applying a maximum positive spread and a maximum negative spread.

Assignees

Inventors

Classifications

  • Interrupt from clock, e.g. time of day · CPC title

  • G06F9/4881Primary

    Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues · CPC title

  • G06F1/14Primary

    Time supervision arrangements, e.g. real time clock · CPC title

  • with variable priority · CPC title

  • time dependent · CPC title

Patent family

Related publications grouped by family.

External sources

Frequently asked questions

Answers are generated from the same data shown on this page.

What does patent US2016259666A1 cover?
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 sp…
Who is the assignee on this patent?
Accedian Networks Inc
What technology area does this patent fall under?
Primary CPC classification G06F9/4881. Mapped technology areas include Physics.
When was this patent published?
Publication date Thu Sep 08 2016 00:00:00 GMT+0000 (Coordinated Universal Time) (A1). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 8 related publications on this page (citations in our corpus or others sharing the same primary CPC).