Patent ID: 8032561
Filing Date: 2011-10-04
Classification: G06F,Y10S

Abstract:
1. A method for scheduling events in a computer processing system, comprising: identifying queues, each of the queues associated with a corresponding priority, each of the queues including events; defining a data structure with a root level having a node group, the node group having k number of nodes, each of the k number of nodes sharing a pointer, each of the k number of nodes stored contiguously in memory, wherein the k number is equal to a number of multiple queues; associating the queues with respective nodes of the data structure; assigning a value representing the corresponding priority to the respective nodes; determining a priority between the respective nodes based on respective values representing the corresponding priority to the respective nodes; selecting one of the events corresponding to a node having a highest priority for transmission to a processing resource; processing the selected one of the events at the processing resource with a processor prior to remaining events; and continuing the selecting and the processing for remaining events of the node having the highest priority.