Processing data communications messages with input/output control blocks

Processing data communications messages with an Input/Output Control Block (‘IOCB’) ring that includes a number of IOCBs characterized by a priority and arranged in sequential priority for serial operation, where processing the messages includes depositing message data in one or more IOCBs according to depositing criteria; processing, by a message processing module associated with an IOCB having a priority less than the present value of a state counter, the message data in the IOCB while a message processing module associated with an IOCB having a next priority waits; increasing, upon completion of processing the message data of the IOCB having a priority less than the present value of the state counter, the present value of the state counter to a value greater than the next priority; and processing, by the message processing module associated with the IOCB having the next priority, the message data in the IOCB.

BACKGROUND OF THE INVENTION

1. Field of the Invention

The field of the invention is data processing, or, more specifically, methods, apparatus, and products for processing data communications messages with IOCBs.

2. Description of Related Art

Parallel computing is an area of computer technology that has experienced advances. Parallel computing is the simultaneous execution of the same task (split up and specially adapted) on multiple processors in order to obtain results faster. Parallel computing is based on the fact that the process of solving a problem usually can be divided into smaller tasks, which may be carried out simultaneously with some coordination.

Parallel computers execute parallel algorithms. A parallel algorithm can be split up to be executed a piece at a time on many different processing devices, and then put back together again at the end to get a data processing result. Some algorithms are easy to divide up into pieces. Splitting up the job of checking all of the numbers from one to a hundred thousand to see which are primes could be done, for example, by assigning a subset of the numbers to each available processor, and then putting the list of positive results back together. In this specification, the multiple processing devices that execute the individual pieces of a parallel program are referred to as ‘compute nodes.’ A parallel computer is composed of compute nodes and other processing nodes as well, including, for example, input/output (‘I/O’) nodes, and service nodes.

Parallel algorithms are valuable because it is faster to perform some kinds of large computing tasks via a parallel algorithm than it is via a serial (non-parallel) algorithm, because of the way modern processors work. It is far more difficult to construct a computer with a single fast processor than one with many slow processors with the same throughput. There are also certain theoretical limits to the potential speed of serial processors. On the other hand, every parallel algorithm has a serial part and so parallel algorithms have a saturation point. After that point adding more processors does not yield any more throughput but only increases the overhead and cost.

Parallel algorithms are designed also to optimize one more resource the data communications requirements among the nodes of a parallel computer. There are two ways parallel processors communicate, shared memory or message passing. Shared memory processing needs additional locking for the data and imposes the overhead of additional processor and bus cycles and also serializes some portion of the algorithm.

Message passing processing uses high-speed data communications networks and message buffers, but this communication adds transfer overhead on the data communications networks as well as additional memory need for message buffers and latency in the data communications among nodes. Designs of parallel computers use specially designed data communications links so that the communication overhead will be small but it is the parallel algorithm that decides the volume of the traffic.

Many data communications network architectures are used for message passing among nodes in parallel computers. Compute nodes may be organized in a network as a ‘torus’ or ‘mesh,’ for example. Also, compute nodes may be organized in a network as a tree. A torus network connects the nodes in a three-dimensional mesh with wrap around links. Every node is connected to its six neighbors through this torus network, and each node is addressed by its x,y,z coordinate in the mesh. In such a manner, a torus network lends itself to point to point operations. In a tree network, the nodes typically are connected into a binary tree: each node has a parent, and two children (although some nodes may only have zero children or one child, depending on the hardware configuration). Although a tree network typically is inefficient in point to point communication, a tree network does provide high bandwidth and low latency for certain collective operations, message passing operations where all compute nodes participate simultaneously, such as, for example, an allgather operation. In computers that use a torus and a tree network, the two networks typically are implemented independently of one another, with separate routing circuits, separate physical links, and separate message buffers.

As described above, data communications in a parallel computer may be carried out in a parallel fashion. In some instances, however, some data communications operations must be carried out serially with respect to other data communications operations. That is, one operation is dependent upon the output of another operation. What is needed, therefore, is a technique for serially processing data communications messages in a parallel computer.

SUMMARY OF THE INVENTION

Methods, apparatus, and products for processing data communications messages in a parallel computer with a plurality of Input/Output Control Blocks (‘IOCBs’). Each IOCB is characterized by a priority. The IOCBs are arranged in sequential priority for serial operations. Processing data communications messages in accordance with embodiments of the present invention includes depositing message data in one or more IOCBs according to depositing criteria for each IOCB; processing, by a message processing module associated with an IOCB having a priority less than the present value of a state counter, the message data in the IOCB while a message processing module associated with an IOCB having a next priority waits; increasing, upon completion of processing the message data of the IOCB having a priority less than the present value of the state counter, the present value of the state counter to a value greater than the next priority; and processing, by the message processing module associated with the IOCB having the next priority, the message data in the IOCB having the next priority.

DETAILED DESCRIPTION OF EXEMPLARY EMBODIMENTS

Exemplary methods, apparatus, and products for processing data communications messages with IOCBs in accordance with embodiments of the present invention are described with reference to the accompanying drawings, beginning withFIG. 1.FIG. 1illustrates an exemplary system for processing data communications messages with IOCBs according to embodiments of the present invention. The system ofFIG. 1includes a parallel computer (100), non-volatile memory for the computer in the form of data storage device (118), an output device for the computer in the form of printer (120), and an input/output device for the computer in the form of computer terminal (122). Parallel computer (100) in the example ofFIG. 1includes a plurality of compute nodes (102).

The compute nodes (102) are coupled for data communications by several independent data communications networks including a Joint Test Action Group (‘JTAG’) network (104), a global combining network (106) which is optimized for collective operations, and a torus network (108) which is optimized point to point operations. The global combining network (106) is a data communications network that includes data communications links connected to the compute nodes so as to organize the compute nodes as a tree. Each data communications network is implemented with data communications links among the compute nodes (102). The data communications links provide data communications for parallel operations among the compute nodes of the parallel computer. The links between compute nodes are bi-directional links that are typically implemented using two separate directional data communications paths.

