CA2575869A1 - Hierarchal scheduler with multiple scheduling lanes - Google Patents
Hierarchal scheduler with multiple scheduling lanes Download PDFInfo
- Publication number
- CA2575869A1 CA2575869A1 CA002575869A CA2575869A CA2575869A1 CA 2575869 A1 CA2575869 A1 CA 2575869A1 CA 002575869 A CA002575869 A CA 002575869A CA 2575869 A CA2575869 A CA 2575869A CA 2575869 A1 CA2575869 A1 CA 2575869A1
- Authority
- CA
- Canada
- Prior art keywords
- scheduler
- scheduling
- item
- category
- parent
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/50—Queue scheduling
- H04L47/62—Queue scheduling characterised by scheduling criteria
- H04L47/6215—Individual queue per QOS, rate or priority
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/26—Flow control; Congestion control using explicit feedback to the source, e.g. choke packets
- H04L47/263—Rate modification at the source after receiving feedback
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/50—Queue scheduling
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/50—Queue scheduling
- H04L47/60—Queue scheduling implementing hierarchical scheduling
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/50—Reducing energy consumption in communication networks in wire-line communication networks, e.g. low power modes or reduced link rate
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
Disclosed is a hierarchy of individual schedulers with multiple scheduling lanes for scheduling items, such as, but not limited to packets or indications thereof, such that different classes of priority items can be propagated through the hierarchy of schedulers accordingly. A pipeline scheduler typically includes a root scheduler and one or more layers of schedulers with each of these layers including at least one scheduler. Each scheduler is configured to maintain items of different scheduling categories received from each of the particular scheduler's immediate children schedulers within the pipeline scheduler if any and from each immediate external source coupled to the particular scheduler if any, and to schedule the sending of the items of the different scheduling categories currently maintained to its parent schedule or external scheduler client. The items may correspond to packets, indications of packets, or any other entity.
Claims (33)
1. A pipeline scheduler comprising a root scheduler and one or more layers of schedulers, each of said one or more layers including at least one scheduler, each scheduler of said one or more layers of schedulers configured to communicate selected scheduled items to its parent scheduler in the pipeline scheduler; wherein said each scheduler of the pipeline scheduler is configured to maintain items of different scheduling categories received from each of said particular scheduler's immediate children schedulers within the pipeline scheduler if any or from each immediate external source coupled to said particular scheduler if any, and to schedule the sending of said items of said different scheduling categories currently maintained to its parent scheduler or external scheduler client based on priorities corresponding to the different scheduling categories of said items currently maintained.
2. The pipeline scheduler of claim 1, wherein said different scheduling categories include a high-priority traffic category and a rate-based traffic category;
and wherein said scheduling traffic includes rate-based scheduling of items corresponding to said rate-based traffic category.
and wherein said scheduling traffic includes rate-based scheduling of items corresponding to said rate-based traffic category.
3. The pipeline scheduler of claim 2, wherein said different scheduling categories further includes a low-priority traffic category.
4. The pipeline scheduler of claim 1, wherein each particular parent scheduler of the pipeline scheduler having one or more children schedulers in said one or more layers of schedulers, in response to selecting an item of a particular scheduling category of said different scheduling categories to forward to its parent scheduler which was received from a corresponding child scheduler of its said one or more children schedulers, is configured to request a next item of the particular scheduling category from the corresponding child scheduler.
5. The pipeline scheduler of claim 4, wherein the corresponding child scheduler is configured to forward to its parent scheduler, in response to said request of the next item, a best scheduled item from one of the different scheduling categories with the priority at least that of the particular scheduling category from the corresponding child scheduler.
6. The pipeline scheduler of claim 4, wherein the corresponding child scheduler is configured to forward to its parent scheduler, in response to said request of the next item of the particular scheduling category, a best scheduled item for the particular scheduling category in said particular parent scheduler.
7. The pipeline scheduler of claim 4, wherein the corresponding child scheduler is configured to maintain an indication of a need by its parent scheduler for a best scheduled item of the particular scheduling category from said particular scheduler in response to said request of the next item of the particular scheduling category when it currently has no items of the particular scheduling category.
8. The pipeline scheduler of claim 7, wherein the corresponding child scheduler is configured to forward to said particular parent scheduler, in response to said maintained indication of the need by its parent scheduler for the best scheduled item of the particular scheduling category and the receipt of a new item of the particular scheduling category, the new item of the particular scheduling category.
9. The pipeline scheduler of claim 1, wherein the items are packets or indications corresponding to packets.
10. The pipeline scheduler of claim 1, wherein each scheduler of the pipeline scheduler includes storage for one item of each of said different scheduling categories for each of its immediate child schedulers or external sources.
11. The pipeline scheduler of claim 1, wherein each scheduler of the pipeline scheduler includes a first scheduling mechanism for scheduling a first category of said different scheduling categories and a second scheduling mechanism for scheduling a second category of said different scheduling categories, wherein said first and second scheduling mechanisms schedule items using a different scheduling technique.
12. The pipeline scheduler of claim 1, wherein each scheduler of said one or more layers of schedulers is configured to identify whether or not its parent scheduler needs an item of a particular category of different scheduling categories, and it responds to at least receiving a particular item of the particular category and said identification that said parent needs an item of the particular category by forwarding the particular item to said parent scheduler.
13. A method for use in scheduling items corresponding to a plurality of different priority scheduling categories in a pipeline scheduler including a hierarchy of schedulers, the hierarchy of schedulers including a particular scheduler having a plurality of particular child schedulers and a particular parent scheduler, the particular scheduler performing operations comprising:
receiving a request from the particular parent scheduler, the request including an identification of a particular scheduling category of the plurality of different priority scheduling categories; and in response to receiving the request, forwarding to the particular parent scheduler a best item of currently stored items which were received from the plurality of particular child schedulers and corresponding to the particular scheduling category, the best item having been received from a particular child scheduler of the plurality of particular child schedulers, and requesting a replacement item of the particular scheduling category from the particular child scheduler.
receiving a request from the particular parent scheduler, the request including an identification of a particular scheduling category of the plurality of different priority scheduling categories; and in response to receiving the request, forwarding to the particular parent scheduler a best item of currently stored items which were received from the plurality of particular child schedulers and corresponding to the particular scheduling category, the best item having been received from a particular child scheduler of the plurality of particular child schedulers, and requesting a replacement item of the particular scheduling category from the particular child scheduler.
14. The method of claim 13, wherein the items are packets or indications corresponding to packets.
15. The method of claim 13, wherein the best item is rate scheduled and the particular scheduler includes a rate-scheduling data structure, and the method further comprises updating the rate-scheduling data structure based on the best item.
16. A method for use in scheduling items corresponding to a plurality of different scheduling categories in a pipeline scheduler including a hierarchy of schedulers, the hierarchy of schedulers including a particular scheduler having a plurality of particular child schedulers and a particular parent scheduler, the particular scheduler performing operations comprising:
receiving a request from the particular parent scheduler, the request including an identification of a particular scheduling category of the plurality of different scheduling categories;
in response to receiving the request, identifying that the particular parent scheduler does not currently have an item of a higher-priority scheduling category than the particular scheduling category; and forwarding to the particular parent scheduler a best item of currently stored items which were received from the plurality of particular child schedulers and corresponding to the higher-priority scheduling category than the particular scheduling category, the best item having been received from a particular child scheduler of the plurality of particular child schedulers, and requesting a replacement item of the higher-priority scheduling category from the particular child scheduler.
receiving a request from the particular parent scheduler, the request including an identification of a particular scheduling category of the plurality of different scheduling categories;
in response to receiving the request, identifying that the particular parent scheduler does not currently have an item of a higher-priority scheduling category than the particular scheduling category; and forwarding to the particular parent scheduler a best item of currently stored items which were received from the plurality of particular child schedulers and corresponding to the higher-priority scheduling category than the particular scheduling category, the best item having been received from a particular child scheduler of the plurality of particular child schedulers, and requesting a replacement item of the higher-priority scheduling category from the particular child scheduler.
17. The method of claim 16, wherein the items are packets or indications corresponding to packets.
18. The method of claim 16, wherein the best item is rate scheduled and the particular scheduler includes a rate-scheduling data structure, and the method further comprises updating the rate-scheduling data structure based on the best item.
19. A method for use in scheduling items corresponding to a plurality of different scheduling categories in a pipeline scheduler including a hierarchy of schedulers, the hierarchy of schedulers including a particular scheduler having a plurality of particular child schedulers and a particular parent scheduler, the particular scheduler performing operations comprising:
receiving a particular item from one of the plurality of particular child schedulers, the particular item corresponding to a particular scheduling category of the plurality of different scheduling categories; and recognizing that the parent scheduler does not have an item from the particular scheduler corresponding to the particular scheduling category, and in response, sending the particular item to the particular parent scheduler.
receiving a particular item from one of the plurality of particular child schedulers, the particular item corresponding to a particular scheduling category of the plurality of different scheduling categories; and recognizing that the parent scheduler does not have an item from the particular scheduler corresponding to the particular scheduling category, and in response, sending the particular item to the particular parent scheduler.
20. The method of claim 19, wherein the particular scheduler maintains a parent status data structure indicating whether or not the particular parent scheduler desires an item of each particular scheduling category of the plurality of different scheduling categories.
21. The method of claim 20, wherein said recognizing that the particular parent scheduler does not have an item from the particular scheduler corresponding to the particular scheduling category includes checking the parent status data structure.
22. The method of claim 19, wherein the items are packets or indications corresponding to packets.
23. The method of claim 19, wherein the best item is rate scheduled and the particular scheduler includes a rate-scheduling data structure, and the method further comprises updating the rate-scheduling data structure based on the best item.
24. The method of claim 19, wherein the parent scheduler forwards items of different categories of the plurality of different scheduling categories to a single category of the plurality of different scheduling categories in its parent.
25. The method of claim 19, wherein the parent of the parent scheduler treats items received from at least two different scheduling categories in the parent scheduler as from a same scheduling category of the plurality of different scheduling categories.
26. A method for use in scheduling items corresponding to a plurality of different priority scheduling categories in a pipeline scheduler including a hierarchy of schedulers, the hierarchy of schedulers including a particular scheduler having a plurality of particular child schedulers and a particular parent scheduler, the particular scheduler performing operations comprising:
maintaining indications of each of the plurality of different priority scheduling categories for which the particular parent scheduler needs an item;
receiving a request from the particular parent scheduler, the request including an identification of a particular scheduling category of the plurality of different priority scheduling categories;
updating said indications of each of the plurality of different priority scheduling categories for which the particular parent scheduler needs an item to reflect the received request; and identifying an identified scheduling category of the plurality of different priority scheduling categories based on said indications of each of the plurality of different priority scheduling categories for which the particular parent scheduler needs an item, and in response: forwarding to the particular parent scheduler a best item of currently stored items which were received from the plurality of particular child schedulers and corresponding to the identified scheduling category, the best item having been received from a particular child scheduler of the plurality of particular child schedulers, and requesting a replacement item of the identified scheduling category from the particular child scheduler.
maintaining indications of each of the plurality of different priority scheduling categories for which the particular parent scheduler needs an item;
receiving a request from the particular parent scheduler, the request including an identification of a particular scheduling category of the plurality of different priority scheduling categories;
updating said indications of each of the plurality of different priority scheduling categories for which the particular parent scheduler needs an item to reflect the received request; and identifying an identified scheduling category of the plurality of different priority scheduling categories based on said indications of each of the plurality of different priority scheduling categories for which the particular parent scheduler needs an item, and in response: forwarding to the particular parent scheduler a best item of currently stored items which were received from the plurality of particular child schedulers and corresponding to the identified scheduling category, the best item having been received from a particular child scheduler of the plurality of particular child schedulers, and requesting a replacement item of the identified scheduling category from the particular child scheduler.
27. The method of claim 26, wherein the items are packets or indications corresponding to packets.
28. The method of claim 26, wherein the best item is rate scheduled and the particular scheduler includes a rate-scheduling data structure, and the method further comprises updating the rate-scheduling data structure based on the best item.
29. The method of claim 26, wherein the identified scheduling category is the same as the particular scheduling category.
30. The method of claim 26, wherein the identified scheduling category is a higher priority scheduling category than the particular scheduling category.
31. The method of claim 26, wherein the identified scheduling category is the highest priority scheduling category in the plurality of different priority scheduling categories for which an item is available to forward to the particular parent scheduler and an item is identified as being needed in said indications for which the particular parent scheduler needs an item.
32. An apparatus for use in scheduling items corresponding to a plurality of different priority scheduling categories in a pipeline scheduler including a hierarchy of schedulers, the hierarchy of schedulers including a particular scheduler having a plurality of particular child schedulers and a particular parent scheduler, the apparatus comprising:
means for receiving a request from the particular parent scheduler, the request including an identification of a particular scheduling category of the plurality of different scheduling categories; and means for forwarding to the particular parent scheduler, in response to receiving the request, a best item of currently stored items which were received from the plurality of particular child schedulers and corresponding to the particular scheduling category or a higher-priority scheduling category within the plurality of different scheduling categories, the best item having been received from a particular child scheduler of the plurality of particular child schedulers, and requesting a replacement item for the best item from the particular child scheduler.
means for receiving a request from the particular parent scheduler, the request including an identification of a particular scheduling category of the plurality of different scheduling categories; and means for forwarding to the particular parent scheduler, in response to receiving the request, a best item of currently stored items which were received from the plurality of particular child schedulers and corresponding to the particular scheduling category or a higher-priority scheduling category within the plurality of different scheduling categories, the best item having been received from a particular child scheduler of the plurality of particular child schedulers, and requesting a replacement item for the best item from the particular child scheduler.
33. The apparatus of claim 32, wherein the items are packets or indications corresponding to packets.
Applications Claiming Priority (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US10/913,055 | 2004-08-05 | ||
US10/913,055 US7876763B2 (en) | 2004-08-05 | 2004-08-05 | Pipeline scheduler including a hierarchy of schedulers and multiple scheduling lanes |
PCT/US2005/024066 WO2006023141A2 (en) | 2004-08-05 | 2005-07-07 | Hierarchal scheduler with multiple scheduling lanes |
Publications (2)
Publication Number | Publication Date |
---|---|
CA2575869A1 true CA2575869A1 (en) | 2006-03-02 |
CA2575869C CA2575869C (en) | 2011-08-30 |
Family
ID=35757339
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CA2575869A Expired - Fee Related CA2575869C (en) | 2004-08-05 | 2005-07-07 | Hierarchal scheduler with multiple scheduling lanes |
Country Status (5)
Country | Link |
---|---|
US (2) | US7876763B2 (en) |
EP (1) | EP1774714B1 (en) |
CN (2) | CN1981484B (en) |
CA (1) | CA2575869C (en) |
WO (1) | WO2006023141A2 (en) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US9984037B1 (en) | 2015-04-27 | 2018-05-29 | Synaptic Engines, Llc | Scheduler for a fine grained graph processor |
Families Citing this family (55)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7522609B2 (en) * | 2004-01-14 | 2009-04-21 | Cisco Technology, Inc | Propagation of minimum guaranteed scheduling rates among scheduling layers in a hierarchical schedule |
US7417999B1 (en) | 2004-01-14 | 2008-08-26 | Cisco Technology, Inc. | Priority propagation in a multi-level scheduling hierarchy |
US7599381B2 (en) * | 2004-12-23 | 2009-10-06 | Cisco Technology, Inc. | Scheduling eligible entries using an approximated finish delay identified for an entry based on an associated speed group |
US7646779B2 (en) * | 2004-12-23 | 2010-01-12 | Intel Corporation | Hierarchical packet scheduler using hole-filling and multiple packet buffering |
US7525962B2 (en) * | 2004-12-27 | 2009-04-28 | Intel Corporation | Reducing memory access bandwidth consumption in a hierarchical packet scheduler |
US7460544B2 (en) * | 2004-12-29 | 2008-12-02 | Intel Corporation | Flexible mesh structure for hierarchical scheduling |
US7843940B2 (en) * | 2005-06-01 | 2010-11-30 | Cisco Technology, Inc. | Filling token buckets of schedule entries |
US7706386B2 (en) * | 2005-10-26 | 2010-04-27 | Cisco Technology, Inc. | Fast 2-key scheduler |
US8018845B2 (en) * | 2006-01-25 | 2011-09-13 | Cisco Technology, Inc | Sampling rate-limited traffic |
US7873047B2 (en) * | 2006-04-19 | 2011-01-18 | Motorola, Inc. | Method and apparatus for quality of service for packet communications |
US7801164B2 (en) * | 2006-04-27 | 2010-09-21 | Agere Systems Inc. | Two dimensional timeout table mechanism with optimized delay characteristics |
US8077611B2 (en) * | 2006-07-27 | 2011-12-13 | Cisco Technology, Inc. | Multilevel coupled policer |
US8082274B2 (en) * | 2007-06-28 | 2011-12-20 | Microsoft Corporation | Scheduling application allowing freeform data entry |
WO2009014872A2 (en) * | 2007-07-24 | 2009-01-29 | Motorola, Inc. | Method and system for transmitting data packets in a communication network |
US7729242B2 (en) * | 2007-12-13 | 2010-06-01 | Cisco Technology, Inc. | 3-level queuing scheduler supporting flexible configuration and etherchannel |
US8566829B1 (en) * | 2008-01-30 | 2013-10-22 | Emc Corporation | Cooperative multi-level scheduler for virtual engines |
FR2934108B1 (en) * | 2008-07-21 | 2010-09-17 | Commissariat Energie Atomique | METHOD OF ORDERING PACKETS |
US20100097932A1 (en) * | 2008-10-15 | 2010-04-22 | Viasat, Inc. | Satellite traffic and congestion-based upstream scheduler |
TWI396443B (en) * | 2008-12-22 | 2013-05-11 | Ind Tech Res Inst | Method for audio and video control response and bandwidth adaptation based on network streaming application and server using the same |
US9461930B2 (en) | 2009-04-27 | 2016-10-04 | Intel Corporation | Modifying data streams without reordering in a multi-thread, multi-flow network processor |
US8615013B2 (en) * | 2010-05-18 | 2013-12-24 | Agere Systems Llc | Packet scheduling with guaranteed minimum rate in a traffic manager of a network processor |
US8837501B2 (en) * | 2010-05-18 | 2014-09-16 | Lsi Corporation | Shared task parameters in a scheduler of a network processor |
US8843682B2 (en) | 2010-05-18 | 2014-09-23 | Lsi Corporation | Hybrid address mutex mechanism for memory accesses in a network processor |
US9152564B2 (en) | 2010-05-18 | 2015-10-06 | Intel Corporation | Early cache eviction in a multi-flow network processor architecture |
US8619787B2 (en) * | 2010-05-18 | 2013-12-31 | Lsi Corporation | Byte-accurate scheduling in a network processor |
US8565250B2 (en) | 2010-05-18 | 2013-10-22 | Lsi Corporation | Multithreaded, superscalar scheduling in a traffic manager of a network processor |
US8869150B2 (en) | 2010-05-18 | 2014-10-21 | Lsi Corporation | Local messaging in a scheduling hierarchy in a traffic manager of a network processor |
US8949582B2 (en) | 2009-04-27 | 2015-02-03 | Lsi Corporation | Changing a flow identifier of a packet in a multi-thread, multi-flow network processor |
US8576862B2 (en) | 2010-05-18 | 2013-11-05 | Lsi Corporation | Root scheduling algorithm in a network processor |
US9160684B2 (en) | 2009-04-27 | 2015-10-13 | Intel Corporation | Dynamic updating of scheduling hierarchy in a traffic manager of a network processor |
US9727508B2 (en) | 2009-04-27 | 2017-08-08 | Intel Corporation | Address learning and aging for network bridging in a network processor |
US8869156B2 (en) | 2010-05-18 | 2014-10-21 | Lsi Corporation | Speculative task reading in a traffic manager of a network processor |
US8874878B2 (en) | 2010-05-18 | 2014-10-28 | Lsi Corporation | Thread synchronization in a multi-thread, multi-flow network communications processor architecture |
US8848723B2 (en) * | 2010-05-18 | 2014-09-30 | Lsi Corporation | Scheduling hierarchy in a traffic manager of a network processor |
US8638805B2 (en) | 2010-05-18 | 2014-01-28 | Lsi Corporation | Packet draining from a scheduling hierarchy in a traffic manager of a network processor |
US8910168B2 (en) | 2009-04-27 | 2014-12-09 | Lsi Corporation | Task backpressure and deletion in a multi-flow network processor architecture |
US8949578B2 (en) | 2009-04-27 | 2015-02-03 | Lsi Corporation | Sharing of internal pipeline resources of a network processor with external devices |
US8873550B2 (en) | 2010-05-18 | 2014-10-28 | Lsi Corporation | Task queuing in a multi-flow network processor architecture |
US8547878B2 (en) | 2010-05-18 | 2013-10-01 | Lsi Corporation | Modularized scheduling engine for traffic management in a network processor |
US8869151B2 (en) | 2010-05-18 | 2014-10-21 | Lsi Corporation | Packet draining from a scheduling hierarchy in a traffic manager of a network processor |
US8160911B2 (en) * | 2009-05-19 | 2012-04-17 | Microsoft Corporation | Project management applications utilizing summary tasks for top-down project planning |
CN102340443B (en) * | 2010-07-21 | 2015-07-22 | 中兴通讯股份有限公司 | Traffic scheduling device and method for packet switched network |
US8948043B2 (en) * | 2010-09-02 | 2015-02-03 | At&T Intellectual Property I, L.P. | Method and apparatus for normalizing cellular communications network data |
CN102763086A (en) * | 2012-01-18 | 2012-10-31 | 华为技术有限公司 | Task processing system for distributed computation and task processing method for distributed computation |
US9106574B2 (en) * | 2012-12-27 | 2015-08-11 | Cisco Technology, Inc. | Supporting quality of service differentiation using a single shared buffer |
US9276867B2 (en) | 2013-06-28 | 2016-03-01 | Cisco Technology, Inc. | Hierarchical scheduling system with layer bypass including updating scheduling information of a scheduling layer for each item whether or not it bypasses the scheduling layer |
CN104348751B (en) * | 2013-07-31 | 2019-03-12 | 中兴通讯股份有限公司 | Virtual output queue authorization management method and device |
US9401860B2 (en) * | 2013-08-09 | 2016-07-26 | Citrix Systems, Inc. | High performance quality-of-service packet scheduling for multiple packet processing engines |
US9729611B2 (en) | 2014-10-26 | 2017-08-08 | Cisco Technology, Inc. | Method and system for ABR recording |
WO2016078556A1 (en) * | 2014-11-17 | 2016-05-26 | Mediatek Inc. | Energy efficient multi-cluster system and its operations |
JPWO2016084394A1 (en) * | 2014-11-27 | 2017-08-24 | パナソニックIpマネジメント株式会社 | Imaging device |
US9804895B2 (en) * | 2015-08-28 | 2017-10-31 | Vmware, Inc. | Constrained placement in hierarchical randomized schedulers |
CN110247859B (en) * | 2019-06-17 | 2022-04-19 | 哈工大机器人(合肥)国际创新研究院 | Data sending method and device based on AIRT-ROS node |
US11683276B2 (en) | 2021-05-20 | 2023-06-20 | Cisco Technology, Inc. | Quasi-output queue behavior of a packet switching device achieved using virtual output queue ordering independently determined for each output queue |
CN113067778B (en) * | 2021-06-04 | 2021-09-17 | 新华三半导体技术有限公司 | Flow management method and flow management chip |
Family Cites Families (45)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5751708A (en) * | 1995-10-25 | 1998-05-12 | Lucent Technologies Inc. | Access method for broadband and narrowband networks |
US6130878A (en) | 1995-12-27 | 2000-10-10 | Compaq Computer Corporation | Method and apparatus for rate-based scheduling using a relative error approach |
US5892766A (en) * | 1996-02-22 | 1999-04-06 | Fujitsu, Ltd. | Method and apparatus for coordinating access to an output of a routing device in a packet switching network |
EP0798897A3 (en) | 1996-03-26 | 1999-07-14 | Digital Equipment Corporation | Method and apparatus for relative error scheduling using discrete rates and proportional rate scaling |
US6064650A (en) * | 1996-06-27 | 2000-05-16 | Xerox Corporation | Rate shaping in per-flow output queued routing mechanisms having output links servicing multiple physical layers |
US5864557A (en) * | 1996-09-25 | 1999-01-26 | Thomson Multimedia S.A. | Method and apparatus for opportunistically transferring data in a packet stream encoder |
US5844890A (en) * | 1997-03-25 | 1998-12-01 | International Business Machines Corporation | Communications cell scheduler and scheduling method for providing proportional use of network bandwith |
US5864540A (en) | 1997-04-04 | 1999-01-26 | At&T Corp/Csi Zeinet(A Cabletron Co.) | Method for integrated traffic shaping in a packet-switched network |
EP0972379A4 (en) * | 1997-04-04 | 2000-07-05 | Ascend Communications Inc | High speed packet scheduling method and apparatus |
US6408005B1 (en) | 1997-09-05 | 2002-06-18 | Nec Usa, Inc. | Dynamic rate control scheduler for ATM networks |
US6643293B1 (en) * | 1997-09-05 | 2003-11-04 | Alcatel Canada Inc. | Virtual connection shaping with hierarchial arbitration |
US6412000B1 (en) | 1997-11-25 | 2002-06-25 | Packeteer, Inc. | Method for automatically classifying traffic in a packet communications network |
US6483839B1 (en) * | 1998-03-18 | 2002-11-19 | Conexant Systems, Inc. | Apparatus and method for scheduling multiple and simultaneous traffic in guaranteed frame rate in ATM communication system |
US6389019B1 (en) * | 1998-03-18 | 2002-05-14 | Nec Usa, Inc. | Time-based scheduler architecture and method for ATM networks |
US6198723B1 (en) * | 1998-04-14 | 2001-03-06 | Paxonet Communications, Inc. | Asynchronous transfer mode traffic shapers |
US6532213B1 (en) * | 1998-05-15 | 2003-03-11 | Agere Systems Inc. | Guaranteeing data transfer delays in data packet networks using earliest deadline first packet schedulers |
ES2235449T3 (en) * | 1998-07-31 | 2005-07-01 | Alcatel | METHOD, PLANNING, SMART INTERMEDIATE MEMORY, PROCESSOR AND TELECOMMUNICATIONS SYSTEM TO SHARE A BANDWIDTH AVAILABLE. |
CA2245367A1 (en) | 1998-08-19 | 2000-02-19 | Newbridge Networks Corporation | Two-component bandwidth scheduler having application in multi-class digital communication systems |
GB9828143D0 (en) * | 1998-12-22 | 1999-02-17 | Power X Limited | Distributed hierarchical scheduling and arbitration for bandwidth allocation |
US6560230B1 (en) * | 1999-02-01 | 2003-05-06 | Redback Networks Inc. | Packet scheduling methods and apparatus |
US6449650B1 (en) * | 1999-02-01 | 2002-09-10 | Redback Networks Inc. | Methods and apparatus for deploying quality of service policies on a data communication network |
US6477168B1 (en) * | 1999-02-03 | 2002-11-05 | International Business Machines Corporation | Cell/frame scheduling method and communications cell/frame scheduler |
US6691312B1 (en) | 1999-03-19 | 2004-02-10 | University Of Massachusetts | Multicasting video |
AU6765200A (en) | 1999-08-13 | 2001-03-13 | Fujitsu Network Communications, Inc. | Supporting multiple application traffic types over connection oriented networks |
US6891834B1 (en) * | 1999-09-09 | 2005-05-10 | Avici Systems | Apparatus and method for packet scheduling |
AU2134301A (en) * | 1999-12-08 | 2001-06-18 | University Of British Columbia, The | Weighted fair queuing scheduler |
US6909691B1 (en) * | 2000-08-07 | 2005-06-21 | Ensim Corporation | Fairly partitioning resources while limiting the maximum fair share |
AU2000266748A1 (en) * | 2000-08-17 | 2002-02-25 | Redback Networks, Inc. | Packet scheduling methods and apparatus |
US6834053B1 (en) * | 2000-10-27 | 2004-12-21 | Nortel Networks Limited | Distributed traffic scheduler |
US6836475B2 (en) | 2000-12-01 | 2004-12-28 | Nokia Corporation | Method and apparatus for traffic shaping for IP router queues/egress |
US7065089B2 (en) * | 2001-12-21 | 2006-06-20 | Alcatel Canada Inc. | Method and system for mediating traffic between an asynchronous transfer mode (ATM) network and an adjacent network |
JP2003229877A (en) * | 2002-01-31 | 2003-08-15 | Fujitsu Ltd | Net side transmission equipment and method for controlling variable rate traffic by allocation of dynamic band |
JP3872716B2 (en) * | 2002-04-30 | 2007-01-24 | 富士通株式会社 | Packet output control device |
WO2004004275A1 (en) * | 2002-06-27 | 2004-01-08 | Nokia Corporation | Self-adaptive scheduling method and network element |
US7336662B2 (en) * | 2002-10-25 | 2008-02-26 | Alcatel Lucent | System and method for implementing GFR service in an access node's ATM switch fabric |
EP1584164A2 (en) * | 2002-12-31 | 2005-10-12 | Conexant, Inc. | System and method for providing quality of service in asynchronous transfer mode cell transmission |
US6876952B1 (en) | 2003-04-30 | 2005-04-05 | Cisco Technology, Inc. | Methods and apparatus for maintaining queues |
US7472159B2 (en) * | 2003-05-15 | 2008-12-30 | International Business Machines Corporation | System and method for adaptive admission control and resource management for service time guarantees |
US7277448B1 (en) * | 2003-06-27 | 2007-10-02 | Cisco Technology, Inc. | Hierarchical scheduler inter-layer eligibility deferral |
US20050047415A1 (en) * | 2003-08-28 | 2005-03-03 | Radhakrishna Channegowda | Data traffic manager and method therefor |
US20050047425A1 (en) * | 2003-09-03 | 2005-03-03 | Yonghe Liu | Hierarchical scheduling for communications systems |
US7417999B1 (en) * | 2004-01-14 | 2008-08-26 | Cisco Technology, Inc. | Priority propagation in a multi-level scheduling hierarchy |
US7522609B2 (en) | 2004-01-14 | 2009-04-21 | Cisco Technology, Inc | Propagation of minimum guaranteed scheduling rates among scheduling layers in a hierarchical schedule |
US7304944B2 (en) * | 2004-05-03 | 2007-12-04 | Lucent Technologies Inc. | Unified scheduling and queueing architecture for a multiservice switch |
US7675926B2 (en) * | 2004-05-05 | 2010-03-09 | Cisco Technology, Inc. | Hierarchical QoS behavioral model |
-
2004
- 2004-08-05 US US10/913,055 patent/US7876763B2/en not_active Expired - Fee Related
-
2005
- 2005-03-03 US US11/070,932 patent/US8077618B2/en active Active
- 2005-07-07 CN CN2005800226632A patent/CN1981484B/en active Active
- 2005-07-07 CA CA2575869A patent/CA2575869C/en not_active Expired - Fee Related
- 2005-07-07 EP EP05764490A patent/EP1774714B1/en active Active
- 2005-07-07 WO PCT/US2005/024066 patent/WO2006023141A2/en active Application Filing
- 2005-08-05 CN CN2005800242194A patent/CN1989738B/en active Active
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US9984037B1 (en) | 2015-04-27 | 2018-05-29 | Synaptic Engines, Llc | Scheduler for a fine grained graph processor |
Also Published As
Publication number | Publication date |
---|---|
US8077618B2 (en) | 2011-12-13 |
EP1774714A2 (en) | 2007-04-18 |
US20060029079A1 (en) | 2006-02-09 |
WO2006023141A2 (en) | 2006-03-02 |
WO2006023141A3 (en) | 2006-11-16 |
US7876763B2 (en) | 2011-01-25 |
CA2575869C (en) | 2011-08-30 |
CN1981484B (en) | 2010-12-01 |
EP1774714B1 (en) | 2012-09-05 |
CN1981484A (en) | 2007-06-13 |
CN1989738A (en) | 2007-06-27 |
CN1989738B (en) | 2012-04-18 |
EP1774714A4 (en) | 2010-06-02 |
US20060029080A1 (en) | 2006-02-09 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CA2575869A1 (en) | Hierarchal scheduler with multiple scheduling lanes | |
CN102129411B (en) | Access buffer | |
AU2010336363B2 (en) | Managing queries | |
CN102193853B (en) | Monitor of virtual machine and its dispatching method | |
Borst | Polling systems | |
EP1363221A3 (en) | Increasing the level of automation when scheduling and managing meetings | |
WO2005089235A3 (en) | System and method providing object messages in a compute environment | |
CA2655983A1 (en) | Systems and methods for adaptive throughput management for event-driven message-based data | |
CN105320571B (en) | A kind of process scheduling method | |
WO2003014883A3 (en) | Systems and methods for scheduling reoccurring deliveries and pickups | |
CN102171580A (en) | Packet aggregation and fragmentation at layer-2 over a managed network | |
CN102414663A (en) | A method and system for managing the order of messages | |
CN101582786A (en) | Instant handling method and device of instant messages | |
EP1693119A3 (en) | Inflow article management system | |
ATE378756T1 (en) | METHOD AND SYSTEM FOR MANAGING NETWORK TRAFFIC THROUGH SEVERAL CONSTRAINTS | |
KR20170033643A (en) | Semiconductor system and operating method thereof | |
US20100218191A1 (en) | Apparatus and Method for Processing Management Requests | |
CN109829005A (en) | A kind of big data processing method and processing device | |
CN100581128C (en) | Hierarchical scheduling method and device | |
CN108063803A (en) | The information management method and system for the system that given out information based on distributed subscription | |
Bushman et al. | Utility-based scheduling for public displays with live content | |
Ren et al. | Analysis of impact of network delay on multiversion conservative timestamp algorithms in DDBS | |
JP5370791B2 (en) | Pension interface and system in intellectual property database | |
KR101509501B1 (en) | Configuration management system of derivative projects and method thereof | |
US20060002392A1 (en) | Wire-speed packet management in a multi-pipeline network processor |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
EEER | Examination request | ||
MKLA | Lapsed |
Effective date: 20180709 |