Calendar heap system and method for efficient sorting
AssigneeAlcatel Lucent
InventorsMudhafar Hassan-Ali, Jeff Mendelson, Annie Rastello, Li-Sheng Chen, Radimir Shilshtut, Sina Soltani, Francisco Moreno
Life of this patent
Estimating the term…
Loading patent…
AssigneeAlcatel Lucent
InventorsMudhafar Hassan-Ali, Jeff Mendelson, Annie Rastello, Li-Sheng Chen, Radimir Shilshtut, Sina Soltani, Francisco Moreno
Estimating the term…
A calendar heap structure and method for sorting N timestamp (TS) values in an ATM fabric scheduler implemented in an access network element. The heap structure is implemented using a radix value (R) for grouping the N TS values into a number of groups. Validity bits associated with the TS values are hierarchically arranged in a tree having logR(N) levels, wherein the bottom layer's N bits correspond to pointers that point to linked lists of flows with respective TS values. Starting from the top level heap, each subsequent level's heaps are successively examined for determining which particular heap obtains a minimum value until a particular validity bit of the bottom level is reached, which validity bit points to the minimum TS.
A method for sorting N timestamp (TS) values in an Asynchronous Transfer Mode (ATM) fabric scheduler implemented in an access network element, comprising the steps:
A computer-accessible medium operable with a processor interface disposed in an Asynchronous Transfer Mode (ATM) fabric scheduler of an access network element, said medium having instructions thereon for performing the following operations when executed on a processor associated therewith, comprising:
A system for sorting N timestamp (TS) values in an Asynchronous Transfer Mode (ATM) fabric scheduler implemented in an access network element, comprising:
Dependencies are inferred from the claim text.