In addition, the compute nodes (102) of parallel computer are organized into at least one operational group (132) of compute nodes for collective parallel operations on parallel computer (100). An operational group of compute nodes is the set of compute nodes upon which a collective parallel operation executes. Collective operations are implemented with data communications among the compute nodes of an operational group. Collective operations are those functions that involve all the compute nodes of an operational group. A collective operation is an operation, a message-passing computer program instruction that is executed simultaneously, that is, at approximately the same time, by all the compute nodes in an operational group of compute nodes. Such an operational group may include all the compute nodes in a parallel computer (100) or a subset all the compute nodes. Collective operations are often built around point to point operations. A collective operation requires that all processes on all compute nodes within an operational group call the same collective operation with matching arguments. A ‘broadcast’ is an example of a collective operation for moving data among compute nodes of an operational group. A ‘reduce’ operation is an example of a collective operation that executes arithmetic or logical functions on data distributed among the compute nodes of an operational group. An operational group may be implemented as, for example, an MPI ‘communicator.’

‘MPI’ refers to ‘Message Passing Interface,’ a prior art parallel communications library, a module of computer program instructions for data communications on parallel computers. Examples of prior-art parallel communications libraries that may be improved for use with systems according to embodiments of the present invention include MPI and the ‘Parallel Virtual Machine’ (‘PVM’) library. PVM was developed by the University of Tennessee, The Oak Ridge National Laboratory, and Emory University. MPI is promulgated by the MPI Forum, an open group with representatives from many organizations that define and maintain the MPI standard. MPI at the time of this writing is a de facto standard for communication among compute nodes running a parallel program on a distributed memory parallel computer. This specification sometimes uses MPI terminology for ease of explanation, although the use of MPI as such is not a requirement or limitation of the present invention.

Some collective operations have a single originating or receiving process running on a particular compute node in an operational group. For example, in a ‘broadcast’ collective operation, the process on the compute node that distributes the data to all the other compute nodes is an originating process. In a ‘gather’ operation, for example, the process on the compute node that received all the data from the other compute nodes is a receiving process. The compute node on which such an originating or receiving process runs is referred to as a logical root.

Most collective operations are variations or combinations of four basic operations: broadcast, gather, scatter, and reduce. The interfaces for these collective operations are defined in the MPI standards promulgated by the MPI Forum. Algorithms for executing collective operations, however, are not defined in the MPI standards. In a broadcast operation, all processes specify the same root process, whose buffer contents will be sent. Processes other than the root specify receive buffers. After the operation, all buffers contain the message from the root process.

In a scatter operation, the logical root divides data on the root into segments and distributes a different segment to each compute node in the operational group. In scatter operation, all processes typically specify the same receive count. The send arguments are only significant to the root process, whose buffer actually contains sendcount*N elements of a given data type, where N is the number of processes in the given group of compute nodes. The send buffer is divided and dispersed to all processes (including the process on the logical root). Each compute node is assigned a sequential identifier termed a ‘rank.’ After the operation, the root has sent sendcount data elements to each process in increasing rank order. Rank 0 receives the first sendcount data elements from the send buffer. Rank 1 receives the second sendcount data elements from the send buffer, and so on.

A gather operation is a many-to-one collective operation that is a complete reverse of the description of the scatter operation. That is, a gather is a many-to-one collective operation in which elements of a datatype are gathered from the ranked compute nodes into a receive buffer in a root node.

A reduce operation is also a many-to-one collective operation that includes an arithmetic or logical function performed on two data elements. All processes specify the same ‘count’ and the same arithmetic or logical function. After the reduction, all processes have sent count data elements from computer node send buffers to the root process. In a reduction operation, data elements from corresponding send buffer locations are combined pair-wise by arithmetic or logical operations to yield a single corresponding element in the root process's receive buffer. Application specific reduction operations can be defined at runtime. Parallel communications libraries may support predefined operations. MPI, for example, provides the following predefined reduction operations:

In addition to compute nodes, the parallel computer (100) includes input/output (‘I/O’) nodes (110,114) coupled to compute nodes (102) through the global combining network (106). The compute nodes in the parallel computer (100) are partitioned into processing sets such that each compute node in a processing set is connected for data communications to the same I/O node. Each processing set, therefore, is composed of one I/O node and a subset of compute nodes (102). The ratio between the number of compute nodes to the number of I/O nodes in the entire system typically depends on the hardware configuration for the parallel computer. For example, in some configurations, each processing set may be composed of eight compute nodes and one I/O node. In some other configurations, each processing set may be composed of sixty-four compute nodes and one I/O node. Such example are for explanation only, however, and not for limitation. Each I/O nodes provide I/O services between compute nodes (102) of its processing set and a set of I/O devices. In the example ofFIG. 1, the I/O nodes (110,114) are connected for data communications I/O devices (118,120,122) through local area network (‘LAN’) (130) implemented using high-speed Ethernet.

The parallel computer (100) ofFIG. 1also includes a service node (116) coupled to the compute nodes through one of the networks (104). Service node (116) provides services common to pluralities of compute nodes, administering the configuration of compute nodes, loading programs into the compute nodes, starting program execution on the compute nodes, retrieving results of program operations on the computer nodes, and so on. Service node (116) runs a service application (124) and communicates with users (128) through a service application interface (126) that runs on computer terminal (122).

As described in more detail below in this specification, the system ofFIG. 1operates generally for processing data communications messages with IOCBs according to embodiments of the present invention. In the system ofFIG. 1, one compute node (102) includes an Input/Output Control Block (‘IOCB’) ring (109) that in turn includes a number of IOCBs (111,113,115,117). An IOCB ring is an example arrangement of IOCBs for clarity of explanation. IOCBs useful in parallel computers that process message data in accordance with embodiments of the present invention may be arranged as a variety of structures including, for example, an array, a linked list, an array of pointers, and so on as will occur to readers of skill in the art. In the example ofFIG. 1, each IOCB is characterized by a priority. The IOCBs are arranged in sequential priority for serial operations.

Processing data communications messages with an IOCB ring in the system ofFIG. 1includes depositing message data in one or more of the IOCBs (111,113,115,117) in the IOCB ring (109) according to depositing criteria for each IOCB. Processing data communications messages may also include processing, by a message processing module associated with an IOCB (111,113,115,117) having a priority less than the present value of a state counter, the message data in the IOCB while a message processing module associated with an IOCB having a next priority waits. In some embodiments, the data in all IOCBs (111,113,115,117) is processed in parallel until processing encounters a dependency on the processing of an IOCB of lesser priority. The processing that encounters the dependency is halted until being freed by a change in the value of the state counter.

