ADAPTIVE RECEIVE SIDE SCALING

• US 20090006521A1
• Filed: 06/29/2007
• Published: 01/01/2009
• Est. Priority Date: 06/29/2007
• Status: Abandoned Application

• Current Assignee: Intel Corporation
• Original Assignee: Intel Corporation
• Inventors: Foong, Annie, Veal, Bryan E.
• Application Number:
  US11/771,250
• Publication Number:
  US 20090006521A1
• Time in Patent Office: Days
• US Class Current: 709/201
• CPC Class Codes: H04L 45/00 Routing or path finding of packets in data switching networks routing or path finding in wireless networks H04W40/00
• CPC Class Codes: H04L 45/38 Flow based routing
• CPC Class Codes: H04L 45/745 Address table lookup; Address filtering
• CPC Class Codes: H04L 47/125 by balancing the load, e.g. traffic engineering

Abstract

Receive side scaling in a network system may be improved by moving the task of adapting the load distribution from the operating system (“OS”) to the network device. A load feedback mechanism may be used for the OS to report per-core load to the network device. With per-core load information from the OS as well as its own knowledge of new flows, the network device is able to map new flows to the least-utilized cores by changing these cores'"'"' entries in an indirection table in the network device directly.

Claims

1. A method for adaptive receive side scaling in a network system, comprising:

receiving a packet of a flow by a network device;

obtaining a hash result for the flow; and

adaptively assigning the flow to one of a plurality of processing units by the network device based at least in part on load feedback information of each of the plurality of processing units.

2. The method of claim 1, wherein adaptively assigning the flow to one of the plurality of processing units comprises assigning the flow through an indirection table, the indirection table including a plurality of entries, each entry corresponding to a hash result and including a first register, a second register, and an identify of a processing unit to which a flow corresponding to the entry is assigned.

3. The method of claim 2, wherein adaptively assigning the flow to one of the plurality of processing units comprises updating values in the first register and the second register periodically.

4. The method of claim 2, wherein adaptively assigning the flow to one of the plurality of processing units comprises updating values in the first register and the second register when a packet arrives.

5. The method of claim 2, wherein adaptively assigning the flow to one of the plurality of processing units comprises assigning the flow to the least utilized processing unit if the value of a first register in the entry corresponding to the hash result of the flow is unset.

6. The method of claim 2, wherein adaptively assigning the flow to one of the plurality of processing units comprises remapping the flow to the least utilized processing unit if the value of an second register in the entry corresponding to the hash result of the flow is unset and the load of the processing unit that currently processes the incoming flow exceeds a threshold.

7. The method of claim 1, wherein the load feedback information of each of the plurality of processing units includes utilization of each of the plurality of processing units and is provided to the network device through a driver of the network device.

8. An apparatus for adaptive receive side scaling in a network system, comprising:

a table, the table including a plurality of entries, each entry corresponding to a flow and including a first register, a second register, and an identity of a processing unit to which the flow is to be assigned; and

means for assigning an incoming flow to one of plurality of processing units based at least in part on values of a first register and a second register in an entry of the table corresponding to the incoming flow.

9. The apparatus of claim 8, further comprising a hash function unit to obtain a hash result for the incoming flow based at least in part on flow identity information in the incoming flow, the hash result being used to map the incoming flow to an entry in the table.

10. The apparatus of claim 8, further comprising at least one load register to store load feedback information of each of the plurality of processing units, the load feedback information including utilization of each of the plurality of processing units and is provided by an operating system through a network device driver.

11. The apparatus of claim 8, further comprising a controller to update a first register and a second register in an entry of the table when a packet of a flow arrives, the controller also updating the first register and the second register periodically.

12. The apparatus of claim 8, wherein the means for assigning an incoming flow assigns the incoming flow to the least utilized processing unit if the value of a first register in the entry corresponding to the incoming flow is unset.

13. The apparatus of claim 8, wherein the means for assigning an incoming flow remaps the incoming flow to the least utilized processing unit if the value of a second register in the entry corresponding to the incoming flow is unset and the load of the processing unit that currently processes the incoming flow exceeds a threshold.

14. The apparatus of claim 8, wherein the table and the means for assigning an incoming flow are comprised in a network device of a computing system.

15. A computing system with adaptive receive side scaling capability, comprising:

an operating system to manage workload of a plurality of processing units at the receive side of a network system; and

a driver of a network device to provide load feedback information of each of the plurality of the processing units from the operating system to the network device, the network device having;

a table, the table including a plurality of entries, each entry corresponding to a flow and including a first register, a second register, and an identity of a processing unit to which the flow is to be assigned, and

means for assigning an incoming flow to one of plurality of processing units based at least in part on values of a first register and a second register in an entry of the table corresponding to the incoming flow, the values of the first register and the second register being updated based at least in part on the load feedback information.

16. The computing system of claim 15, wherein the network device further comprises a hash function unit to obtain a hash result for the incoming flow based at least in part on flow identity information in the incoming flow, the hash result being used to map the incoming flow to an entry in the table.

17. The computing system of claim 15, wherein the network device further comprises at least one load register to store the load feedback information of each of the plurality of processing units, the load feedback information including utilization of each of the plurality of processing units.

18. The computing system of claim 15, wherein the network device further comprises a controller to update an first register and an second register in an entry of the table when a packet of a flow arrives, the controller also updating the first register and the second register periodically.

19. The computing system of claim 15, wherein the means for assigning an incoming flow assigns the incoming flow to the least utilized processing unit if the value of an first register in the entry corresponding to the incoming flow is unset.

20. The computing system of claim 15, wherein the means for assigning an incoming flow remaps the incoming flow to the least utilized processing unit if the value of a second register in the entry corresponding to the incoming flow is unset and the load of the processing unit that currently processes the incoming flow exceeds a threshold.