System and method for intelligent timer services

US9367352B2 · US · B2

Patent metadata
FieldValue
Publication numberUS-9367352-B2
Application numberUS-201514691726-A
CountryUS
Kind codeB2
Filing dateApr 21, 2015
Priority dateSep 7, 2012
Publication dateJun 14, 2016
Grant dateJun 14, 2016

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).

The invention claimed is: 1. A system for efficiently scheduling timer events within an operating system by allocating a plurality of timers to a set of available timer slots, each of said 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 the allowed variance of the expiry times of each of said timers; calculate a set of available timer slots for each of said timers based on said timer spread value; and adjust said expiry times of said timers so as to insert and spread said timers across said set of available timer slots, by analyzing the distribution of timer expirations in the set of available slots and selecting the slot with the least timer expirations, and adjusting the expiry time so that the timer expires during the selected slot; wherein said system performs said spreading to reduce at least one of peaks of processing activity and overhead due to processing activity. 2. A system for efficiently scheduling timer events within a timer wheel by allocating a plurality of timers to a set of available timer slots, each of said 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 the allowed variance of the expiry times of each of said timers; calculate a set of available timer slots for each of said timers based on said timer spread value; and adjust said expiry times of said timers so as to insert and spread said timers across said set of available timer slots, by analyzing the distribution of timer expirations in the set of available slots and selecting the slot with the least timer expirations, and adjusting the expiry time so that the timer expires during the selected slot; wherein said system performs said spreading to reduce at least one of peaks of processing activity and overhead due to processing activity. 3. A method for efficiently scheduling timer events within an operating system by allocating a plurality of timers to a set of available timer slots, each of said timers having an expiry time, the method comprising: defining a timer spread value which is a measure of the allowed variance of the expiry times of each of said timers; calculating a set of available timer slots for each of said timers based on said timer spread value; and adjusting said expiry times of said timers so as to insert and spread said timers across said set of available timer slots, by analyzing the distribution of timer expirations in the set of available slots and selecting the slot with the least timer expirations, and adjusting the expiry time so that the timer expires during the selected slot; wherein said adjusting said expiry times are for to reducing at least one of peaks of processing activity and overhead due to processing activity. 4. A method for efficiently scheduling timer events within a timer wheel by allocating a plurality of timers to a set of available timer slots, each of said timers having an expiry time, the method comprising: defining a timer spread value which is a measure of the allowed variance of the expiry times of each of said timers; calculating a set of available timer slots for each of said timers based on said timer spread value; and adjusting said expiry times of said timers so as to insert and spread said timers across said set of available timer slots, by analyzing the distribution of timer expirations in the set of available slots and selecting the slot with the least timer expirations, and adjusting the expiry time so that the timer expires during the selected slot; wherein said adjusting said expiry times are for to reducing at least one of peaks of processing activity and overhead due to processing activity.

Assignees

Inventors

Classifications

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

  • with variable priority · CPC title

  • G06F1/14Primary

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

  • G06F9/4881Primary

    Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues · 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 US9367352B2 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 G06F1/14. Mapped technology areas include Physics.
When was this patent published?
Publication date Tue Jun 14 2016 00:00:00 GMT+0000 (Coordinated Universal Time) (B2). 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).