Processing data communications messages by the example compute node (102) ofFIG. 1may also include increasing, upon completion of processing the message data of the IOCB (111,113,115,117) having a priority less than the present value of the state counter, the present value of the state counter to a value greater than the next priority. The message processing module associated with the IOCB having the next priority, may then process the message data in the IOCB having the next priority. In this way, message processing modules associated with IOCBs having a priority less than present value of the state counter process the data in the associated IOCB, while data in other IOCBs may remain unprocessed. It said that data in other IOCBs may remain unprocessed because in some embodiments, processing of IOCBs, regardless of priority may be carried out in parallel prior to processing of one or more of the IOCBs encountering a dependency. In these embodiments, only upon encountering such a dependency will processing of an IOCB halt. Consider as an example of the first mentioned embodiment, that IOCBs (111and113) have a priority of one, while IOCBs (115and117) have a priority of two. When the state counter is set to two, message processing modules for IOCBs (111and113) operate, while message processing modules for IOCBs (115and117) wait. When the state counter is set to three, message processing modules for IOCBs (115and117) may begin processing data stored in IOCBs (115and117). Assuming the same priorities, in the second embodiment described above, when the state counter is set to two, message processing modules for all IOCBs (111,113,115, and117) may operate in parallel until the message processing modules for IOCBs (115and117) encounter a dependency. Upon encountering such a dependency the message processing modules for the IOCBs (115and117) halt operation until the state counter is set to three.

The arrangement of nodes, networks, and I/O devices making up the exemplary system illustrated inFIG. 1are for explanation only, not for limitation of the present invention. Data processing systems capable of processing data communications messages with IOCBs according to embodiments of the present invention may include additional nodes, networks, devices, and architectures, not shown inFIG. 1, as will occur to those of skill in the art. Although the parallel computer (100) in the example ofFIG. 1includes sixteen compute nodes (102), readers will note that parallel computers capable of processing data communications messages with IOCBs according to embodiments of the present invention may include any number of compute nodes. In addition to Ethernet and JTAG, networks in such data processing systems may support many data communications protocols including for example TCP (Transmission Control Protocol), IP (Internet Protocol), and others as will occur to those of skill in the art. Various embodiments of the present invention may be implemented on a variety of hardware platforms in addition to those illustrated inFIG. 1.

Processing data communications messages with IOCBs according to embodiments of the present invention may be generally implemented on a parallel computer that includes a plurality of compute nodes. In fact, such computers may include thousands of such compute nodes. Each compute node is in turn itself a kind of computer composed of one or more computer processors (or processing cores), its own computer memory, and its own input/output adapters. For further explanation, therefore,FIG. 2sets forth a block diagram of an exemplary compute node useful in a parallel computer capable of processing data communications messages with IOCBs according to embodiments of the present invention. The compute node (152) ofFIG. 2includes one or more processing cores (164) as well as random access memory (‘RAM’) (156). The processing cores (164) are connected to RAM (156) through a high-speed memory bus (154) and through a bus adapter (194) and an extension bus (168) to other components of the compute node (152). Stored in RAM (156) is an application program (158), a module of computer program instructions that carries out parallel, user-level data processing using parallel algorithms.

Also stored in RAM (156) is a messaging module (160), a library of computer program instructions that carry out parallel communications among compute nodes, including point to point operations as well as collective operations. Application program (158) executes collective operations by calling software routines in the messaging module (160). A library of parallel communications routines may be developed from scratch for use in systems according to embodiments of the present invention, using a traditional programming language such as the C programming language, and using traditional programming methods to write parallel communications routines that send and receive data among nodes on two independent data communications networks. Alternatively, existing prior art libraries may be improved to operate according to embodiments of the present invention. Examples of prior-art parallel communications libraries include the ‘Message Passing Interface’ (‘MPI’) library and the ‘Parallel Virtual Machine’ (‘PVM’) library.

The messaging module (160) ofFIG. 2has been adapted for processing data communications messages with IOCBs according to embodiments of the present invention. The example messaging module (160) ofFIG. 2includes an Input/Output Control Block (‘IOCB’) ring, one example arrangement among many possible arrangements of IOCBs useful for processing message data in accordance with embodiments of the present invention. The example IOCB ring ofFIG. 2includes two IOCBs (256,262). An IOCB is a data structure configured to store data to be processed. An IOCB (256,262) may be generated by an application (158), by a messaging module (160), or other module of automated computing machinery, for use in processing data communications messages in accordance with embodiments of the present application. An IOCB (256,262) may be generated by establishing, as an IOCB, a data structure including assigning the IOCB (256,264) a priority (258,264) and configuring the IOCB (256,264) to receive message data according to depositing criteria (270). The IOCBs (256,262) in the example ofFIG. 2may be established in a parallel computer, a non-parallel computer, or in other computing environments as will occur to readers of skill in the art.

Data may be stored in an IOCB in various ways including, for example, by storing pointers to memory address locations storing the data, by storing the actual data to be processed in the data structure, and in other ways as will occur to readers of skill in the art. In some embodiments, an IOCB is implemented as a list of memory addresses, with one or more of the memory addresses identifying a storage location of data to be processed. An IOCB ring is a set of ordered IOCBs in which each of the IOCBs includes, as a final address in the data structure, a pointer to the next IOCB in the ring, and the final IOCB in the ring includes a pointer to the first IOCB in the ring.

As mentioned above, each IOCB (256,262) in the example ofFIG. 2is characterized by a priority (258,264). The IOCBs (256,262) are arranged in sequential priority for serial operations. Consider for purposes of explanation, not limitation, that IOCB (256) has a priority (258) equal to one, while IOCB (262) has a priority (264) equal to two.

The messaging module (160) may process data communications messages with the IOCBs in the system ofFIG. 2in accordance with embodiments of the present invention by depositing message data (260,266) in one or more of the IOCBs (256,262) according to depositing criteria for each IOCB. Depositing criteria are rules that govern the storage of data in an IOCB. Such rules, may for example, specify that a particular size of data be stored in the IOCB, a particular number of data elements be stored in the IOCB, and so on as will occur to readers of skill in the art.

