A portion of the disclosure of this patent document contains material that is subject to copyright protection. The copyright owner has no objection to the facsimile reproduction by anyone of the patent document or the patent disclosure, as it appears in the Patent and Trademark Office patent file or records, but otherwise reserves all copyright rights whatsoever.
1. Field of the Invention
This invention relates to network arrangements and protocols for real-time communications. More particularly, this invention relates to organizing the transmission of messages in a fabric.
2. Description of the Related Art
The meanings of certain acronyms and abbreviations used herein are given in Table 1.
Message Passing Interface (MPI) is a communication protocol that is widely used for exchange of messages among processes in high-performance computing (HPC) systems. The current MPI standard is published by the MPI Forum as the document MPI: A Message-Passing Interface Standard, Ver. 3.1; Jun. 4, 2015, which is available on the Internet and is herein incorporated by reference.
MPI supports collective communication in accordance with to a message-passing parallel programming model, in which data is moved from the address space of one process to that of another process through cooperative operations on each process in a process group. MPI provides point-to-point and collective operations that can be used by applications. These operations are associated with a defined object called a communicator. Communicators provide a mechanism to construct distinct communication spaces in which process groups can operate. Each process group is associated with a communicator and has a communicator identifier that is unique with respect to all processes inside the communicator. There is a default communicator that contains all the processes in an MPI job, which is called MPI_COMM_WORLD.
Typically high performance computing (HPC) systems contains thousands of nodes, each having tens of cores. It is common in MPI to bind each process to a core. When launching an MPI job, the user specifies the number of processes to allocate for the job. These processes are distributed among the different nodes in the system. The MPI operations alltoall and alltoallv are some of the collective operations (sometimes referred to herein as “collectives”) supported by MPI. These collective operations scatter or gather data from all members to all members of a process group. In the operation alltoall, each process in the communicator sends a fixed-size message to each of the other processes. The operation alltoallv is similar to the operation alltoall, but the messages may differ in size.
Typically, MPI jobs allocate thousands of processes, spread between thousands of nodes. The number of nodes in an MPI job is denoted as N, and the number of processes in the MPI job as P, which leads to a total number of N*P processes. Thus, in alltoall (or alltoallv) collectives between N*P processes of the MPI job, each process sends (N−1)*P messages to the other different processes. Therefore, each node outputs (N−1)*P{circumflex over ( )}2 messages to the network, leading to a total number of N*(N−1)*P{circumflex over ( )}2 messages in the fabric.
Assuming the value of N to be in the thousands and P in the tens, the number of messages in the fabric creates network congestion and incurs overhead in posting them to the network interface. The overhead becomes especially significant when the message payload is small, as each message requires both MPI and transport headers. Some MPI software implementations attempt to moderate the number of messages, but still do not make optimal use of the bandwidth of the fabric.
According to embodiments of the invention, network interface controllers (NICs) perform aggregation and disaggregation at the network interface of the different messages to the different processes in MPI alltoall and alltoallv collectives. The NIC aggregates all of the messages destined to each of the processes in the remote nodes from all of the processes on its local node. In addition, when receiving an alltoall message, the NIC disaggregates the message for distribution to the respective processes in the local node. Enabling aggregation and disaggregation in the NIC reduces by a factor of P{circumflex over ( )}2 the number of messages in the fabric in an alltoall collective operation. This leads to better utilization of the fabric bandwidth, since only one transport header is needed. Since fewer messages are posted, there is less I/O overhead.
There is provided according to embodiments of the invention a method of communication, which is carried out in a fabric of network elements including an initiator node and responder nodes, initiating in the initiator node, an MPI (message passing interface) collective operation. The collective operation is conducted by transmitting MPI messages from all the initiator processes in the initiator node to designated ones of the responder processes in respective responder nodes. The method is further carried out by combining respective payloads of the MPI messages in a network interface device of the initiator node to form an aggregated MPI message, transmitting the aggregated MPI message through the fabric to the responder nodes, in respective network interface devices of the responder nodes disaggregating the aggregated MPI message into individual messages, and distributing the individual messages to the designated ones of the responder processes.
According to one aspect of the method, the aggregated MPI message has exactly one transport header that includes a destination address of the aggregated MPI message.
According to a further aspect of the method, the MPI messages comprise respective MPI headers indicating designated responder processes, and the designated responder processes are referenced in an MPI communicator object.
According to yet another aspect of the method, initiating an MPI collective operation includes forwarding by a communication library the MPI communicator object and the payloads to the network interface device of the initiator node.
Still another aspect of the method includes maintaining a communicator context in the network interface device of the initiator node, wherein transmitting the aggregated MPI message includes directing the aggregated MPI message to local identifiers (LIDs) in the responder nodes according to the communicator context.
An additional aspect of the method includes forming the aggregated MPI message by assembling pointers to message data, and including respective local identifier addresses for the message data in the aggregated MPI message.
There is further provided according to embodiments of the invention a communication apparatus, including a fabric of network elements including an initiator node executing initiator processes and responder nodes executing respective responder processes. The initiator node is configured for initiating an MPI collective operation that is conducted by transmitting MPI messages through the fabric from all the initiator processes to designated responder processes. A first network interface device in the initiator node has first communicator controller circuitry configured for combining respective payloads of the MPI messages to form an aggregated MPI message. Respective second network interface devices in the responder nodes have second communicator controller circuitry configured for disaggregating the aggregated MPI message into individual messages. The responder nodes are operative for distributing the individual messages to the designated responder processes.
According to another aspect of the apparatus, the first communicator controller circuitry is operative for forming the aggregated MPI message by assembling pointers to message data, and including respective local identifier addresses for the message data in the aggregated MPI message.
In one aspect of apparatus the first network interface device apparatus is operative for maintaining a communicator context and transmitting the aggregated MPI message by directing the aggregated MPI message to local identifiers (LIDs) in the responder nodes according to the communicator context.
For a better understanding of the present invention, reference is made to the detailed description of the invention, by way of example, which is to be read in conjunction with the following drawings, wherein like elements are given like reference numerals, and wherein:
In the following description, numerous specific details are set forth in order to provide a thorough understanding of the various principles of the present invention. It will be apparent to one skilled in the art, however, that not all these details are necessarily always needed for practicing the present invention. In this instance, well-known circuits, control logic, and the details of computer program instructions for conventional algorithms and processes have not been shown in detail in order not to obscure the general concepts unnecessarily.
Documents incorporated by reference herein are to be considered an integral part of the application except that, to the extent that any terms are defined in these incorporated documents in a manner that conflicts with definitions made explicitly or implicitly in the present specification, only the definitions in the present specification should be considered.
Definitions.
A “switch fabric” or “fabric” refers to a network topology in which network nodes interconnect via one or more network switches (such as crossbar switches), typically through many ports. The interconnections are configurable such that data is transmitted from one node to another node via designated ports. A common application for a switch fabric is a high performance backplane.
System Architecture.
Reference is now made to
Reference is now made to
Reference is now made to
At initial step 40 an MPI alltoall or alltoallv collective operation is initiated by the host (not shown) of NIC 28. Next, at step 42 processes 36 (P_1 through P_P) commit their entire payloads to NIC 28. The payloads in this context are composed of all of the messages (including MPI headers) originated by the processes 36 to other processes in the communicator. These messages are referred to herein as “MPI messages”.
After all local processes in the communicator have committed their alltoall payloads, at step 44 NIC 28 assembles a single message to each of the nodes in the communicator, referred to herein as an aggregated message. Reference is now made to
Reverting to
Reference is now made to
Any number of MPI processes 66 execute in the node 62. In this example all the MPI processes 66 are members of the same communicator. Instances of a communication software library 68 translate MPI commands of the MPI processes 66 into corresponding driver commands for a NIC driver 70. In an InfiniBand implementation, the MPI processes 66 translate the MPI commands into InfiniBand verb functions. The NIC driver 70 itself is a software library, which translates the driver commands issued by the library 68 into hardware commands that are acceptable to a network interface card 72. In an InfiniBand implementation the commands may be work queue elements (WQEs). Data aggregation and disaggregation (steps 44, 58;
Reference is now made to
Reference is now made to
Reference is now made to
Next, at step 140 the communicator contexts 116, 118, 120 are initialized on their respective NICs 104, 106, 108, with the corresponding fields that describe the communicator and are associated with respective queue pairs. For example, on LID 7 in NIC 104, the local MPI process queue pairs are queue pairs 122, 124 and the remote LIDs are LID 5 and LID 12 in NIC 106108, respectively. LID 12 in NIC 108 contains two MPI processes 100, 102.
Next, at step 142 the MPI alltoall function is invoked by all of the local MPI processes of the node 86.
Next, at step 144 the communicator and the alltoall payload are forwarded to the NIC 104 by the communication library. In an Infiniband implementation, step 144 is comprises posting work queue element 126 to queue pair 122, 124, which, as noted above, includes data pointer 128 to the payload data in block 130. In the example of
Next, at delay step 146 the NCCs 110, 112, 114 in the NICs 104, 106, 108 wait for all of the MPI processes to commit their alltoall payloads. For example, NIC 104 waits for queue pair 122, 124 to post the work queue element 126.
After all local processes have committed their data, at step 148 the NCC 110 assembles the data pointers and creates a single aggregated message, which is directed to the LIDS in the remote NICs 106, 108 according to the communicator context. The NCC 110 is aware of the organization of the alltoall data, and thus which data belong to which LID. In an InfiniBand implementation, the NCC 110 may use a different queue pair from the queue pairs of the local processes to transmit the data. The NCC 110 may also add an extra header to the aggregated message in order to identify the communicator on which the alltoall operation is performed.
In the above example, queue pair 132 is used to send the data, and the message transfer comprises two messages: one message to LID 5 in NIC 106 containing alltoall data for remote process 98 and one message to LID 12 in NIC 108 containing alltoall data for the remote process 100, 102.
The aggregated message is transmitted at step 150 When the aggregated message arrives at its destinations, the communicator contexts 118, 120 are fetched again at step 152 by the receiving NCCs 112, 114, respectively. The NCCs 112, 114 are aware of the order of the alltoall payload of the aggregated message.
Then, at final step 154 the NCCs 112, 114 disaggregate the aggregated message and scatter the data to the MPI processes according to the communicator contexts 118, 120, respectively. In above example, the NCC 114 in NIC 108 breaks the message into two parts, and scatters the first half to queue pair 134 (Qp 4) and the second half to queue pair 136 (Qp 5).
It will be appreciated by persons skilled in the art 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 that are not in the prior art, which would occur to persons skilled in the art upon reading the foregoing description.
This Application claims the benefit of U.S. Provisional Application No. 62/304,355, filed 7 Mar. 2016, which is herein incorporated by reference.
Number | Name | Date | Kind |
---|---|---|---|
4933969 | Marshall | Jun 1990 | A |
5068877 | Near et al. | Nov 1991 | A |
5325500 | Bell et al. | Jun 1994 | A |
5353412 | Douglas et al. | Oct 1994 | A |
5404565 | Gould et al. | Apr 1995 | A |
5606703 | Brady et al. | Feb 1997 | A |
6041049 | Brady | Mar 2000 | A |
6507562 | Kadansky et al. | Jan 2003 | B1 |
6857004 | Howard et al. | Feb 2005 | B1 |
6937576 | Di Benedetto et al. | Aug 2005 | B1 |
7102998 | Golestani | Sep 2006 | B1 |
7124180 | Ranous | Oct 2006 | B1 |
7171484 | Krause et al. | Jan 2007 | B1 |
7555549 | Campbell et al. | Jun 2009 | B1 |
7613774 | Caronni et al. | Nov 2009 | B1 |
8213315 | Crupnicoff et al. | Jul 2012 | B2 |
8761189 | Shachar et al. | Jun 2014 | B2 |
8811417 | Bloch et al. | Aug 2014 | B2 |
9110860 | Shahar | Aug 2015 | B2 |
9344490 | Bloch et al. | May 2016 | B2 |
9563426 | Bent | Feb 2017 | B1 |
20020010844 | Noel et al. | Jan 2002 | A1 |
20020035625 | Tanaka | Mar 2002 | A1 |
20020150094 | Cheng et al. | Oct 2002 | A1 |
20020150106 | Kagan et al. | Oct 2002 | A1 |
20020152315 | Kagan et al. | Oct 2002 | A1 |
20020152327 | Kagan et al. | Oct 2002 | A1 |
20020152328 | Kagan et al. | Oct 2002 | A1 |
20030018828 | Craddock et al. | Jan 2003 | A1 |
20030061417 | Craddock et al. | Mar 2003 | A1 |
20030065856 | Kagan et al. | Apr 2003 | A1 |
20040062258 | Grow et al. | Apr 2004 | A1 |
20040078493 | Blumrich et al. | Apr 2004 | A1 |
20040120331 | Rhine et al. | Jun 2004 | A1 |
20040123071 | Stefan et al. | Jun 2004 | A1 |
20040252685 | Kagan et al. | Dec 2004 | A1 |
20050097300 | Gildea et al. | May 2005 | A1 |
20050122329 | Janus | Jun 2005 | A1 |
20050129039 | Biran et al. | Jun 2005 | A1 |
20050131865 | Jones et al. | Jun 2005 | A1 |
20080126564 | Wilkinson | May 2008 | A1 |
20080168471 | Benner et al. | Jul 2008 | A1 |
20080288949 | Bohra et al. | Nov 2008 | A1 |
20090037377 | Archer et al. | Feb 2009 | A1 |
20090063816 | Arimilli et al. | Mar 2009 | A1 |
20090182814 | Tapolcai et al. | Jul 2009 | A1 |
20090247241 | Gollnick et al. | Oct 2009 | A1 |
20090292905 | Faraj | Nov 2009 | A1 |
20100049836 | Kramer | Feb 2010 | A1 |
20100074098 | Zeng et al. | Mar 2010 | A1 |
20110258245 | BlockSome et al. | Oct 2011 | A1 |
20120063436 | Thubert et al. | Mar 2012 | A1 |
20120117331 | Krause et al. | May 2012 | A1 |
20130159410 | Lee | Jun 2013 | A1 |
20140211804 | Makikeni | Jul 2014 | A1 |
20150193271 | Archer | Jul 2015 | A1 |
20150269116 | Raikin et al. | Sep 2015 | A1 |
20160105494 | Reed | Apr 2016 | A1 |
20160299872 | Vaidyanathan et al. | Oct 2016 | A1 |
20170063613 | Bloch et al. | Mar 2017 | A1 |
Entry |
---|
U.S. Appl. No. 14/937,907 Office Action dated Jun. 19, 2017. |
U.S. Appl. No. 15/250,953 Office Action dated Nov. 2, 2018. |
Mellanox Technologies, “InfiniScale IV: 36-port 40GB/s Infiniband Switch Device”, 2 pages, 2009. |
Mellanox Technologies Inc., “Scaling 10Gb/s Clustering at Wire-Speed”, 8 pages, 2006. |
IEEE 802.1D Standard “IEEE Standard for Local and Metropolitan Area Networks—Media Access Control (MAC) Bridges”, IEEE Computer Society, 281 pages, Jun. 9, 2004. |
IEEE 802.1AX Standard “IEEE Standard for Local and Metropolitan Area Networks—Link Aggregation”, IEEE Computer Society, 163 pages, Nov. 3, 2008. |
Turner et al., “Multirate Clos Networks”, IEEE Communications Magazine, 11 pages, Oct. 2003. |
Thayer School of Engineering, “An Slightly Edited Local Copy of Elements of Lectures 4 and 5”, Dartmouth College, 5 pages, Jan. 15, 1998 hittp://people.seas.harvard.edu/˜jones/cscie129/nu_lectures/lecture11/switching/clos_network/clos_network.html. |
“MPI: A Message-Passing Interface Standard,” Message Passing Interface Forum, version 3.1, 868 pages, Jun. 4, 2015. |
Coti et al., “MPI Applications on Grids: a Topology Aware Approach,” Proceedings of the 15th International European Conference on Parallel and Distributed Computing (EuroPar'09), 12 pages, Aug. 2009. |
Petrini et al., “The Quadrics Network (QsNet): High-Performance Clustering Technology,” Proceedings of the 9th IEEE Symposium on Hot Interconnects (HotI'01), 6 pages, Aug. 2001. |
Sancho et al., “Efficient Offloading of Collective Communications in Large-Scale Systems,” Proceedings of the 2007 IEEE International Conference on Cluster Computing, 10 pages, Sep. 17-20, 2007. |
Infiniband Trade Association, “InfiniBand™ Architecture Specification”, release 1.2.1, 1727 pages, Jan. 2008. |
U.S. Appl. No. 15/250,953 Office Action dated Feb. 15, 2018. |
Deming, “Infiniband Architectural Overview”, Storage Developer Conference, pp. 1-70, year 2013. |
Fugger et al., “Reconciling fault-tolerant distributed computing and systems-on-chip”, Distributed Computing, vol. 24, Issue 6, pp. 323-355, Jan. 2012. |
Wikipedia, “System on a chip”, pp. 1-4, Jul. 6, 2018. |
Villavieja et al., “On-chip Distributed Shared Memory”, Computer Architecture Department, pp. 1-10, Feb. 3, 2011. |
Number | Date | Country | |
---|---|---|---|
20170255501 A1 | Sep 2017 | US |
Number | Date | Country | |
---|---|---|---|
62304355 | Mar 2016 | US |