Patent ID: 7657525
Filing Date: 2010-02-02
Classification: G06F,Y10S

Abstract:
1. A method for processing a heap data structure in a pipelined manner to implement a scheduler, comprising: identifying a first level of nodes and a second level of nodes in a first memory; storing values associated with the first level of nodes in the first memory; storing values associated with the second level of nodes in a second memory; sharing a single pointer referencing a node group of the second level of nodes, the node group of the second level of nodes being stored contiguously with additional node groups; associating a counter with the single pointer; and setting the counter to represent a number of holes below the single pointer; and performing a mixture of insert, remove, or swap operations on the heap data structure without stalling a pipeline in the scheduler performing the operations, wherein the operations do not leave the heap data structure left justified with a lack of values on a right side of a last level of the heap data structure, wherein the first memory is different from the second memory.