Patent · US Expired

Calendar heap system and method for efficient sorting

US7236495B2 · kind B2 · utility

0Cited by

37References

17Claims

0Family size

Assignee

Alcatel Lucent · FR

Inventors

Mudhafar Hassan-Ali · Petaluma, US
Jeff Mendelson · Petaluma, US
Annie Rastello · Abdulrahman Khaleefah Street, US
Li Chen · Petaluma, US
Radimir Shilshtut · Abdulrahman Khaleefah Street, US
Sina Soltani · Olivehurst, US
Francisco Moreno · Petaluma, US

Key dates

Filing date	Oct 25, 2002
Grant date	Jun 26, 2007
Priority date	—
Expiry date	Aug 30, 2025

Classification

Technology area (CPC H)Electricity
CPC primaryH04L2012/5679
WIPO fieldDigital communication
WIPO sectorElectrical engineering

Abstract

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.

Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.