The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.
The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.
Patent No.:
Date of Patent:
Jun. 26, 2007
Filed:
Oct. 25, 2002
Mudhafar Hassan-ali, Rohner Park, CA (US);
Jeff Mendelson, Petaluma, CA (US);
Annie Rastello, Rohnert Park, CA (US);
Li-sheng Chen, Petaluma, CA (US);
Radimir Shilshtut, Rohnert Park, CA (US);
Sina Soltani, Rohnert, CA (US);
Francisco Moreno, Petaluma, CA (US);
Mudhafar Hassan-Ali, Rohner Park, CA (US);
Jeff Mendelson, Petaluma, CA (US);
Annie Rastello, Rohnert Park, CA (US);
Li-Sheng Chen, Petaluma, CA (US);
Radimir Shilshtut, Rohnert Park, CA (US);
Sina Soltani, Rohnert, CA (US);
Francisco Moreno, Petaluma, CA (US);
Other;
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 log(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.