US20080317059A1 - Apparatus and method for priority queuing with segmented buffers - Google Patents
Apparatus and method for priority queuing with segmented buffers Download PDFInfo
- Publication number
- US20080317059A1 US20080317059A1 US12/203,032 US20303208A US2008317059A1 US 20080317059 A1 US20080317059 A1 US 20080317059A1 US 20303208 A US20303208 A US 20303208A US 2008317059 A1 US2008317059 A1 US 2008317059A1
- Authority
- US
- United States
- Prior art keywords
- buffers
- priority
- sub
- requests
- buffer
- 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.)
- Abandoned
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L49/00—Packet switching elements
- H04L49/90—Buffering arrangements
-
- 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/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/50—Queue scheduling
- H04L47/62—Queue scheduling characterised by scheduling criteria
- H04L47/6285—Provisions for avoiding starvation of low priority queues
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L49/00—Packet switching elements
- H04L49/90—Buffering arrangements
- H04L49/9047—Buffering arrangements including multiple buffers, e.g. buffer pools
- H04L49/9052—Buffering arrangements including multiple buffers, e.g. buffer pools with buffers of different sizes
Abstract
Apparatus and methods for efficient queuing and dequeuing using segmented output buffers comprising sub-buffers and priority queues. Output buffers are monitored for empty sub-buffers. When a newly empty sub-buffer is discovered, a refill request is enqueued in a ranked priority queue wherein the rank of the destination priority queue is based on the number of empty-sub-buffers in the requesting output buffer. All high priority refill requests are dequeued before lower priority refill requests, thereby reducing the possibility of starvation. Optionally, by using simple dequeuing criteria, such as a FIFO discipline, instead of complex algorithms designed to improve fairness, system resources may be conserved thereby improving system throughput.
Description
- This application is a continuation of U.S. pending application ser. No. 10/927,801 filed Aug. 26, 2004, the entire disclosure of which is incorporated herein by reference.
- Invention relates to apparatus and methods for reducing the risk of underflow in a multiple queue system.
- Queues are used in a variety of applications, especially where resources are shared. For example, queues may be used to manage traffic in routers, file and data servers or to schedule processes and/or threads in single and/or multi-processor systems. A variety of techniques may be used to prioritize resource requests in an effort to improve throughput or efficiency or to guarantee a quality of service (QoS). However, many of these techniques run the risk of starving some requesters. In order to address the issue of starvation, complex algorithms may be used to enqueue and/or de-queue resource requests based on a variety of parameters. However, when complex algorithms are used to reduce starvation, precious system resources are consumed by the increased calculations and/or delays are introduced, thereby reducing overall throughput.
- What is needed is a method and apparatus for enqueing and dequeuing requests that reduces starvation based on an economical use of system resources.
- The present invention provides apparatus and methods for efficient queuing and dequeuing using segmented output buffers and priority queues. According to the current invention, each output buffer is segmented into a multiplicity of sub-buffers. A set of ranked priority queues are used to hold refill requests for the output buffers. Output buffers are monitored for empty sub-buffers. When a newly empty sub-buffer is discovered, a refill request is enqueued in a priority queue wherein the rank of the destination priority queue is based on the number of empty-sub-buffers in the requesting output buffer. By dequeuing refill requests in an order according to the rank of the priority queues, all high priority refill requests are dequeued before lower priority refill requests. In this way, the possibility of starvation is reduced because an output buffer's refill request will eventually be registered in the highest priority queue as it nears starvation.
- According to an example of the current invention, a first-in first-out (FIFO) queuing discipline may be used to dequeue each priority queue. By using simple dequeuing criteria, such as a FIFO discipline instead of complex algorithms designed to improve fairness, system resources may be conserved thereby improving system throughput.
- According to an example of the current invention, all sub-buffers may be the same size. Adding this constraint may improve the fairness of the current invention. In some cases, the items in the sub-buffers may be pointers or references and the size of the reference or pointer may not be related to the magnitude of the referenced items; in some cases, an additional constraint may be added wherein each referenced item has the same maximum magnitude.
- According to the current invention, examples of the queuing apparatus and method according to the current invention may be used to enqueue/dequeue data requests, queries and/or transactions, to prioritize processes and/or threads and/or to route network traffic. Furthermore, examples of the queuing apparatus and method according to the current invention may be used to enqueue/dequeue physical items in a manufacturing, packaging and/or distribution system. In some cases, a system may use two or more queuing apparatus according to the current invention.
- Advantageously, the current invention may be implemented in software, hardware and/or firmware. The current invention may also be used in physical processes or systems where resources are distributed to multiple destinations.
-
FIG. 1 illustrates an example of a queuing apparatus according to the current invention deployed in a file server environment. -
FIG. 2 illustrates an example configuration of segmented output buffers and priority queues. -
FIG. 3 illustrates an example of a server system with multiple queuing apparatus according to the current invention deployed in a file server environment. -
FIG. 4 is a block diagram illustrating an example method of efficient queuing and de-queuing according to the current invention. -
FIG. 1 illustrates an example of aqueing apparatus 100 according to the current invention, deployed in a file server environment. Aqueuing apparatus 100 according to the current invention comprises a set of priority queues (110 in this example), a set of segmented output buffers in (112 in the example), a buffer monitor (116 in this example) and a queue servicer (118 in this example). In this example, data is being transferred from data sources (represented by externalnetworked storage device 121,external storage devices external clients local client 136. In this example,queueing apparatus 100 resides on aserver 117 and is used to prioritize data traffic traveling from the data sources (121, 122, 124 and 126) to data targets (128, 130, 132, 134 and 136). According to the current invention, aqueing apparatus 100 comprises a set of segmentedoutput buffers 112. The segmented output buffers comprise a set ofsegmented output buffers 112. The segmented output buffers comprise a multiplicity of sub-buffers.FIG. 2 illustrates an example configuration ofsegmented output buffers priority queses clients queuing apparatus 100, according to the current invention, further comprises a set of rankedpriority queues 110 for holding prioritized requests for data, abuffer monitor 116 and aqueue servicer 118. In this example, the ranked priority queues (101, 102, 103, 104 and 105) comprise slots (101 a-d, 102 a-d, 103 a-d, 104 a-d and 105 a-d); each slot is capable of holding a refill request for a sub-buffer (1 a-e, 2 a-e, 3 a-e and 4 a-e). In this example, each ranked priority queue (101, 102, 103, 104 and 105) comprises one slot per segmented output buffer (1, 2, 3 and 4); in this example, there are four segmented output buffers (1, 2, 3 and 4), so each ranked priority queue (101, 102, 103, 104 and 105) comprises four slots (101 a-d, 102 a-d, 103 a-d, 104 a-d and 105 a-d). In this example, thebuffer monitor 116 monitors thesegmented output buffers 112 and enqueues a refill request in a ranked priority queue (101, 102, 103, 104 or 105) each time an empty sub-buffer (such as, 1 b-e, 2 c-2, 3 e, 4 d and 4 e) is identified. A refill request is a request associated with a particular segmented output buffer (1, 2, 3 or 4) to refill at least one empty sub-buffer (for example, 1 b-e, 2 c-2, 3 e, 4 d and 4 e). - The rank of the destination priority queue (such as 101, 102, 103, 104 or 105) for the refill request is based on the number of empty sub-buffers (for example, 1 b-e, 2 c-2, 3 e, 4 d and 4 e) in the segmented output buffer (1, 2, 3, or 4). In this example,
priority queue 101 has the highest rank and holds the most urgent requests;priority queue 105 has the lowest rank and holds the least urgent requests. In this example, a request in the lowestrank priority queue 105 corresponds to the case where a single sub-buffer in a segmented output buffer is empty. A request corresponding to two empty sub-buffers in a segmented output buffer could been queued inpriority queue 104; a request corresponding to three empty sub-buffers in a segmented output buffer would be enqueued inpriority queue 103; a request corresponding to four empty sub-buffers would e enqueued inpriority queue 102; a request corresponding to all five sub-buffers being empty would be enqueued inpriority queue 101. The following examples illustrate the operation of this example of the current invention: - For example, when
sub-buffer 3 e became empty, segmentedoutput buffer 3 held one empty sub-buffer (3 e) and a refill request was enqueued inpriority queue 105;slot 105 c holds this refill request; ifslot 3 d were to become empty, leaving two empty sub-buffers (3 d and 3 e) insegmented output buffer 3, a refill request would then be registered in an empty slot (104 d) inpriority queue 104. - For example, when
sub-buffer 4 d became empty, segmentedoutput buffer 4 held two empty sub-buffers (4 d and 4 e) and a refill request was enqueued inpriority queue 104;slot 104 a holds this refill request. - For example, when sub-buffer 2 c became empty,
segmented output buffer 2 held A empty sub-buffers (2 c-e) and refill request was enqueued inpriority queue 103; slot 103 a holds this request. - In the example illustrated in
FIG. 2 , the segmented output buffers (1, 2, 3, and 4) all have the same number of sub-buffers (1 a-e, 2 a-e, 3 a-e or 4 a-e) and the total number of priority queues (101, 102, 103, 104 and 105) corresponds to the maximum possible number of empty sub-buffers in a segmented output buffer; in this case, there are five sub-buffers (1 a-e, 2 a-e, 3 a-e or 4 a-e) per segmented output buffer (1, 2, 3, and 4) and five corresponding priority queues (101, 102, 103, 104 and 105). However, in other examples, the number of sub-buffers per segmented output buffer may or may not vary and the number of priority queues may or may not match the maximum number of empty sub-buffers per segmented output buffer. For example, in some cases, the number of ranked priority queues may be less than the maximum number of empty sub-buffers per segmented output buffer; in some cases, this design may be used to conserve system resources in the case where completely empty segmented buffers are unexpected or extremely rare. In this case, the highest priority queue may be used to hold requests from segmented output buffers that are empty except for a single full or partially full sub-buffer and no additional requests are registered if the segmented buffer becomes completely empty. -
Queue servicer 118 services the rankedpriority queues 110.Queue servicer 118 dequeues requests (such as 102 a, 103 a, 103 b, 104 a-c and 105 a-d) from the priority queues (such as 101, 102, 103, 104 and 105) servicing the highest priority, non-empty priority queues before servicing any other queues. In this case, a simple FIFO queuing discipline per priority queue (101, 102, 103, 104 and 105) is used; for example, if requests were enqueued inpriority queue 105 intoslots - In some cases, the
queue servicer 118 may correlate a particular segmented output buffer with a source for satisfying the requests associated with that segmented output buffer. For example, when deployed in a file server application, aqueue servicer 118 may maintain a lookup table, have access to a lookup table or have access to a service that identifies an index into a file on a particular file server identifying the next chunk of data that should be served to a particular segmented output buffer (1, 2, 3 or 4). In this case, a refill request such as (such as 102 a, 103 a, 103 b, 104 a-c and 105 a-d) enqueued in a priority queue (such as 101, 102, 103 104 or 105) may be as simple as an identifier referring to the segmented output buffer (1, 2, 3 or 4) with a newly empty sub-buffer (for example, 1 b-e, 2 c-2, 3 e, 4 d and 4 e). However, in other examples of the current invention, the queue servicer may be less sophisticated and additional information may be incorporated into the request such as, but not limited to, the source for filling the request. For example, when used in a networking implementation, the source may be a buffer associated with an incoming port. - In the example illustrated in
FIG. 1 , the sub-buffers (1 a-e, 2 a-e, 3 a-e and 4 a-e) are all the same size and are capable of holding chunks of data. However, the size of the segmented output buffer (such as 1, 2, 3 or 4) and/or sub-buffer (such as 1 a-e, 2 a-e, 3 a-e and 4 a-e) may be designed and/or altered to improve fairness based on the size of the data transfers. For example, if the size of the sub-buffer (such as 1 a-e, 2 a-e, 3 a-e and 4 a-e) is much larger than required for a typical data transfer, the fairness and/or efficiency of the current invention may be improved by shrinking the sub-buffer (1 a-e, 2 a-e, 3 a-e and 4 a-e) size. In some examples according to the current invention, the segmented output buffer size and/or sub-buffer size may be static or dynamic; in some cases, the sub-buffer size may be evaluated one or more times to assess and/or alter the sub-buffer size for improved performance and/or fairness. - In the file server example illustrated in
FIG. 1 , the sub-buffers (1 a-e, 2 a-e, 3 a-e and 4 a-e) hold actual chunks of data and the size of the sub-buffer (1 a-e, 2 a-e, 3 a-e and 4 a-e) represents the maximum magnitude of a data chunk that may be enqueued. However, in other examples according to the current invention, the sub-buffers may hold other items such as, but not limited to, data, pointers and/or identifiers representing processes, threads, queries, network traffic and/or transactions. In some cases, identically sized pointers and/or identifiers may refer to differently sized items. In an example according to the current invention, a further constraint may be added incorporating the concept that the pointers or identifiers may refer to an item of a maximum magnitude, which may improve the fairness of service. - The current invention may be implemented in software, hardware and/or firmware. For example, the current invention may be implemented in-part in a single threaded or multi-threaded environment. For example, a queue servicer (such as queue servicer 118) may comprise one or more threads in a multi-threaded environment or be part of a larger process in a single threaded environment. Similarly, a buffer monitor (such as buffer monitor 116) may comprise one or more threads in a multi-threaded environment or be part of a larger process in a single threaded environment. In some cases, there may be multiple buffer monitors; for example, each segmented output buffer may have its own buffer monitor. In some cases, some or all of the invention may be implemented in one or more Field Programmable Gate Arrays (FPGAs) and/or Application Specific Integrated Circuits (ASICS). In some cases, the invention may be implemented in software using various data structures, such as circular queues, lists and/or stacks may be used to implement the segmented output buffers.
- In the example illustrated in
FIG. 1 , thecurrent invention 100 is deployed in a networked file server system. A computer system for efficient data queuing comprises aqueuer 100 and at least oneinterface 119. The contents (or the de-referenced contents) of the segmented output buffers (such as 1, 2, 3 and 4) may be unloaded through an interface (such as interface 119) according to a variety of methods. In some cases, the data may be pulled from the segmented output buffers (such as 1, 2, 3 and 4) through an interface such as 119 by an external process, thread or entity such as, but not limited to, an external export scheduler or a process, thread or entity residing on a target client (such asclients export scheduler 138 that may reside, wholly or in part, within thequeuer 100, and/or be co-located on the same system, such asserver 117. An optional export scheduler such asexport scheduler 138 is responsible for de-queuing thesegmented output buffers 112 and exporting the contents of the segmented output buffers (or their de-referenced contents) to interfaces (such as interface 119) for delivery to targets such as 128, 130, 132, 134 and 136. In the example illustrated inFIG. 1 , theoptional export scheduler 138 is responsible for de-queuing data from thesegmented output buffers 112 and submitting the de-queued data to aninterface 119 for transport to one or more clients such as, but not limited to, a directly coupledtarget client 136 or networked target clients such as 128, 130, 132, 134 and 136. In other examples according to the current invention, the optional export scheduler may be coupled to one or more targets through direct and/or networked, persistent and/or intermittent connections. Depending on the implementation, the interface (such as interface 119) may comprise hardware and/or software; for example, in some cases, the interface (such as interface 119) may comprise a cable, a connector and a protocol for exporting data. In some cases, the targets may be implemented within the same chip or system as the current invention and the interface (such as 119) may comprise a direct electrical connection and/or a software interface; in some cases, the targets may be implemented within a software system and the interface (such as 119) may comprise a software interface In some cases, there may be multiple export schedulers; for example, there may be one export scheduler per segmented buffer. Export schedulers such as 138 may be implemented with simple or complex functionality. For example, anexport scheduler 138 may be used to transmit data onto a network such as 120 in a video broadcast application in a “send and forget” configuration, without concern for the ability of the target clients (such as 128, 130, 132 and 134) to receive the data; for example, theexport scheduler 138 may not communicate with the target clients (such as 128, 130, 132 and 134) to confirm connectivity, bandwidth and/or receipt of the data. In other examples according to the current invention, theexport scheduler 138 may be sophisticated. For example, theexport scheduler 138 may take into consideration issues of connectivity and bandwidth before transmitting data and/or communicate with the target client (such as 128, 130, 132, 134 and 136) to negotiate transmission rates and/or confirm and/or acknowledge transmissions. In some cases, theexport scheduler 138 may be combined with the buffer monitor 116 to improve efficiency. For example, a combined export scheduler/buffer monitor thread or process could be used to dequeue thesegmented output buffers segmented output buffers export scheduler 138 and buffer monitor 116 into a single thread or process, the overhead and/or delay associated with other implementations such as polling-based implementations may be reduced. An export scheduler may or may not reside on the same system as the queuer. In the example illustrated inFIG. 1 , theexport scheduler 138 resides on thesame server 117 as thequeuer 100. However, anexport scheduler 138 may be an element incorporated into thequeuer 100 as described above. In another example, an export scheduler may reside wholly or partially on an external system such as a target client (such asclients clients -
FIG. 3 illustrates an example of aserver system 200 with multiple queuing apparatus (230 and 232) according to the current invention deployed in a file server environment. In this example, a queue system 232 queues traffic transmitted fromstorage devices clients second queue system 230 queues traffic fromclients storage devices server system 200 may be deployed in a video editing environment where large video files reside onstorage devices server system 200 may be a Linux server configured to support a clustered file server environment and enable multiple clients, such asclients storage devices clients storage devices system 230. In this example, other aspects of data transfer, such as access security and/or transaction commit and locking mechanisms, may be managed by systems external to the current invention, such as the Linux clustered file server. Queue systems such as queue system 232 may be deployed in large, small, clustered and/or unclustered environments and with a variety of architectures such as, but not limited to, storage area network (SAN), network attached storage (NAS), direct attached storage or virtualized storage architectures and any combination thereof. -
FIG. 4 is a block diagram illustrating an example method of efficient queuing and de-queuing according to the current invention. The process begins when at least one segmented output buffer is provided (Step 300). A segmented output buffer comprises a multiplicity of sub-buffers wherein each sub-buffer may hold items such as, but not limited to, data, pointers, process identifiers, queries, thread identifiers, transactions, transaction identifiers, network packets and physical objects for export. Ranked priority queues are provided for holding refill requests from the segmented output buffers (Step 310). Ranked priority queues are monitored for empty sub-buffers (Step 320). Refill requests are established in the priority queues when newly empty sub-buffer are discovered wherein the rank of the destination priority queue for the refill request is calculated based on the number of empty sub-buffers in the segmented output buffer (Step 330). Refill requests are dequeued from the priority queues in an order according to the rank of the priority queues, thereby insuring that all requests in the highest rank priority queue are dequeued before requests in any other queue (Step 340). In some cases, each priority queue may be dequeued according to a simple queuing discipline such as FIFO. However, other simple or complex disciplines may be used. Optionally, the dequeued refill requests are serviced and the sub-buffers are refilled (Step 350). Optionally, the sub-buffers in the segmented output buffers are dequeued and items are submitted to an interface for export to a target (Step 360). - Foregoing descriptions of specific embodiments of the invention have been presented for purposes of illustration and description. They are not intended to be exhaustive or to limit the invention to the precise forms disclosed. Modifications and variations are possible in light of the above teaching. For example, applicants contemplate that present invention may be used in various software, firmware and/or hardware applications such as network routers, process queuers, storage area networks and/or unicast, broadcast and/or multicast systems as well as industrial and/or manufacturing applications.
- The embodiments were chosen and described in order to explain the principles and the application of the invention, thereby enabling others skilled in the art to utilize the invention in its various embodiments and modifications according to the particular purpose contemplated. The scope of the invention is intended to be defined by the claims appended hereto and their equivalents.
Claims (10)
1. A method for efficient queuing, the method comprising:
providing at least one output buffer wherein each output buffer comprises a multiplicity of sub-buffers;
providing a plurality of priority queues for holding refill requests for the output buffers wherein the priority queues are ranked from highest priority to lowest priority;
monitoring the output buffers for empty sub-buffers and establishing a refill request in one of the priority queues when at least one newly empty sub-buffer is discovered wherein the rank of the destination priority queue for the refill request is calculated according to the number of empty sub-buffers in the output buffer; and,
dequeuing refill requests in an order according to the rank of the priority queues, thereby dequeuing all requests in the highest rank priority queue before dequeuing any requests of any other priority.
2. The method of claim 1 further comprising the step of servicing refill requests after they are dequeued, thereby filling empty sub-buffers.
3. The method of claim 1 wherein the step of dequeuing refill requests further comprises using a first-in first-out (FIFO) queuing discipline per priority queue.
4. The method of claim 1 wherein each output buffer has the same number of sub-buffers.
5. The method of claim 1 wherein each sub-buffer is the same size.
6. The method of claim 1 wherein each sub-buffer holds a reference to an item and wherein each referenced item has the same maximum magnitude.
7. The method of claim 1 wherein each sub-buffer holds items selected from the list comprising:
data, pointers, process identifiers, thread identifiers, queries, transactions, transaction identifiers or network packets or any combination thereof.
8. The method of claim 1 wherein each request comprises an output buffer identifier.
9. An efficient computer queuing system:
at least one output buffer wherein each output buffer comprises a plurality of sub-buffers;
a plurality of priority queues for holding refill requests for the output buffers wherein the priority queues are ranked from highest priority to lowest priority;
a buffer monitor for monitoring the output buffers for empty sub-buffers and establishing refill requests in the priority queues wherein the rank of the destination priority queue for the requests are based on the number of empty sub-buffers in the output buffer; and,
a queue servicer for dequeuing refill requests in the priority queues in an order according to the rank of the priority queues, thereby dequeuing all refill requests in the highest rank priority queue before dequeuing any refill requests in a lower rank priority queue.
10. A computer system for efficient data queuing comprising:
a queuing system comprising:
at least one output buffer wherein each output buffer comprises a multiplicity of sub-buffers;
a plurality of priority queues for holding refill requests for the output buffers wherein the priority queues are ranked from highest priority to lowest priority;
a buffer monitor for monitoring the output buffers for empty sub-buffers and establishing refill requests in the priority queues wherein the rank of the destination priority queue for the requests are based on the number of empty sub-buffers in the output buffer; and,
a queue servicer for dequeuing and servicing refill requests in the priority queues in an order according to the rank of the priority queues, thereby dequeuing all refill requests in the highest rank priority queue before dequeuing any refill requests in a lower rank priority queue; and,
one or more interfaces for coupling said queuing apparatus to targets and sources wherein a target may be coupled to an outgoing queue enabling a target to receive items from an output buffer and wherein a source may provide items for servicing data refill requests.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US12/203,032 US20080317059A1 (en) | 2004-08-26 | 2008-09-02 | Apparatus and method for priority queuing with segmented buffers |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US10/927,801 US7428239B1 (en) | 2004-08-26 | 2004-08-26 | Apparatus and method for priority queuing with segmented buffers |
US12/203,032 US20080317059A1 (en) | 2004-08-26 | 2008-09-02 | Apparatus and method for priority queuing with segmented buffers |
Related Parent Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US10/927,801 Continuation US7428239B1 (en) | 2004-08-26 | 2004-08-26 | Apparatus and method for priority queuing with segmented buffers |
Publications (1)
Publication Number | Publication Date |
---|---|
US20080317059A1 true US20080317059A1 (en) | 2008-12-25 |
Family
ID=39764196
Family Applications (2)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US10/927,801 Active 2025-07-01 US7428239B1 (en) | 2004-08-26 | 2004-08-26 | Apparatus and method for priority queuing with segmented buffers |
US12/203,032 Abandoned US20080317059A1 (en) | 2004-08-26 | 2008-09-02 | Apparatus and method for priority queuing with segmented buffers |
Family Applications Before (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US10/927,801 Active 2025-07-01 US7428239B1 (en) | 2004-08-26 | 2004-08-26 | Apparatus and method for priority queuing with segmented buffers |
Country Status (1)
Country | Link |
---|---|
US (2) | US7428239B1 (en) |
Cited By (8)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20110082948A1 (en) * | 2009-10-07 | 2011-04-07 | International Business Machines Corporation | System for high-speed low-latency inter-system communications via channel-to-channel adapters or similar devices |
US20110307625A1 (en) * | 2010-06-09 | 2011-12-15 | Wizmeta Co., Ltd. | Index-based video play apparatus and method using double buffering |
US20120063313A1 (en) * | 2010-09-13 | 2012-03-15 | Juniper Networks, Inc. | Hybrid weighted round robin (wrr) traffic scheduling |
US8559439B1 (en) * | 2010-11-03 | 2013-10-15 | Pmc-Sierra Us, Inc. | Method and apparatus for queue ordering in a multi-engine processing system |
US20140281000A1 (en) * | 2013-03-14 | 2014-09-18 | Cisco Technology, Inc. | Scheduler based network virtual player for adaptive bit rate video playback |
US20140281015A1 (en) * | 2013-03-14 | 2014-09-18 | Carefusion 303, Inc. | Post-Scheduling Ad Hoc Sequencing Of File Transfers |
US20150081368A1 (en) * | 2013-09-19 | 2015-03-19 | Oracle International Corporation | Method and system for implementing a cloud based email distribution fairness algorithm |
WO2016032518A1 (en) * | 2014-08-29 | 2016-03-03 | Hewlett Packard Enterprise Development Lp | Multiplexing network connections |
Families Citing this family (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
KR100964513B1 (en) * | 2005-04-15 | 2010-06-21 | 뉴저지 인스티튜트 오브 테크놀로지 | Dynamic bandwidth allocation and service differentiation for broadband passive optical networks |
TWI272533B (en) * | 2005-06-17 | 2007-02-01 | Lite On Technology Corp | A data stream buffer |
US20070067488A1 (en) * | 2005-09-16 | 2007-03-22 | Ebay Inc. | System and method for transferring data |
US9268608B2 (en) * | 2009-02-26 | 2016-02-23 | Oracle International Corporation | Automatic administration of UNIX commands |
US9275369B2 (en) | 2011-08-24 | 2016-03-01 | Oracle International Corporation | Demystifying obfuscated information transfer for performing automated system administration |
US9491081B2 (en) * | 2012-05-22 | 2016-11-08 | Ixia | Methods, systems, and computer readable media for generating test packets in a network test device using value list caching |
US9967197B2 (en) * | 2015-01-12 | 2018-05-08 | Citrix Systems, Inc. | Large scale bandwidth management of IP flows using a hierarchy of traffic shaping devices |
Citations (18)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5450549A (en) * | 1992-04-09 | 1995-09-12 | International Business Machines Corporation | Multi-channel image array buffer and switching network |
US5828653A (en) * | 1996-04-26 | 1998-10-27 | Cascade Communications Corp. | Quality of service priority subclasses |
US5838915A (en) * | 1995-06-21 | 1998-11-17 | Cisco Technology, Inc. | System for buffering data in the network having a linked list for each of said plurality of queues |
US6018515A (en) * | 1997-08-19 | 2000-01-25 | Ericsson Messaging Systems Inc. | Message buffering for prioritized message transmission and congestion management |
US6067301A (en) * | 1998-05-29 | 2000-05-23 | Cabletron Systems, Inc. | Method and apparatus for forwarding packets from a plurality of contending queues to an output |
US6091709A (en) * | 1997-11-25 | 2000-07-18 | International Business Machines Corporation | Quality of service management for packet switched networks |
US20020044546A1 (en) * | 2000-08-31 | 2002-04-18 | Magill Robert B. | Methods and apparatus for managing traffic through a buffered crossbar switch fabric |
US20020110134A1 (en) * | 2000-12-15 | 2002-08-15 | Glenn Gracon | Apparatus and methods for scheduling packets in a broadband data stream |
US20030133406A1 (en) * | 1998-11-10 | 2003-07-17 | Ayman Fawaz | Method and apparatus to minimize congestion in a packet switched network |
US6765905B2 (en) * | 2002-04-18 | 2004-07-20 | Motorola, Inc. | Method for reducing packet data delay variation in an internet protocol network |
US20040179535A1 (en) * | 2000-03-02 | 2004-09-16 | Drew Bertagna | Qualified priority queue scheduler |
US20050094643A1 (en) * | 2003-11-05 | 2005-05-05 | Xiaolin Wang | Method of and apparatus for variable length data packet transmission with configurable adaptive output scheduling enabling transmission on the same transmission link(s) of differentiated services for various traffic types |
US20050137966A1 (en) * | 2003-12-19 | 2005-06-23 | Munguia Peter R. | Flow control credit synchronization |
US20050169291A1 (en) * | 2002-04-30 | 2005-08-04 | Key Kenneth M. | System and method for operating a packet buffer in an intermediate node |
US7027455B2 (en) * | 2001-02-22 | 2006-04-11 | Zarlink Semiconductor Limited | Serial data transmitters |
US20070011223A1 (en) * | 2005-05-18 | 2007-01-11 | International Business Machines Corporation | Method and system for flexible network processor scheduler and data flow |
US20070101020A1 (en) * | 2005-10-28 | 2007-05-03 | Tzu-Ming Lin | Packet transmitting method of wireless network |
US20070112944A1 (en) * | 2005-09-28 | 2007-05-17 | Charles Zapata | Method and system for establishing a service-application execution environment in a hetergoneous, distributed computing system and a user-friendly data-transfer service application executing within the service-application execution environment |
-
2004
- 2004-08-26 US US10/927,801 patent/US7428239B1/en active Active
-
2008
- 2008-09-02 US US12/203,032 patent/US20080317059A1/en not_active Abandoned
Patent Citations (18)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5450549A (en) * | 1992-04-09 | 1995-09-12 | International Business Machines Corporation | Multi-channel image array buffer and switching network |
US5838915A (en) * | 1995-06-21 | 1998-11-17 | Cisco Technology, Inc. | System for buffering data in the network having a linked list for each of said plurality of queues |
US5828653A (en) * | 1996-04-26 | 1998-10-27 | Cascade Communications Corp. | Quality of service priority subclasses |
US6018515A (en) * | 1997-08-19 | 2000-01-25 | Ericsson Messaging Systems Inc. | Message buffering for prioritized message transmission and congestion management |
US6091709A (en) * | 1997-11-25 | 2000-07-18 | International Business Machines Corporation | Quality of service management for packet switched networks |
US6067301A (en) * | 1998-05-29 | 2000-05-23 | Cabletron Systems, Inc. | Method and apparatus for forwarding packets from a plurality of contending queues to an output |
US20030133406A1 (en) * | 1998-11-10 | 2003-07-17 | Ayman Fawaz | Method and apparatus to minimize congestion in a packet switched network |
US20040179535A1 (en) * | 2000-03-02 | 2004-09-16 | Drew Bertagna | Qualified priority queue scheduler |
US20020044546A1 (en) * | 2000-08-31 | 2002-04-18 | Magill Robert B. | Methods and apparatus for managing traffic through a buffered crossbar switch fabric |
US20020110134A1 (en) * | 2000-12-15 | 2002-08-15 | Glenn Gracon | Apparatus and methods for scheduling packets in a broadband data stream |
US7027455B2 (en) * | 2001-02-22 | 2006-04-11 | Zarlink Semiconductor Limited | Serial data transmitters |
US6765905B2 (en) * | 2002-04-18 | 2004-07-20 | Motorola, Inc. | Method for reducing packet data delay variation in an internet protocol network |
US20050169291A1 (en) * | 2002-04-30 | 2005-08-04 | Key Kenneth M. | System and method for operating a packet buffer in an intermediate node |
US20050094643A1 (en) * | 2003-11-05 | 2005-05-05 | Xiaolin Wang | Method of and apparatus for variable length data packet transmission with configurable adaptive output scheduling enabling transmission on the same transmission link(s) of differentiated services for various traffic types |
US20050137966A1 (en) * | 2003-12-19 | 2005-06-23 | Munguia Peter R. | Flow control credit synchronization |
US20070011223A1 (en) * | 2005-05-18 | 2007-01-11 | International Business Machines Corporation | Method and system for flexible network processor scheduler and data flow |
US20070112944A1 (en) * | 2005-09-28 | 2007-05-17 | Charles Zapata | Method and system for establishing a service-application execution environment in a hetergoneous, distributed computing system and a user-friendly data-transfer service application executing within the service-application execution environment |
US20070101020A1 (en) * | 2005-10-28 | 2007-05-03 | Tzu-Ming Lin | Packet transmitting method of wireless network |
Cited By (11)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20110082948A1 (en) * | 2009-10-07 | 2011-04-07 | International Business Machines Corporation | System for high-speed low-latency inter-system communications via channel-to-channel adapters or similar devices |
US8745263B2 (en) * | 2009-10-07 | 2014-06-03 | International Business Machines Corporation | System for high-speed low-latency inter-system communications via channel-to-channel adapters or similar devices |
US20110307625A1 (en) * | 2010-06-09 | 2011-12-15 | Wizmeta Co., Ltd. | Index-based video play apparatus and method using double buffering |
US20120063313A1 (en) * | 2010-09-13 | 2012-03-15 | Juniper Networks, Inc. | Hybrid weighted round robin (wrr) traffic scheduling |
US8462802B2 (en) * | 2010-09-13 | 2013-06-11 | Juniper Networks, Inc. | Hybrid weighted round robin (WRR) traffic scheduling |
US8559439B1 (en) * | 2010-11-03 | 2013-10-15 | Pmc-Sierra Us, Inc. | Method and apparatus for queue ordering in a multi-engine processing system |
US20140281000A1 (en) * | 2013-03-14 | 2014-09-18 | Cisco Technology, Inc. | Scheduler based network virtual player for adaptive bit rate video playback |
US20140281015A1 (en) * | 2013-03-14 | 2014-09-18 | Carefusion 303, Inc. | Post-Scheduling Ad Hoc Sequencing Of File Transfers |
US20150081368A1 (en) * | 2013-09-19 | 2015-03-19 | Oracle International Corporation | Method and system for implementing a cloud based email distribution fairness algorithm |
US10083410B2 (en) * | 2013-09-19 | 2018-09-25 | Oracle International Corporation | Method and system for implementing a cloud based email distribution fairness algorithm |
WO2016032518A1 (en) * | 2014-08-29 | 2016-03-03 | Hewlett Packard Enterprise Development Lp | Multiplexing network connections |
Also Published As
Publication number | Publication date |
---|---|
US7428239B1 (en) | 2008-09-23 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US20080317059A1 (en) | Apparatus and method for priority queuing with segmented buffers | |
US7397809B2 (en) | Scheduling methods for combined unicast and multicast queuing | |
US7295565B2 (en) | System and method for sharing a resource among multiple queues | |
US6956818B1 (en) | Method and apparatus for dynamic class-based packet scheduling | |
US9225659B2 (en) | Method and apparatus for scheduling a heterogeneous communication flow | |
CA2575869C (en) | Hierarchal scheduler with multiple scheduling lanes | |
US10193831B2 (en) | Device and method for packet processing with memories having different latencies | |
US7471689B1 (en) | Method and apparatus for managing and accounting for bandwidth utilization within a computing system | |
US8868672B2 (en) | Server node interconnect devices and methods | |
US7746783B1 (en) | Method and apparatus for monitoring packets at high data rates | |
US20080165793A1 (en) | Memory sharing mechanism based on priority elevation | |
US20070171929A1 (en) | Queue management in a network processor | |
US20070116025A1 (en) | Methods and system to manage data traffic | |
Hua et al. | Scheduling heterogeneous flows with delay-aware deduplication for avionics applications | |
US11321150B2 (en) | Ordered event notification | |
US20220021629A1 (en) | Coalescing packets based on hints generated by network adapter | |
US7209489B1 (en) | Arrangement in a channel adapter for servicing work notifications based on link layer virtual lane processing | |
US7591011B1 (en) | Assigning higher priority to transactions based on subscription level | |
US8943236B1 (en) | Packet scheduling using a programmable weighted fair queuing scheduler that employs deficit round robin | |
US7822051B1 (en) | Method and system for transmitting packets | |
US11310164B1 (en) | Method and apparatus for resource allocation | |
US6625149B1 (en) | Signaled receiver processing methods and apparatus for improved protocol processing | |
US7782870B1 (en) | Method and apparatus for consolidating available computing resources on different computing devices | |
US20020101876A1 (en) | Head of line blockage avoidance system and method of operation thereof | |
CA2575814C (en) | Propagation of minimum guaranteed scheduling rates |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AS | Assignment |
Owner name: SOFTWARE SITE APPLICATIONS, LIMITED LIABILITY COMP Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:EXAVIO (ASSIGNMENT FOR THE BENEFIT OF CREDITORS), LLC;REEL/FRAME:021471/0027 Effective date: 20080605 |
|
STCB | Information on status: application discontinuation |
Free format text: ABANDONED -- FAILURE TO RESPOND TO AN OFFICE ACTION |