Systems and methods for smooth and efficient round-robin scheduling
Number of patents in Portfolio can not be more than 2000
United States of America Patent
Stats
-
Aug 5, 2008
Grant Date -
Nov 3, 2005
app pub date -
May 3, 2004
filing date -
May 3, 2004
priority date (Note) -
In Force
status (Latency Note)
Importance
Abstract
The present invention provides improved work schedulers for computer systems and communication processors. A preferred embodiment of the present invention includes systems with buffer memory for storing one or more communication packets or work requests arranged on a plurality of scheduling queues and information for controlling the scheduling of the queues, with output processors for outputting packets from the buffer memory; and with control processors for performing the scheduling methods of this invention. The scheduling methods repetitively initialize each queue's service credits, repetitively process each queue in a round-robin order by granting each queue with remaining service credits no more than one quantum of service and updating that queue's service credits to reflect the service actually used and the service available for use but not actually used.
First Claim
Family
International Classification(s)
Cited Art Landscape
Patent Citation Ranking
Advertisement
Advertisement
Advertisement
Recipient Email Address
Recipient Email Address
Comment
Recipient Email Address
Add to Portfolio(s)
To add this patent to one, or more, of your portfolios, simply click the add button.
This Patent is in these Portfolios:
Add to additional portfolios:
Last Refreshed On:
Changes done successfully