The messaging module (160) may also process data communications message by processing, by a message processing module (252) associated with an IOCB (256) having a priority (258) less than the present value of a state counter (268), the message data (260) in the IOCB while a message processing module (254) associated with an IOCB (262) having a next priority (264) waits. A message processing module (252,254) is a module of automated computing machinery configured to process data in an IOCB. IOCBs may be recycled after being processed. As such, a message processing module may be associated at various times with various IOCBs. Each message processing module (252,254) may be configured to perform various types of data processing. The message processing module (252,254) may be configured to carry out the data processing in a parallel manner, processing multiple entries of the IOCB at the same time, or serially, one entry at a time.

A state counter operates as a type of semaphore, locking message processing modules from operating. In some embodiments, the state counter locks message processing modules from operating only after the message processing module encounters a data dependency. A message processing module, for example, after encountering a data dependency, may process data in an associated IOCB when the value of the state counter (268) is greater than the priority of the associated IOCB. In this way, data processing may be carried out serially, beginning with an IOCB of lower priority and continuing with an IOCB of higher priority only when the value of the state counter is increased.

Upon completion of processing the message data (258) of the IOCB (256) having a priority (258) less than the present value of the state counter (268), the message processing module (252) increases the present value of the state counter (268) to a value greater than the next priority (264). Upon the change in value of the state counter to a value greater than the next priority (264), the message processing module (254) associated with the IOCB (262) having the next priority (264) may process the message data (266) in that IOCB (262).

By enabling the parallel processing of message data in IOCBs of differing priority, a sequential task may be executed with an optimal amount of parallel processing. Not only may the processing of each IOCB individually be carried out with parallel processing, but the processing of multiple IOCBs may also be carried out, prior to encountering dependencies, with parallel processing. In this way, a significant portion of data in IOCBs may be processed in parallel, prior to dependencies being encountered, and only the final dependent portions of processing need be carried out sequentially.

Also stored in RAM (156) is an operating system (162), a module of computer program instructions and routines for an application program's access to other resources of the compute node. It is typical for an application program and parallel communications library in a compute node of a parallel computer to run a single thread of execution with no user login and no security issues because the thread is entitled to complete access to all resources of the node. The quantity and complexity of tasks to be performed by an operating system on a compute node in a parallel computer therefore are smaller and less complex than those of an operating system on a serial computer with many threads running simultaneously. In addition, there is no video I/O on the compute node (152) ofFIG. 2, another factor that decreases the demands on the operating system. The operating system may therefore be quite lightweight by comparison with operating systems of general purpose computers, a pared down version as it were, or an operating system developed specifically for operations on a particular parallel computer. Operating systems that may usefully be improved, simplified, for use in a compute node include UNIX™, Linux™, Microsoft XP™, AIX™, IBM's i5/OS™, and others as will occur to those of skill in the art.

The exemplary compute node (152) ofFIG. 2includes several communications adapters (172,176,180,188) for implementing data communications with other nodes of a parallel computer. Such data communications may be carried out serially through RS-232 connections, through external buses such as Universal Serial Bus (‘USB’), through data communications networks such as IP networks, and in other ways as will occur to those of skill in the art. Communications adapters implement the hardware level of data communications through which one computer sends data communications to another computer, directly or through a network. Examples of communications adapters useful in systems that process data communications messages with IOCBs according to embodiments of the present invention include modems for wired communications, Ethernet (IEEE 802.3) adapters for wired network communications, and 802.11b adapters for wireless network communications.

The data communications adapters in the example ofFIG. 2include a Gigabit Ethernet adapter (172) that couples example compute node (152) for data communications to a Gigabit Ethernet (174). Gigabit Ethernet is a network transmission standard, defined in the IEEE 802.3 standard, that provides a data rate of 1 billion bits per second (one gigabit). Gigabit Ethernet is a variant of Ethernet that operates over multimode fiber optic cable, single mode fiber optic cable, or unshielded twisted pair.

The data communications adapters in the example ofFIG. 2include a JTAG Slave circuit (176) that couples example compute node (152) for data communications to a JTAG Master circuit (178). JTAG is the usual name used for the IEEE 1149.1 standard entitled Standard Test Access Port and Boundary-Scan Architecture for test access ports used for testing printed circuit boards using boundary scan. JTAG is so widely adapted that, at this time, boundary scan is more or less synonymous with JTAG. JTAG is used not only for printed circuit boards, but also for conducting boundary scans of integrated circuits, and is also useful as a mechanism for debugging embedded systems, providing a convenient “back door” into the system. The example compute node ofFIG. 2may be all three of these: It typically includes one or more integrated circuits installed on a printed circuit board and may be implemented as an embedded system having its own processor, its own memory, and its own I/O capability. JTAG boundary scans through JTAG Slave (176) may efficiently configure processor registers and memory in compute node (152) for use in processing data communications messages with IOCBs according to embodiments of the present invention.

The data communications adapters in the example ofFIG. 2includes a Point To Point Adapter (180) that couples example compute node (152) for data communications to a network (108) that is optimal for point to point message passing operations such as, for example, a network configured as a three-dimensional torus or mesh. Point To Point Adapter (180) provides data communications in six directions on three communications axes, x, y, and z, through six bidirectional links: +x (181), −x (182), +y (183), −y (184), +z (185), and −z (186).

The data communications adapters in the example ofFIG. 2includes a Global Combining Network Adapter (188) that couples example compute node (152) for data communications to a network (106) that is optimal for collective message passing operations on a global combining network configured, for example, as a binary tree. The Global Combining Network Adapter (188) provides data communications through three bidirectional links: two to children nodes (190) and one to a parent node (192).

Example compute node (152) includes two arithmetic logic units (‘ALUs’). ALU (166) is a component of each processing core (164), and a separate ALU (170) is dedicated to the exclusive use of Global Combining Network Adapter (188) for use in performing the arithmetic and logical functions of reduction operations. Computer program instructions of a reduction routine in parallel communications library (160) may latch an instruction for an arithmetic or logical function into instruction register (169). When the arithmetic or logical function of a reduction operation is a ‘sum’ or a ‘logical or,’ for example, Global Combining Network Adapter (188) may execute the arithmetic or logical operation by use of ALU (166) in processor (164) or, typically much faster, by use dedicated ALU (170).

