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.

Date of Patent:
Oct. 21, 2014

Filed:

Sep. 30, 2011
Applicants:

Balakrishnan Sundararaman, Cedar Park, TX (US);

Shashank Nemawarkar, Austin, TX (US);

David Sonnier, Austin, TX (US);

Allen Vestal, Cedar Park, TX (US);

Inventors:

Balakrishnan Sundararaman, Cedar Park, TX (US);

Shashank Nemawarkar, Austin, TX (US);

David Sonnier, Austin, TX (US);

Allen Vestal, Cedar Park, TX (US);

Assignee:

LSI Corporation, Milpitas, CA (US);

Attorneys:
Primary Examiner:
Int. Cl.
CPC ...
G06F 9/455 (2006.01); G06F 9/46 (2006.01); H04L 12/933 (2013.01); H04L 12/931 (2013.01); H04L 12/863 (2013.01); G06F 12/08 (2006.01);
U.S. Cl.
CPC ...
H04L 49/101 (2013.01); H04L 49/506 (2013.01); G06F 12/0813 (2013.01); H04L 49/109 (2013.01); H04L 47/623 (2013.01); H04L 47/621 (2013.01); H04L 49/00 (2013.01);
Abstract

Described embodiments provide for queuing tasks in a scheduling hierarchy of a network processor. A traffic manager generates a tree scheduling hierarchy having a root scheduler and N scheduler levels. The network processor generates tasks corresponding to received packets. The traffic manager performs a task enqueue operation for the task. The task enqueue operation includes adding the received task to an associated queue of the scheduling hierarchy, where the queue is associated with a data flow of the received task. The queue has a corresponding scheduler level M, where M is a positive integer less than or equal to N. Starting at the queue and iteratively repeating at each scheduling level until reaching the root scheduler, each node in the scheduling hierarchy maintains an actual count of tasks corresponding to the node. Each node communicates a capped task count to a corresponding parent scheduler at a relative next scheduler level.


Find Patent Forward Citations

Loading…