Method for optimizing queuing performance

• US 20050147038A1
• Filed: 12/24/2003
• Published: 07/07/2005
• Est. Priority Date: 12/24/2003
• Status: Active Grant

• Current Assignee: Intel Corporation
• Original Assignee: Intel Corporation
• Inventors: Chandra, Prashant R., Kumar, Alok, Naik, Uday, Romano, David A., Varde, Ameya S.
• Granted Patent: US 7,433,364 B2
• Time in Patent Office: Days
• US Class Current: 370/235
• CPC Class Codes: G06F 13/128 for dedicated transfers to a network for protocol converters G06F13/387

Abstract

Techniques for optimizing queuing performance include passing, from a ring having M slots, one or more enqueue requests and one or more dequeue requests to a queue manager, and determining whether the ring is full, and if the ring is full, sending only an enqueue request to the queue manager when one of the M slots is next available, otherwise, sending both an enqueue request and a dequeue request to the queue manager.

Claims

1. A method comprising:

passing, from a ring having M slots, one or more enqueue requests and one or more dequeue requests to a queue manager; and

determining whether the ring is full, and if the ring is full, sending only an enqueue request to the queue manager when one of the M slots is next available, otherwise, sending both an enqueue request and a dequeue request to the queue manager.

2. The method of claim 1 wherein each enqueue request designates a particular output queue to which an element is to be added.

3. The method of claim 2 wherein an element is a data packet.

4. The method of claim 1 wherein each dequeue request designates a particular output queue from which an element is to be removed.

5. The method of claim 4 wherein an element is a data packet.

6. The method of claim 1 wherein the ring has a next neighbor data structure.

7. The method of claim 1, further comprising:

receiving on the ring enqueue requests from one or more processing engines.

8. The method of claim 1, further comprising:

receiving on the ring dequeue requests from a queue scheduler.

9. A computer program product, disposed in a computer readable medium, having instructions for causing a processor to:

pass, from a ring having M slots, one or more enqueue requests and one or more dequeue requests to a queue manager; and

determine whether the ring is full, and if the ring is full, send only an enqueue request to the queue manager when one of the M slots is next available, otherwise, send both an enqueue request and a dequeue request to the queue manager.

10. The product of claim 9 wherein each enqueue request designates a particular output queue to which an element is to be added.

11. The product of claim 10 wherein an element is a data packet.

12. The product of claim 9 wherein each dequeue request designates a particular output queue from which an element is to be removed.

13. The product of claim 12 wherein an element is a data having one or more data packet.

14. The product of claim 9 wherein the ring has a next neighbor data structure.

15. The product of claim 9, further comprising instructions operable to cause the processor to:

receive on the ring enqueue requests from one or more processing engines.

16. The product of claim 9, further comprising instructions operable to cause the processor to:

receive on the ring dequeue requests from a queue scheduler.

17. An apparatus comprising:

a processing engine to make enqueue requests;

a queue scheduler to make dequeue requests;

a queue manager configured to process the enqueue requests and the dequeue requests;

a ring having M slots, the ring configured to pass the enqueue requests from the processing engine to the queue manager and to pass the dequeue requests from the queue scheduler to the queue manager; and

a queue scheduler configured to monitor the enqueue requests and dequeue requests on the ring and determine whether the ring is full, and if the ring is full, send only an enqueue request to the queue manager when one of the M slots is next available, otherwise, send both an enqueue request and a dequeue request to the queue manager.

18. The apparatus of claim 17 wherein each enqueue request designates a particular output queue to which an element is to be added.

19. The apparatus of claim 17 wherein an element is a data packet.

20. The apparatus of claim 17 wherein each dequeue request designates a particular output queue from which an element is to be removed.

21. The apparatus of claim 20 wherein an element is a data packet.

22. The apparatus of claim 17 wherein the ring has a next neighbor data structure.

23. A system comprising:

a source of data packets;

a destination of data packets; and

a device operating to transfer packets from the source to the destination comprising;

a processing engine to make enqueue requests;

a queue scheduler to make dequeue requests;

a queue manager configured to process the enqueue requests and the dequeue requests; and

a ring having M slots and configured to pass the enqueue requests from the processing engine to the queue manager and to pass the dequeue requests from the queue scheduler to the queue manager;

wherein the queue scheduler is configured to monitor the enqueue requests and dequeue requests on the ring and determine whether the ring is full, and if the ring is full, send only an enqueue request to the queue manager when one of the M slots is next available, otherwise, send both an enqueue request and a dequeue request to the queue manager.

24. The system of claim 23, wherein each enqueue request designates a particular output queue to which an element is to be added.

25. The system of claim 23 wherein an element is a data packet.

26. The system of claim 23 wherein each dequeue request designates a particular output queue from which an element is to be removed.

27. The system of claim 26 wherein an element is a data packet.

28. A network device comprising:

an input port for receiving a data packet;

an output port for transmitting a data packet; and

a scheduling device capable of,

passing, on a ring having M slots, one or more enqueue requests and one or more dequeue requests to a queue manager; and

determining whether the ring is full, and if the ring is full, sending only an enqueue request to the queue manager when one of the M slots is next available, otherwise, sending both an enqueue request and a dequeue request to the queue manager.

29. The network device of claim 28, wherein the scheduling device is further capable of generating one or more dequeue requests.