The example compute node (152) ofFIG. 2includes a direct memory access (‘DMA’) controller (195), which is computer hardware for direct memory access and a DMA engine (197), which is computer software for direct memory access. The DMA engine (197) ofFIG. 2is typically stored in computer memory of the DMA controller (195). Direct memory access includes reading and writing to memory of compute nodes with reduced operational burden on the central processing units (164). A DMA transfer essentially copies a block of memory from one location to another, typically from one compute node to another. While the CPU may initiate the DMA transfer, the CPU does not execute it.

For further explanation,FIG. 3Aillustrates an exemplary Point To Point Adapter (180) useful in systems capable of processing data communications messages with IOCBs according to embodiments of the present invention. Point To Point Adapter (180) is designed for use in a data communications network optimized for point to point operations, a network that organizes compute nodes in a three-dimensional torus or mesh. Point To Point Adapter (180) in the example ofFIG. 3Aprovides data communication along an x-axis through four unidirectional data communications links, to and from the next node in the −x direction (182) and to and from the next node in the +x direction (181). Point To Point Adapter (180) also provides data communication along a y-axis through four unidirectional data communications links, to and from the next node in the −y direction (184) and to and from the next node in the +y direction (183). Point To Point Adapter (180) inFIG. 3Aalso provides data communication along a z-axis through four unidirectional data communications links, to and from the next node in the −z direction (186) and to and from the next node in the +z direction (185).

For further explanation,FIG. 3Billustrates an exemplary Global Combining Network Adapter (188) useful in systems capable of processing data communications messages with IOCBs according to embodiments of the present invention. Global Combining Network Adapter (188) is designed for use in a network optimized for collective operations, a network that organizes compute nodes of a parallel computer in a binary tree. Global Combining Network Adapter (188) in the example ofFIG. 3Bprovides data communication to and from two children nodes through four unidirectional data communications links (190). Global Combining Network Adapter (188) also provides data communication to and from a parent node through two unidirectional data communications links (192).

For further explanation,FIG. 4sets forth a line drawing illustrating an exemplary data communications network (108) optimized for point to point operations useful in systems capable of processing data communications messages with IOCBs in accordance with embodiments of the present invention. In the example ofFIG. 4, dots represent compute nodes (102) of a parallel computer, and the dotted lines between the dots represent data communications links (103) between compute nodes. The data communications links are implemented with point to point data communications adapters similar to the one illustrated for example inFIG. 3A, with data communications links on three axes, x, y, and z, and to and fro in six directions +x (181), −x (182), +y (183), −y (184), +z (185), and −z (186). The links and compute nodes are organized by this data communications network optimized for point to point operations into a three dimensional mesh (105). The mesh (105) has wrap-around links on each axis that connect the outermost compute nodes in the mesh (105) on opposite sides of the mesh (105). These wrap-around links form part of a torus (107). Each compute node in the torus has a location in the torus that is uniquely specified by a set of x, y, z coordinates. Readers will note that the wrap-around links in the y and z directions have been omitted for clarity, but are configured in a similar manner to the wrap-around link illustrated in the x direction. For clarity of explanation, the data communications network ofFIG. 4is illustrated with only 27 compute nodes, but readers will recognize that a data communications network optimized for point to point operations for use in processing data communications messages with IOCBs in accordance with embodiments of the present invention may contain only a few compute nodes or may contain thousands of compute nodes.

For further explanation,FIG. 5sets forth a line drawing illustrating an exemplary data communications network (106) optimized for collective operations useful in systems capable of processing data communications messages with IOCBs in accordance with embodiments of the present invention. The example data communications network ofFIG. 5includes data communications links connected to the compute nodes so as to organize the compute nodes as a tree. In the example ofFIG. 5, dots represent compute nodes (102) of a parallel computer, and the dotted lines (103) between the dots represent data communications links between compute nodes. The data communications links are implemented with global combining network adapters similar to the one illustrated for example inFIG. 3B, with each node typically providing data communications to and from two children nodes and data communications to and from a parent node, with some exceptions. Nodes in a binary tree (106) may be characterized as a physical root node (202), branch nodes (204), and leaf nodes (206). The root node (202) has two children but no parent. The leaf nodes (206) each has a parent, but leaf nodes have no children. The branch nodes (204) each has both a parent and two children. The links and compute nodes are thereby organized by this data communications network optimized for collective operations into a binary tree (106). For clarity of explanation, the data communications network ofFIG. 5is illustrated with only 31 compute nodes, but readers will recognize that a data communications network optimized for collective operations for use in systems for processing data communications messages with IOCBs in accordance with embodiments of the present invention may contain only a few compute nodes or may contain thousands of compute nodes.

In the example ofFIG. 5, each node in the tree is assigned a unit identifier referred to as a ‘rank’ (250). A node's rank uniquely identifies the node's location in the tree network for use in both point to point and collective operations in the tree network. The ranks in this example are assigned as integers beginning with 0 assigned to the root node (202), 1 assigned to the first node in the second layer of the tree, 2 assigned to the second node in the second layer of the tree, 3 assigned to the first node in the third layer of the tree, 4 assigned to the second node in the third layer of the tree, and so on. For ease of illustration, only the ranks of the first three layers of the tree are shown here, but all compute nodes in the tree network are assigned a unique rank.

For further explanation,FIG. 6sets forth a flow chart illustrating an exemplary method for processing data communications messages with IOCBs according to embodiments of the present invention. In the method ofFIG. 6, each IOCB (604,610) is characterized by a priority (608,614) and the IOCBs are arranged in sequential priority (608,614) for serial operations.

The method ofFIG. 6includes depositing (602) message data (606,612) in one or more IOCBs (604,610) according to depositing criteria (632) for each IOCB (604,610). Depositing (602) message data (606,612) in one or more IOCBs (604,610) may be carried out by storing data in memory space designated for the IOCB or storing pointers to memory locations storing the message data.

The method ofFIG. 6also includes processing (634), in parallel, the message data (606,612) in the IOCBs (604,610). Processing (634) the message data (606,612) in the IOCBs (604,610) may be carried out by message processing modules (620,630) associated with the IOCBs (604,610). Processing (634) of the message data in the IOCBs (604,610) is carried out with regard to priority. That is, all IOCBs may be processed at the same time, enable parallelism in what would otherwise be a sequential task.

