The present invention relates generally to data processing, and particularly to methods and systems for data arbitration.
Data arbitration schemes are used in various systems and applications in which multiple data producers or consumers contend for access to a shared resource. For example, some network switches perform arbitration of communication packets provided by multiple sources for transmission via a common output port.
An embodiment of the present invention that is described herein provides an apparatus includes multiple data sources and arbitration circuitry. The data sources are configured to send to a common destination data items and respective arbitration requests, such that the data items are sent to the destination regardless of receiving any indication that the data items were served to the destination in response to the respective arbitration requests. The arbitration circuitry is configured to receive and buffer the data items, to perform arbitration on the buffered data items responsively to the arbitration requests, and to serve the buffered data items to the destination in accordance with the arbitration.
In some embodiments, the data sources are configured to send each data item simultaneously with a corresponding arbitration request for the data item. In an embodiment, the data sources are configured to send the data items in accordance with remaining credit indicated by respective credit counters coupled to the data sources, and the arbitration circuitry is configured to send to a given data source a credit update upon serving a buffered data item received from the given data source.
In some embodiments, the arbitration circuitry includes multiple First-In First-Out (FIFO) memories for buffering the data items, and an arbiter that is configured to perform arbitration on the data items buffered in the FIFO memories. In a disclosed embodiment, a size of each FIFO memory depends on a round-trip delay between the data sources and the destination, plus an arbitration processing time of the arbitration circuitry.
In another embodiment, the arbitration circuitry is configured to send to the data sources arbitration grants upon scheduling the respective arbitration requests, and the data sources are configured to send the data items irrespective of the arbitration grants. In yet another embodiment, a given data source is configured to divide a data item into multiple data chunks, to send the data chunks separately to the destination but to send a single arbitration request for the entire data item.
In some embodiments, the data sources include input ports of a network switch, and the common destination includes an output port of the network switch. In other embodiments, the common destination includes an output port of a Network Interface Card (NIC). In an embodiment, the data sources and the destination are includes in a single Integrated Circuit (IC).
There is additionally provided, in accordance with an embodiment of the present invention, a method including sending data items and respective arbitration requests from multiple data sources to a common destination, such that the data items are sent to the destination regardless of receiving at the data sources any indication that the data items were served to the destination in response to the respective arbitration requests. The data items are buffered, and arbitration is performed on the buffered data items responsively to the arbitration requests. The buffered data items are served to the destination in accordance with the arbitration.
There is also provided, in accordance with an embodiment of the present invention, a network switch including multiple input ports and arbitration circuitry. The input ports are configured to send to an output port data items and respective arbitration requests, such that the data items are sent to the output port regardless of receiving any indication that the data items were served to the output port in response to the respective arbitration requests. The arbitration circuitry is configured to receive and buffer the data items, to perform arbitration on the buffered data items responsively to the arbitration requests, and to serve the buffered data items to the output port in accordance with the arbitration.
The present invention will be more fully understood from the following detailed description of the embodiments thereof, taken together with the drawings in which:
In various data processing applications, multiple data sources send data items to a common destination that is able to receive only a single data item at a time. A network switch, for example, may send communication packets from multiple input ports to a certain output port. The data items may be served to the destination one at a time using a suitable arbitration scheme.
In many practical implementations, however, the propagation delay between the data sources and the destination is large. Conventional arbitration schemes, in which the data sources exchange arbitration requests and grants with the arbiter before sending the data items, are highly inefficient in the presence of large propagation delays.
Embodiments of the present invention that are described herein provide improved methods and systems for arbitration and flow control, which are particularly suitable for large propagation delays between the data sources and the destination. In the disclosed embodiments, the data sources send the arbitration requests together with the data items, without waiting for arbitration grants.
Arbitration circuitry, which is associated with the common destination, receives and buffers the data items, and serves the buffered data items to the destination in accordance with a suitable arbitration scheme. The arbitration circuitry may comprise, for example, multiple First-In First-Out memories (FIFOs) for buffering the data items arriving from the respective data sources. The arbitration circuitry may send arbitration grants to the data sources upon serving the data items, but the data sources typically use the grants for internal management and not as a condition for sending the data items.
In some embodiments, the data sources and the arbitration circuitry use a credit-based flow control mechanism for regulating the transfer of data items. The credit-based flow control mechanism is typically decoupled from the arbitration scheduling.
By sending the data items together with the arbitration requests, the end-to-end latency of processing the data items is reduced considerably. As a result, performance figures such as delay and throughput can be improved considerably.
In the embodiments described herein, IC 20 comprises a network switch IC, sources 24 comprise input ports of the switch, destination 28 comprises an output port of the switch, and the data comprises packets or messages that are forwarded from the input ports to the output port. Alternatively, however, the disclosed techniques can be used in any other suitable device or system in which multiple sources send data to a common destination, such as in Network Interface Cards (NICs).
In the present example, the propagation delay between sources 24 and destination 28 in IC 20 is large, e.g., on the order of ten to thirty clock cycles. This delay may be due to various reasons, such as because of registers, buffers, samplers, multiplexers or other circuit elements traversed by the data along the route. In the present example, the data exchanged between the sources and destination is sampled along the route by one or more samplers 32 in order to meet the clock frequency and timing requirements.
In some embodiments, IC 20 comprises a buffering and arbitration unit 36, which buffers the data arriving from sources 24, performs arbitration over the buffered data, and serves the arbitrated data to destination 28. In the example of
In some embodiments, unit 36 uses a credit-based mechanism to control the flow of data items from sources 24. In these embodiments, each source 24 maintains a respective Credit Counter (CC) 48 that holds the current credit available to the source for sending data items. The source sends the next data item only if there is sufficient credit remaining in its CC. The source decrements the CC for each sent data item.
When a data item is removed from the corresponding FIFO 40 in unit 36 and served to destination 28, unit 36 sends a credit update (“CREDIT++”) back to the source. The credit update may be implemented, for example, using a signal that can be asserted and de-asserted by unit 36, or using a dedicated message. Upon receiving the credit update, the source increments the CC. The credit updates may undergo similar sampling or other processing (and thus similar delay) as the data items.
The credit-based flow control mechanism between sources 24 and unit 36 is typically decoupled from the arbitration mechanism: Data items are transferred from sources 24 to FIFOs 40 regardless of the arbitration resolution.
The IC configuration shown in
The elements of IC 20 may be implemented using hardware/firmware, such as in an Application-Specific Integrated Circuit (ASIC) or Field-Programmable Gate Array (FPGA). Alternatively, some IC elements may be implemented in software or using a combination of hardware/firmware and software elements. For example, the arbiter may be implemented by triggering an interrupt to a Central Processing Unit (CPU) that carries out the arbitration policy in software or firmware.
The long propagation delay in IC 20 between sources 24 and destination 28 may cause considerable performance degradation unless accounted for. Consider, for example, a scheme in which each source sends an arbitration request for each data item, and sends the data item to the destination only after receiving an arbitration grant from the arbiter. The arbitration request and grant are typically subject to the same propagation delay as the data.
In such a scheme, each data item is delayed by at least three times the propagation delay between the source and destination (one propagation delay for sending the arbitration request, another for receiving the arbitration grant, and another for sending the data item). When the propagation delay is large, this sort of solution will degrade the latency and throughput performance of the IC considerably.
In some embodiments, the disclosed techniques overcome the long propagation delay by sending each data item together with the corresponding arbitration request. The term “together” can mean in the same message or in separate messages but within a small time frame. In any case, source 24 sends the data without waiting for an arbitration grant. FIFOs 40 buffer the data items received from the respective sources 24, and arbiter 44 arbitrates the data items buffered in the FIFos. (When a certain FIFO is empty, unit 36 may bypass the FIFO and serve an incoming data item directly to the arbiter.)
Unit 36 typically sends an arbitration grant for each data item that is served to the destination, but sources 24 do not use the arbitration grants as a condition for sending the data. Therefore, a data item will typically be sent from the source, and arrive in unit 36, before the source has received the arbitration grant for that data item.
When using the above scheme, the propagation delay of the arbitration request is concurrent with the propagation delay of the data. Moreover, the propagation delay of the arbitration grant and the arbitration processing time do not affect the total delay. As a result, the total delay applied to the data is shortened considerably and the IC performance is therefore improved. In a network switch application, for example, the switch latency is reduced and data throughput (bandwidth) is increased.
The size of FIFOs 40 is typically determined by the round-trip delay between sources 24 and destination 28, plus the maximum or average arbitration processing time of arbiter 44. In a typical application, FIFOs 40 are small, e.g., on the order of 10-100 entries. Unlike conventional output buffers of network switches, FIFOs 40 are not required to account for data congestion or other network effects, and their sole purpose is to account for the round-trip delay and arbitration processing within the IC.
FIFOs 40 in unit 36 buffer the data items and arbitration requests, at a buffering step 54. Arbiter 44 arbitrates the buffered data items in accordance with the arbitration requests, at an arbitration step 58. In some embodiments, for each data item that is served to destination 28, unit 36 sends an arbitration grant to the corresponding source. Unit 36 sends credit updates to sources 24, one credit update per each data item that is served to destination 28, and the sources update their credit counters accordingly, at a credit update step 62.
In some embodiments, unit 36 uses the received data items themselves as implicit arbitration requests, without a need for sources 24 to send explicit arbitration requests together with the data items.
In some embodiments, a given source 24 divides a data item (e.g., packet) into multiple data chunks. The data chunks are sent separately and buffered separately in FIFO 40, but the entire data item is arbitrated and served en-bloc to destination 28. In this embodiment, the source sends a single arbitration request for the entire data item, usually together with the first chunk. In response, unit 36 returns a single arbitration grant.
In some embodiments, the credit-based flow control mechanism eliminates the need for arbitration grants. In these embodiments, unit 36 does not send arbitration grants, and the transfer of data items is managed exclusively using the credit mechanism. In alternative embodiments, unit 36 sends arbitration grants, which the sources use for internal status monitoring or other management purposes.
Although the embodiments described herein mainly address network switches, e.g., for Infiniband or Ethernet networks, the methods and systems described herein can also be used in other applications that involve sending data from multiple sources to a common destination. For example, in some NICs (e.g., Infiniband Host Channel Adapters (HCAs)) data is gathered from multiple sources for sending over an output port. Although the embodiments described herein refer mainly to implementation within a single IC, the disclosed techniques are not limited to single-IC applications, and can be used, for example, at the device, board or system level.
It will thus be appreciated that the embodiments described above are cited by way of example, and that the present invention is not limited to what has been particularly shown and described hereinabove. Rather, the scope of the present invention includes both combinations and sub-combinations of the various features described hereinabove, as well as variations and modifications thereof which would occur to persons skilled in the art upon reading the foregoing description and which are not disclosed in the prior art. Documents incorporated by reference in the present patent application are to be considered an integral part of the application except that to the extent any terms are defined in these incorporated documents in a manner that conflicts with the definitions made explicitly or implicitly in the present specification, only the definitions in the present specification should be considered.
Number | Name | Date | Kind |
---|---|---|---|
5367520 | Cordell | Nov 1994 | A |
5440752 | Lentz | Aug 1995 | A |
5574885 | Denzel et al. | Nov 1996 | A |
5802057 | Duckwall | Sep 1998 | A |
5924119 | Sindhu | Jul 1999 | A |
6160814 | Ren et al. | Dec 2000 | A |
6169741 | LeMaire et al. | Jan 2001 | B1 |
6195721 | Rice | Feb 2001 | B1 |
6314487 | Hahn | Nov 2001 | B1 |
6438130 | Kagan et al. | Aug 2002 | B1 |
6456590 | Ren et al. | Sep 2002 | B1 |
6463484 | Moss | Oct 2002 | B1 |
6535963 | Rivers | Mar 2003 | B1 |
6539024 | Janoska et al. | Mar 2003 | B1 |
6606666 | Bell et al. | Aug 2003 | B1 |
6687256 | Modali et al. | Feb 2004 | B2 |
6700871 | Harper et al. | Mar 2004 | B1 |
6788701 | Mahalingaiah et al. | Sep 2004 | B1 |
6831918 | Kavak | Dec 2004 | B1 |
6895015 | Chiang et al. | May 2005 | B1 |
6922408 | Bloch et al. | Jul 2005 | B2 |
7088713 | Battle et al. | Aug 2006 | B2 |
7136381 | Battle et al. | Nov 2006 | B2 |
7243177 | Davis et al. | Jul 2007 | B1 |
7327749 | Mott | Feb 2008 | B1 |
7590058 | Cherchali et al. | Sep 2009 | B1 |
7609636 | Mott | Oct 2009 | B1 |
7650424 | Armitage | Jan 2010 | B2 |
7724760 | Balakrishnan et al. | May 2010 | B2 |
7773622 | Schmidt et al. | Aug 2010 | B2 |
7796629 | MacAdam et al. | Sep 2010 | B1 |
7853738 | Pothireddy et al. | Dec 2010 | B2 |
7936770 | Frattura et al. | May 2011 | B1 |
8014288 | MacAdam | Sep 2011 | B1 |
8149710 | Bergamasco et al. | Apr 2012 | B2 |
8175094 | Bauchot et al. | May 2012 | B2 |
8270295 | Kendall et al. | Sep 2012 | B2 |
8274971 | Battle et al. | Sep 2012 | B2 |
8570916 | Tang et al. | Oct 2013 | B1 |
8660137 | Aloni et al. | Feb 2014 | B2 |
20010023469 | Jeong | Sep 2001 | A1 |
20020012340 | Kalkunte et al. | Jan 2002 | A1 |
20020027908 | Kalkunte et al. | Mar 2002 | A1 |
20020039357 | Lipasti et al. | Apr 2002 | A1 |
20030026287 | Mullendore et al. | Feb 2003 | A1 |
20030048792 | Xu et al. | Mar 2003 | A1 |
20030053474 | Tuck et al. | Mar 2003 | A1 |
20030076849 | Morgan et al. | Apr 2003 | A1 |
20030095560 | Arita et al. | May 2003 | A1 |
20030118016 | Kalkunte et al. | Jun 2003 | A1 |
20030137939 | Dunning et al. | Jul 2003 | A1 |
20030198231 | Kalkunte et al. | Oct 2003 | A1 |
20030198241 | Putcha et al. | Oct 2003 | A1 |
20030200330 | Oelke et al. | Oct 2003 | A1 |
20040008716 | Stiliadis | Jan 2004 | A1 |
20040066785 | He et al. | Apr 2004 | A1 |
20040090974 | Balakrishnan et al. | May 2004 | A1 |
20050259574 | Figueira et al. | Nov 2005 | A1 |
20060155938 | Cummings et al. | Jul 2006 | A1 |
20060159104 | Nemirovsky et al. | Jul 2006 | A1 |
20060182112 | Battle et al. | Aug 2006 | A1 |
20070025242 | Tsang | Feb 2007 | A1 |
20070038829 | Tousek | Feb 2007 | A1 |
20070070901 | Aloni et al. | Mar 2007 | A1 |
20070201497 | Krishnamurthy | Aug 2007 | A1 |
20080031269 | Shimizu et al. | Feb 2008 | A1 |
20080043768 | Lopez et al. | Feb 2008 | A1 |
20090003212 | Kwan et al. | Jan 2009 | A1 |
20090010162 | Bergamasco et al. | Jan 2009 | A1 |
20090161684 | Voruganti et al. | Jun 2009 | A1 |
20100100670 | Jeddeloh | Apr 2010 | A1 |
20110058571 | Bloch et al. | Mar 2011 | A1 |
20110075555 | Ziegler | Mar 2011 | A1 |
20110286468 | Tomonaga et al. | Nov 2011 | A1 |
20120002678 | Jonsson et al. | Jan 2012 | A1 |
20120105637 | Yousefi et al. | May 2012 | A1 |
20130028256 | Koren et al. | Jan 2013 | A1 |
20130077489 | Bloch et al. | Mar 2013 | A1 |
20150363166 | Christidis | Dec 2015 | A1 |
Number | Date | Country |
---|---|---|
1698976 | Sep 2006 | EP |
03024033 | Mar 2003 | WO |
Entry |
---|
Concer, N.; Bononi, L.; Soulie, M.; Locatelli, R.; Carloni, L.P., “The Connection-Then-Credit Flow Control Protocol for Heterogeneous Multicore Systems-on-Chip,” Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on , vol. 29, No. 6, pp. 869,882, Jun. 2010. |
Radulescu, A.; Dielissen, J.; Pestana, S.G.; Gangwal, O.P.; Rijpkema, E.; Wielage, P.; Goossens, K., “An efficient on-chip NI offering guaranteed services, shared-memory abstraction, and flexible network configuration,” Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on , vol. 24, No. 1, pp. 4,17, Jan. 2005. |
U.S. Appl. No. 12/876,265 Office Action dated May 1, 2013. |
Raatikainen, P., “ATM Switches—Switching Technology S38.3165”, Switching Technology, L8-1, 34 pages, year 2006 (http://www.netlab.hut.fi/opetus/s383165). |
Fahmy, S., “A Survey of ATM Switching Techniques”, Department of Computer and Information Science, The Ohio State University, USA, 22 pages, Aug. 21, 1995 (http://www.cs.purdue.edu/homes/fahmy/cis788.08Q/atmswitch.html). |
U.S. Appl. No. 13/189,593 Office Action dated Jul. 9, 2013. |
Cisco Nexus 3548 and 3524 Switches Data Sheet, Cisco Nexus 3000 Series Switches Overview, Cisco systems Inc., San Jose, California, pp. 1-14, 2013. |
U.S. Appl. No. 14/046,976, filed Oct. 6, 2013. |
U.S. Appl. No. 13/802,926, filed Mar. 14, 2013. |
U.S. Appl. No. 13/972,968, filed Aug. 22, 2013. |
Infiniband Trade Association, “Infiniband Architecture Specification”, vol. 1, release 1.2.1, Nov. 2007. |
IEEE Std 802.3™-2008/Cor Jan. 2009, “IEEE Standard for Information technology—Telecommunications and information exchange between systems—Local and metropolitan area networks—Specific requirements Part 3: Carrier Sense Multiple Access with Collision Detection (CSMA/CD) Access Method and Physical Layer Specifications Corrigendum 1: Timing Considerations for PAUSE Operation”, 12 pages, Dec. 9, 2009. |
Desanti, C., “802.1Qbb—IEEE Standard for Local and Metropolitan Area Networks—Virtual Bridged Local Area Networks—Amendment: Priority-based Flow Control”, Sep. 14, 2008. |
U.S. Appl. No. 13/972,968 Office Action dated Apr. 8, 2015. |
U.S. Appl. No. 13/972,968 Office Action dated Oct. 22, 2015. |
U.S. Appl. No. 13/972,968 Office Action dated Apr. 8, 2016. |
U.S. Appl. No. 13/972,968 Office Action dated Nov. 29, 2016. |
Number | Date | Country | |
---|---|---|---|
20140229645 A1 | Aug 2014 | US |