The method ofFIG. 6also includes halting (636) the processing of the message data in an IOCB having the next priority (610) upon identification of a dependency on the processing of an IOCB having a priority less than the present value of the state counter. A message processing module may identify a dependency in many ways including for example, by identifying parameters of function calls specifically designated as parameters dependent upon other processing, by identifying computer program instructions specified as instructions dependent upon other processing, and by identifying data as dependent data from a list of data dependencies maintained by an IOCB administrator or application, such as a message passing module, and so on as will occur to readers of skill in the art.

The method ofFIG. 6also includes processing (616), by a message processing module (620) associated with an IOCB (604) having a priority (608) less than the present value of a state counter (624), the message data (606) in the IOCB (604) while the message processing module (630) associated with the IOCB (610) having a next priority (614) waits. Processing (616) the message data (606) may be carried out serially, entry by entry, or in a parallel manner. In the example ofFIG. 6, the message processing module (630) is waiting after halting (636) operation upon identifying a dependency as an example only, not limitation. In some embodiments of the present invention, the method ofFIG. 6does not include the steps of processing (634) the message data in the IOCBs in parallel and halting (636) the processing of message data in the IOCB having the next priority upon identification of the dependency. In such embodiments, an IOCB having a next priority may not execute until the state counter is set to a value greater than the next priority.

The method ofFIG. 6also includes, increasing (622), upon completion of processing (616) the message data of the IOCB (604) having a priority (608) less than the present value of the state counter (624), the present value of the state counter (624) to a value greater than the next priority (614). The message processing module (620) may be configured to set the state counter (624) to a predefined value or increment the state counter.

The method ofFIG. 6also includes, processing (628), by the message processing module (630) associated with the IOCB (610) having the next priority (614), the message data (612) in the IOCB (610) having the next priority (614). That is, upon discovering the value of the state counter (624) is greater than the IOCB's (610) priority (614), the message processing module (630) is released, no longer blocked in a waiting state, and may process the message data (612) in the IOCB (610).

For further explanation,FIG. 7sets forth a flow chart illustrating an exemplary method for processing data communications messages with IOCBs according to embodiments of the present invention. The method ofFIG. 7is similar to the method ofFIG. 6in that, in the method ofFIG. 7, each IOCB is characterized by a priority (709,713) and the IOCBs are arranged in sequential priority (709,713) for serial operations. The method ofFIG. 7is also similar to the method ofFIG. 6in that the method ofFIG. 7includes depositing (602) message data (606,612) in one or more IOCBs according to depositing criteria (632) for each IOCB; processing (616), by a message processing module associated with an IOCB having a priority less than the present value of a state counter (624), the message data in the IOCB while a message processing module associated with an IOCB having a next priority waits; increasing (622), upon completion of processing (616) the message data of the IOCB having a priority less than the present value of the state counter (624), the present value of the state counter (624) to a value greater than the next priority; and processing (628), by the message processing module associated with the IOCB having the next priority, the message data in the IOCB having the next priority.

The method ofFIG. 7differs from the method ofFIG. 6, however, in that in the method ofFIG. 7, the IOCBs include a message descriptor injection IOCB (706) and a payload injection IOCB (710). The message descriptor injection IOCB (706) has a priority (709) less than the priority (713) of the payload injection IOCB (710)

The method ofFIG. 7also differs from theFIG. 6in that in the method ofFIG. 7, depositing (602) message data (606,612) in one or more IOCBs according to depositing criteria (632) for each IOCB is carried out by depositing (702) message descriptors (708) in a particular order in the message descriptor IOCB (706) until the depositing criteria (632) for the message descriptor injection IOCB (706) is met and depositing (704) message payloads (712) in the payload injection IOCB (710) until the depositing criteria (632) for the payload injection IOCB (710) is met. A data communications message may consist of a message descriptor and payload data. The message descriptor may be data describing the message, such as the message size, target destination, sender, type of message, and other control information as will occur to readers of skill in the art.

Also in the method ofFIG. 7, processing (616), by a message processing module associated with an IOCB having a priority less than the present value of a state counter (624), the message data in the IOCB while a message processing module associated with an IOCB having a next priority waits is carried out by injecting (714), by a message descriptor injection module (716), the message descriptors (708) on a network to a designated recipient in the particular order when the priority (709) of the IOCB (706) is less than the present value of the state counter (624) while a payload injection module (722) associated with the payload injection IOCB (710) waits. In this way message match consistency is maintained—message descriptors are sent to target destinations prior to the payloads of those messages. In some networks, message match consistency is desired or required. Message match consistency requires that message descriptors be sent prior to the actual payload of the message.

In the method ofFIG. 7, increasing (622), upon completion of processing (616) the message data of the IOCB having a priority less than the present value of the state counter (624), the present value of the state counter (624) to a value greater than the next priority is carried out by increasing (718) by the message descriptor injection module (716) the present value of the state counter (624) to a value greater than the priority (713) of the payload injection IOCB (710). Processing (628) the message data in the IOCB having the next priority in the method ofFIG. 7is carried out by injecting (720), by the payload injection module (722), into the network to the designated recipient the message payloads (712).

For further explanation,FIG. 8sets forth a flow chart illustrating an exemplary method for processing data communications messages with IOCBs according to embodiments of the present invention. The method ofFIG. 8is similar to the method ofFIG. 6in that, in the method ofFIG. 8, each IOCB is characterized by a priority (809,813) and the IOCBs are arranged in sequential priority (809,813) for serial operations. The method ofFIG. 8is also similar to the method ofFIG. 6in that the method ofFIG. 8includes depositing (602) message data (606,612) in one or more IOCBs according to depositing criteria (632) for each IOCB; processing (616), by a message processing module associated with an IOCB having a priority less than the present value of a state counter (624), the message data in the IOCB while a message processing module associated with an IOCB having a next priority waits; increasing (622), upon completion of processing (616) the message data of the IOCB having a priority less than the present value of the state counter (624), the present value of the state counter (624) to a value greater than the next priority; and processing (628), by the message processing module associated with the IOCB having the next priority, the message data in the IOCB having the next priority.

The method ofFIG. 8differs from the methodFIG. 6, however, in that in the method ofFIG. 8, the IOCBs include a message descriptor injection IOCB (806), an acknowledgement receive IOCB (822), and a payload injection IOCB (810). The message descriptor injection IOCB (806) and the acknowledgment receive IOCB (822) have a priority (809,826) less than the priority (813) of the payload injection IOCB (810). The priorities (809,826) of the message descriptor injection IOCB (806) and the acknowledgment receive IOCB (822) may be equal or not, as long as both of the priorities (809,826) are less than the priority (813).

The method ofFIG. 8also differs from the methodFIG. 6in that, in the method ofFIG. 8, depositing (602) message data (606,612) in one or more IOCBs according to depositing criteria (632) for each IOCB is carried out by depositing (802) message descriptors (808) in a particular order in the message descriptor IOCB (806) until the depositing criteria (632) for the message descriptor injection IOCB (806) is met and depositing (804) message payloads (812) in the payload injection IOCB (810) until the depositing criteria (632) for the payload injection IOCB (810) is met.

Also in the method ofFIG. 8, processing (616), by a message processing module associated with an IOCB having a priority less than the present value of a state counter (624), the message data in the IOCB while a message processing module associated with an IOCB having a next priority waits is carried out, while a payload injection module (832) associated with the payload injection IOCB (810) waits, by injecting (816), by a message descriptor injection module (814) associated with the message descriptor injection IOCB (806), in the particular order on an out-of-order data communications network to a designated recipient, the message descriptors (808) in the message descriptor injection IOCB (806) and receiving (820), by an acknowledgment receive module (818) associated with the acknowledgement receive IOCB (822), acknowledgements (824) for the message descriptors (808) sent to the designated recipient. In some out-of-order networks, a payload may not be sent to a target destination until the target destination returns an acknowledgment of receipt of a message descriptor.

Also in the method ofFIG. 8, increasing (622), upon completion of processing (616) the message data of the IOCB having a priority less than the present value of the state counter (624), the present value of the state counter (624) to a value greater than the next priority is carried out by increasing (828), upon receipt of an acknowledgement (824) for all injected message descriptors (808) by the acknowledgment receive module (818) the present value of the state counter (624) to a value greater than the priority (813) of the payload injection IOCB (810).

Also in the method ofFIG. 8, processing (628), by the message processing module associated with the IOCB having the next priority, the message data in the IOCB having the next priority is carried out by injecting (830), by the payload injection module (832), into the network to the designated recipient the message payloads (812). In this way, the method ofFIG. 8produces serial operations of sending a message descriptor of a message to a designated recipient, receiving from the designated recipient an acknowledgment of the message descriptor, and sending the payload of the message. When processing multiple messages, the method ofFIG. 8may include sending several message descriptors at a time, while collecting several acknowledgments at the same time. That is, the steps of injection message descriptors and receiving acknowledgements may occur in parallel. The step of payload injection, requires is dependent upon receiving an acknowledgement, and as such must be carried out serially with respect to message descriptor injection and receipt of acknowledgements.

For further explanation,FIG. 9sets forth a flow chart illustrating an exemplary method for processing data communications messages with IOCBs according to embodiments of the present invention. The method ofFIG. 9is similar to the method ofFIG. 6in that, in the method ofFIG. 9, each IOCB is characterized by a priority (910,916,930) and the IOCBs are arranged in sequential priority (910,916,930) for serial operations. The method ofFIG. 9is also similar to the method ofFIG. 6in that the method ofFIG. 9includes depositing (602) message data (606,612) in one or more IOCBs according to depositing criteria (632) for each IOCB; processing (616), by a message processing module associated with an IOCB having a priority less than the present value of a state counter (624), the message data in the IOCB while a message processing module associated with an IOCB having a next priority waits; increasing (622), upon completion of processing (616) the message data of the IOCB having a priority less than the present value of the state counter (624), the present value of the state counter (624) to a value greater than the next priority; and processing (628), by the message processing module associated with the IOCB having the next priority, the message data in the IOCB having the next priority.

The method ofFIG. 9differs from the methodFIG. 6, however, in that in the method ofFIG. 9, the IOCBs include a message descriptor IOCB (912), a payload transformation IOCB (906), and a payload injection IOCB (926). The message descriptor IOCB (912) and the payload transformation IOCB (906) have a priority (916,910) that is less than the priority (930) of the payload injection IOCB (926).

The method ofFIG. 9differs fromFIG. 6, however, in that in the method ofFIG. 9, depositing (602) message data (606,612) in one or more IOCBs according to depositing criteria (632) for each IOCB is carried out by depositing (902) message descriptors (912) in a particular order in the message descriptor IOCB (912) until the depositing criteria (632) for the message descriptor injection IOCB (912) is met and depositing (904) message payloads (908) in the payload transformation IOCB (906) until the depositing criteria (632) for the payload transformation IOCB (906) is met.

Also in the method ofFIG. 9, processing (616), by a message processing module associated with an IOCB having a priority less than the present value of a state counter (624), the message data in the IOCB while a message processing module associated with an IOCB having a next priority waits is carried out, while a payload injection module (936) associated with the payload injection IOCB (926) waits, by injecting (920), by a message descriptor injection module (918) associated with the message descriptor injection IOCB (912), in the particular order on a data communications network to a designated recipient, the message descriptors (914) in the message descriptor injection IOCB (912) and transforming (924), by a payload transformation module (922) associated with the payload transformation IOCB (906), the message payloads (908). Transforming (924) the message payloads (908) may be carried out in various ways. Transforming message payloads may include reversing endianness of the payload, performing a mathematical operation to the payload, adding data, removing data, filtering data and so on as will occur to readers of skill in the art.

Also in the method ofFIG. 9, increasing (622), upon completion of processing (616) the message data of the IOCB having a priority less than the present value of the state counter (624), the present value of the state counter (624) to a value greater than the next priority is carried out by increasing (932), upon transformation of all message payloads (908) in the payload transformation IOCB (906) by the payload transformation module (922), the present value of the state counter (624) to a value greater than the priority (930) of the payload injection IOCB (926).

Also in the method ofFIG. 9, processing (628), by the message processing module associated with the IOCB having the next priority, the message data in the IOCB having the next priority is carried out by injecting (934), by the payload injection module (936), into the network to the designated recipient the transformed message payloads (928).

For further explanation,FIG. 10sets forth a flow chart illustrating an exemplary method for processing data communications messages with IOCBs according to embodiments of the present invention. The method ofFIG. 10is similar to the method ofFIG. 6in that, in the method ofFIG. 10, each IOCB is characterized by a priority (1018,1012) and the IOCBs are arranged in sequential priority (1018,1012) for serial operations. The method ofFIG. 10is also similar to the method ofFIG. 6in that the method ofFIG. 10includes depositing (602) message data (606,612) in one or more IOCBs according to depositing criteria (632) for each IOCB; processing (616), by a message processing module associated with an IOCB having a priority less than the present value of a state counter (624), the message data in the IOCB while a message processing module associated with an IOCB having a next priority waits; increasing (622), upon completion of processing (616) the message data of the IOCB having a priority less than the present value of the state counter (624), the present value of the state counter (624) to a value greater than the next priority; and processing (628), by the message processing module associated with the IOCB having the next priority, the message data in the IOCB having the next priority.

The method ofFIG. 10differs from the method ofFIG. 6, however, in that in the method ofFIG. 10, the IOCBs include a messages queue IOCB (1014) and a message combine IOCB (1008). The messages queue IOCB (1014) has a priority (1018) less than the priority (1012) of the message combine IOCB (1008).

The method ofFIG. 10also differs from the method ofFIG. 6in that, in the method ofFIG. 10, depositing (602) message data in one or more IOCBs according to depositing criteria for each IOCB and processing (616), by a message processing module associated with an IOCB having a priority less than the present value of the state counter, the message data in the IOCB while a message processing module associated with an IOCB having a next priority waits is carried out, while a message combining module (1022) associated with the message combine IOCB (1008) waits, by depositing (1002), by a message queuing module (1020) in the message queue IOCB (1014), a plurality of messages (1016) to be sent to a designated recipient from a sender until the depositing criteria (632) for the message queue IOCB (1014) is sent. Depositing (1002) a plurality of messages (1016) may be carried out by storing in the IOCB message descriptors of the messages, pointers to such message descriptors, pointers to the messages, and so on as will occur to a person of skill in the art.

In the method ofFIG. 10, increasing (622), upon completion of processing the message data of the IOCB having a priority less than the present value of the state counter, the present value of the state counter to a value greater than the next priority is carried out by increasing (1004) the present value of the state counter (624) to a value greater than the priority (1012) of the message combine IOCB (1008).

In the method ofFIG. 10, processing (628), by the message processing module associated with the IOCB having the next priority, the message data in the IOCB having the next priority includes combining (1006), by the message combine module (1022), the plurality of messages (1016) in the message queue IOCB, into a fewer number of messages (1010) to the designated recipient. Combining messages may include, combining messages into a predefined number of messages, into messages of a predefined size, and so on as will occur to readers of skill in the art. The method ofFIG. 10depicts only two IOCBs for clarity not limitation, Readers of skill in the art will immediately recognize that any number of message queue IOCBs and message descriptor IOCBs may be used to implement a serial combining operation for messages. Moreover, once the messages are combined the method ofFIG. 10may be used with the IOCBs and the methods ofFIG. 7orFIG. 8to inject the message descriptors and payloads into the network.

For further explanation,FIG. 11sets forth a flow chart illustrating an exemplary method for processing data communications messages with IOCBs according to embodiments of the present invention. The method ofFIG. 11is similar to the method ofFIG. 6in that, in the method ofFIG. 11, each IOCB is characterized by a priority (1112,1120) and the IOCBs are arranged in sequential priority (1112,1120) for serial operations. The method ofFIG. 11is also similar to the method ofFIG. 6in that the method ofFIG. 11includes depositing (602) message data (606,612) in one or more IOCBs according to depositing criteria (632) for each IOCB; processing (616), by a message processing module associated with an IOCB having a priority less than the present value of a state counter (624), the message data in the IOCB while a message processing module associated with an IOCB having a next priority waits; increasing (622), upon completion of processing (616) the message data of the IOCB having a priority less than the present value of the state counter (624), the present value of the state counter (624) to a value greater than the next priority; and processing (628), by the message processing module associated with the IOCB having the next priority, the message data in the IOCB having the next priority.

The method ofFIG. 11differs from the method ofFIG. 6, however, in that in the method ofFIG. 11, the IOCBs include an acknowledgement receive IOCB (1108) and an acknowledgement combine IOCB (1116). The acknowledgement receive IOCB (1108) has a priority (1112) less than the priority (1120) of the acknowledgement combine IOCB (1116).

The method ofFIG. 11also differs from the method ofFIG. 6in that, in the method ofFIG. 11, depositing (602) message data in one or more IOCBs according to depositing criteria for each IOCB and processing (616), by a message processing module associated with an IOCB having a priority less than the present value of the state counter, the message data in the IOCB while a message processing module associated with an IOCB having a next priority waits is carried out, while an acknowledgement combine module (1112) associated with the acknowledgment combine IOCB (1116) waits, by depositing (1102), by an acknowledgment receive module (1106), message receipt acknowledgements (1110) to be returned to a sender from a recipient until the depositing criteria (632) for the acknowledgement receive IOCB (1108) is met.

In the method ofFIG. 11, increasing (622), upon completion of processing the message data of the IOCB having a priority less than the present value of the state counter, the present value of the state counter to a value greater than the next priority is carried out by increasing (1104) the present value of the state counter (624) to a value greater than the priority (1120) of the acknowledgement combine IOCB (1116).

In the method ofFIG. 11, processing (628), by the message processing module associated with the IOCB having the next priority, the message data in the IOCB having the next priority is carried out by combining (1114), by the acknowledgement combine module (1112), into one or more messages (1118) to the sender, the message receipt acknowledgements (1110) of the acknowledgement receive IOCB (1108). In this way, the number of acknowledgements returned to a sender is decreased and data congestion in a network may be reduced.

In each of theFIG. 6-11a relatively small number, two or three, of IOCBs are depicted for clarity of explanation. Readers of skill in the art will immediately recognize that processing data communications messages with IOCBs in accordance with embodiments of the present invention may include any number and types of IOCBs. Moreover, IOCB rings serving one purpose may be used in conjunction with other IOCBs serving other purposes. For example, two IOCB rings, serving different purposes may be used in conjunction with one another to process data communications messages. Each such implementation of IOCB rings used to process data communications messages is well within the scope present invention.