1. Field of the Invention
The field of the invention is data processing, or, more specifically, methods, apparatus, and products for terminating an accelerator application program in a hybrid computing environment.
2. Description of Related Art
The development of the EDVAC computer system of 1948 is often cited as the beginning of the computer era. Since that time, computer systems have evolved into extremely complicated devices. Today's computers are much more sophisticated than early systems such as the EDVAC. Computer systems typically include a combination of hardware and software components, application programs, operating systems, processors, buses, memory, input/output devices, and so on. As advances in semiconductor processing and computer architecture push the performance of the computer higher and higher, more sophisticated computer software has evolved to take advantage of the higher performance of the hardware, resulting in computer systems today that are much more powerful than just a few years ago.
Computer systems today have advanced such that some computing environments now include core components of different architectures which operate together to complete data processing tasks. Such computing environments are described in this specification as ‘hybrid’ environments, denoting that such environments include host computers and accelerators having different architectures. Although hybrid computing environments are more computationally powerful and efficient in data processing than many non-hybrid computing environments, such hybrid computing environments still present substantial challenges to the science of automated computing machinery.
Methods, apparatus, and products for terminating an accelerator application program in a hybrid computing environment are disclosed. The hybrid computing environment includes a host computer having a host computer architecture and an accelerator having an accelerator architecture. The accelerator architecture is optimized, with respect to the host computer architecture, for speed of execution of a particular class of computing functions. The host computer and the accelerator are adapted to one another for data communications by a system level message passing module (‘SLMPM’). The accelerator is also configured to execute one or more accelerator application programs. Terminating an accelerator application program in a hybrid computing environment includes receiving, by the SLMPM from a host application executing on the host computer, a request to terminate an accelerator application program executing on the accelerator; terminating, by the SLMPM, execution of the accelerator application program; returning, by the SLMPM to the host application, a signal indicating that execution of the accelerator application program was terminated; and performing, by the SLMPM, a cleanup of the execution environment associated with the terminated accelerator application program.
The foregoing and other objects, features and advantages of the invention will be apparent from the following more particular descriptions of exemplary embodiments of the invention as illustrated in the accompanying drawings wherein like reference numbers generally represent like parts of exemplary embodiments of the invention.
Exemplary methods, apparatus, and products for terminating an accelerator application program in a hybrid computing environment according to embodiments of the present invention are described with reference to the accompanying drawings, beginning with
Examples of hybrid computing environments include a data processing system that in turn includes one or more host computers, each having an x86 processor, and accelerators whose architectural registers implement the PowerPC instruction set. Computer program instructions compiled for execution on the x86 processors in the host computers cannot be executed natively by the PowerPC processors in the accelerators. Readers will recognize in addition that some of the example hybrid computing environments described in this specification are based upon the Los Alamos National Laboratory (‘LANL’) supercomputer architecture developed in the LANL Roadrunner project (named for the state bird of New Mexico), the supercomputer architecture that famously first generated a ‘petaflop,’ a million billion floating point operations per second. The LANL supercomputer architecture includes many host computers with dual-core AMD Opteron processors coupled to many accelerators with IBM Cell processors, the Opteron processors and the Cell processors having different architectures.
The example hybrid computing environment (100) of
In the example hybrid computing environment (100) of
In the example of
Because each of the compute nodes in the example of
A data communications fabric (106, 107) is a configuration of data communications hardware and software that implements a data communications coupling between a host computer and an accelerator. Examples of data communications fabric types include Peripheral Component Interconnect (‘PCI’), PCI express (‘PCIe’), Ethernet, Infiniband, Fibre Channel, Small Computer System Interface (‘SCSI’), External Serial Advanced Technology Attachment (‘eSATA’), Universal Serial Bus (‘USB’), and so on as will occur to those of skill in the art.
The SLMPM (146) of
The arrangement of compute nodes, data communications fabrics, networks, I/O devices, service nodes, I/O nodes, and so on, making up the hybrid computing environment (100) as illustrated in
For further explanation,
Each of the compute nodes also includes one or more accelerators (104, 105). Each accelerator (104, 105) includes a computer processor (148) operatively coupled to RAM (140) through a high speed memory bus (151). Stored in RAM (140,142) of the host computer and the accelerators (104, 105) is an operating system (145). Operating systems useful in host computers and accelerators of hybrid computing environments according to embodiments of the present invention include UNIX™, Linux™, Microsoft XP™, Microsoft Vista™, Microsoft NT™, AIX™, IBM's i5/OS™, and others as will occur to those of skill in the art. There is no requirement that the operating system in the host computers should be the same operating system used on the accelerators.
The processor (148) of each accelerator (104, 105) has a set of architectural registers (150) that defines the accelerator architecture. The architectural registers (150) of the processor (148) of each accelerator are different from the architectural registers (154) of the processor (152) in the host computer (110). With differing architectures, it would be uncommon, although possible, for a host computer and an accelerator to support the same instruction sets. As such, computer program instructions compiled for execution on the processor (148) of an accelerator (104) generally would not be expected to execute natively on the processor (152) of the host computer (110) and vice versa. Moreover, because of the typical differences in hardware architectures between host processors and accelerators, computer program instructions compiled for execution on the processor (152) of a host computer (110) generally would not be expected to execute natively on the processor (148) of an accelerator (104) even if the accelerator supported the instruction set of the host. The accelerator architecture in example of
In the example of
The SLMPM (146) in this example operates generally for data processing in a hybrid computing environment (100) by monitoring data communications performance for a plurality of data communications modes between the host computer (110) and the accelerators (104, 105), receiving a request (168) to transmit data according to a data communications mode from the host computer to an accelerator, determining whether to transmit the data according to the requested data communications mode, and if the data is not to be transmitted according to the requested data communications mode: selecting another data communications mode and transmitting the data according to the selected data communications mode. In the example of
A data communications mode specifies a data communications fabric type, a data communications link, and a data communications protocol (178). A data communications link (156) is data communications connection between a host computer and an accelerator. In the example of
A data communications protocol is a set of standard rules for data representation, signaling, authentication and error detection required to send information from a host computer (110) to an accelerator (104). In the example of
Shared memory transfer is a data communications protocol for passing data between a host computer and an accelerator into shared memory space (158) allocated for such a purpose such that only one instance of the data resides in memory at any time. Consider the following as an example shared memory transfer between the host computer (110) and the accelerator (104) of
Direct memory access (‘DMA’) is a data communications protocol for passing data between a host computer and an accelerator with reduced operational burden on the computer processor (152). A DMA transfer essentially effects a copy of a block of memory from one location to another, typically from a host computer to an accelerator or vice versa. Either or both a host computer and accelerator may include DMA engine, an aggregation of computer hardware and software for direct memory access. Direct memory access includes reading and writing to memory of accelerators and host computers with reduced operational burden on their processors. A DMA engine of an accelerator, for example, may write to or read from memory allocated for DMA purposes, while the processor of the accelerator executes computer program instructions, or otherwise continues to operate. That is, a computer processor may issue an instruction to execute a DMA transfer, but the DMA engine, not the processor, carries out the transfer.
In the example of
To implement a DMA protocol in the hybrid computing environment of
A direct ‘PUT’ operation is a mode of transmitting data from a DMA engine on an origin device to a DMA engine on a target device. A direct ‘PUT’ operation allows data to be transmitted and stored on the target device with little involvement from the target device's processor. To effect minimal involvement from the target device's processor in the direct ‘PUT’ operation, the origin DMA engine transfers the data to be stored on the target device along with a specific identification of a storage location on the target device. The origin DMA knows the specific storage location on the target device because the specific storage location for storing the data on the target device has been previously provided by the target DMA engine to the origin DMA engine.
A remote ‘GET’ operation, sometimes denominated an ‘rGET,’ is another mode of transmitting data from a DMA engine on an origin device to a DMA engine on a target device. A remote ‘GET’ operation allows data to be transmitted and stored on the target device with little involvement from the origin device's processor. To effect minimal involvement from the origin device's processor in the remote ‘GET’ operation, the origin DMA engine stores the data in an storage location accessible by the target DMA engine, notifies the target DMA engine, directly or out-of-band through a shared memory transmission, of the storage location and the size of the data ready to be transmitted, and the target DMA engine retrieves the data from storage location.
Monitoring data communications performance for a plurality of data communications modes may include monitoring a number of requests (168) in a message transmit request queue (162-165) for a data communications link (156). In the example of
Monitoring data communications performance for a plurality of data communications modes may also include monitoring utilization of a shared memory space (158). In the example of
In some embodiments of the present invention, the hybrid computing environment (100) of
The SLMPM (146) of
A request (168) to transmit data (176) according to a data communications mode may be implemented as a user-level application function call through an API to the SLMPM (146), a call that expressly specifies a data communications mode according to protocol, fabric type, and link. A request implemented as a function call may specify a protocol according to the operation of the function call itself. A dacs_put( ) function call, for example, may represent a call through an API exposed by an SLMPM implemented as a DACS library to transmit data in the default mode of a DMA ‘PUT’ operation. Such a call, from the perspective of the calling application and the programmer who wrote the calling application, represents a request to the SLMPM library to transmit data according to the default mode, known to the programmer to be default mode associated with the express API call. The called function, in this example dacs_put( ) may be coded according to embodiments of the present invention, to make its own determination whether to transmit the data according to the requested data communications mode, that is, according to the default mode of the called function. In a further example, a dacs_send( ) instruction may represent a call through an API exposed by an SLMPM implemented as a DACS library to transmit data in the default mode of an SMT ‘send’ operation, where the called function dacs_send( ) is again coded according to embodiments of the present invention to make its own determination whether to transmit the data according to the requested mode.
An identification of a particular accelerator in a function call may effectively specify a fabric type. Such a function call may include as a call parameter an identification of a particular accelerator. An identification of a particular accelerator by use of a PCIe ID, for example, effectively specifies a PCI fabric type. In another, similar, example, an identification of a particular accelerator by use of a media access control (‘MAC’) address of an Ethernet adapter effectively specifies the Ethernet fabric type. Instead of implementing the accelerator ID of the function call from an application executing on the host in such a way as to specify a fabric type, the function call may only include a globally unique identification of the particular accelerator as a parameter of the call, thereby specifying only a link from the host computer to the accelerator, not a fabric type. In this case, the function called may implement a default fabric type for use with a particular protocol. If the function called in the SLMPM is configured with PCIe as a default fabric type for use with the DMA protocol, for example, and the SLMPM receives a request to transmit data to the accelerator (104) according to the DMA protocol, a DMA PUT or DMA remote GET operation, the function called explicitly specifies the default fabric type for DMA, the PCIe fabric type.
In hybrid computing environments in which only one link of each fabric type adapts a single host computer to a single accelerator, the identification of a particular accelerator in a parameter of a function call, may also effectively specify a link. In hybrid computing environments where more than one link of each fabric type adapts a host computer and an accelerator, such as two PCIe links connecting the host computer (110) to the accelerator (104), the SLMPM function called may implement a default link for the accelerator identified in the parameter of the function call for the fabric type specified by the identification of the accelerator.
The SLMPM (146) in the example of
In hybrid computing environments in which monitoring data communications performance across data communications modes includes monitoring a number of requests in a message transmit request queue (162-165) for a data communications link, determining whether to transmit the data (176) according to the requested data communications mode may be carried out by determining whether the number of requests in the message transmit request queue exceeds a predetermined threshold. In hybrid computing environments in which monitoring data communications performance for a plurality of data communications modes includes monitoring utilization of a shared memory space, determining whether to transmit the data (176) according to the requested data communications mode may be carried out by determining whether the utilization of the shared memory space exceeds a predetermined threshold.
If the data is not to be transmitted according to the requested data communications mode, the SLMPM (146) selects, in dependence upon the monitored performance, another data communications mode for transmitting the data and transmits the data (176) according to the selected data communications mode. Selecting another data communications mode for transmitting the data may include selecting, in dependence upon the monitored performance, another data communications fabric type by which to transmit the data, selecting a data communications link through which to transmit the data, and selecting another data communications protocol. Consider as an example, that the requested data communications mode is a DMA transmission using a PUT operation through link (138) of the PCIe fabric (130) to the accelerator (104). If the monitored data performance (174) indicates that the number of requests in transmit message request queue (162) associated with the link (138) exceeds a predetermined threshold, the SLMPM may select another fabric type, the Ethernet fabric (128), and link (131, 132) through which to transmit the data (176). Also consider that the monitored performance (176) indicates that current utilization of the shared memory space (158) is less than a predetermined threshold while the number of outstanding DMA transmissions in the queue (162) exceeds a predetermined threshold. In such a case, the SLMPM (146) may also select another protocol, such as a shared memory transfer, by which to transmit the data (174).
Selecting, by the SLMPM, another data communications mode for transmitting the data (172) may also include selecting a data communications protocol (178) in dependence upon data communications message size (172). Selecting a data communications protocol (178) in dependence upon data communications message size (172) may be carried out by determining whether a size of a message exceeds a predetermined threshold. For larger messages (170), the DMA protocol may be a preferred protocol as processor utilization in making a DMA transfer of a larger message (170) is typically less than the processor utilization in making a shared memory transfer of a message of the same size.
As mentioned above, the SLMPM may also transmit the data according to the selected data communications mode. Transmit the data according to the selected data communications mode may include transmitting the data by the selected data communications fabric type, transmitting the data through the selected data communications link, or transmitting the data according to the selected protocol. The SLMPM (146) may effect a transmission of the data according to the selected data communications mode by instructing, through a device driver, the communications adapter for the data communications fabric type of the selected data communications mode to transmit the message (170) according to a protocol of the selected data communications mode, where the message includes in a message header, an identification of the accelerator, and in the message payload, the data (176) to be transmitted.
The SLMPM (146) in the example of
As mentioned above, the SLMPM (146) in the example of
In the hybrid computing environment (100) of
The SLMPM (146), responsive to receiving the request (207) to terminate the accelerator application program (204), may terminate execution of the accelerator application program (204). The SLMPM (146) may terminate execution of the accelerator application program (204) by sending a POSIX-style ‘ SIGTERM’ signal followed by a ‘SIGKILL’ signal to the accelerator application program (204), depicted as an instruction to terminate (210) the accelerator application (204) in the example of
The SLMPM (146) may returning, to the host application (166), a signal indicating that execution of the accelerator application program was terminated. The SLMPM (146) may return a signal indicating that execution of the accelerator application program was terminated by sending to the host application (166) a POSIX-style, SIGCHLD message. On POSIX-compliant platforms, SIGCHLD is the signal sent to a process when a child process terminates. In Unix, a process can have children created by fork or similar system calls. In a hybrid computing environment, the accelerator application program executed at the behest of a host application is an analog of a child process created by a form or other system call. When the child terminates a SIGCHLD signal is sent to the parent.
The SLMPM (146) may also perform a cleanup of the execution environment associated with the terminated accelerator application program. Performing a cleanup of the execution environment associated with the terminated accelerator application program (204) may include performing a device cleanup including deregistering a process identifier of the terminated accelerator application program (204) with the accelerator. Performing a cleanup of the execution environment associated with the terminated accelerator application program (204) may also include performing a connection cleanup including removing mappings of a process identifier of the terminated accelerator application program (204) to process identifiers of one or more other accelerator application programs. Performing a cleanup of the execution environment associated with the terminated accelerator application program (204) may also include causing undelivered messages associated with the terminated accelerator application program (204) to indicate an error. Performing a cleanup of the execution environment associated with the terminated accelerator application program may also include administering message queues associated with the terminated accelerator application program (204), administering execution environment objects shared by the terminated accelerator application program (204), and invalidating a process identifier of the terminated accelerator application program for access through the SLMPM (146).
Upon receiving the signal (208) indicating that execution of the accelerator application program (204) was terminated, the host application (166) may reap the process by executing a dacs_de_test or dacs_de_wait function call. In reaping the process, additional cleanup of shared memory regions or shared objects may be performed by the host application (166) or the SLMPM (146).
For further explanation,
The host computer (110) as illustrated in the expanded view of the compute node (103) includes an x86 processor. An x86 processor is a processor whose architecture is based upon the architectural register set of the Intel x86 series of microprocessors, the 386, the 486, the 586 or Pentium™, and so on. Examples of x86 processors include the Advanced Micro Devices (‘AMD’) Opteron™, the AMD Phenom™, the AMD Athlon XP™, the AMD Athlon 64™, Intel Nehalam™, Intel Pentium 4, Intel Core 2 Duo, Intel Atom, and so on as will occur to those of skill in the art. The x86 processor (152) in the example of Figure illustrates a set of a typical architectural registers (154) found in many x86 processors including, for example, an accumulator register (‘AX’), a base register (‘BX’), a counter register (‘CX’), a data register (‘DX’), a source index register for string operations (‘SI’), a destination index for string operations (‘DI’), a stack pointer (‘SP’), a stack base pointer for holding the address of the current stack frame (‘BP’), and an instruction pointer that holds the current instruction address (‘IP’).
The accelerator (104) in the example of
The accelerator (104) of
The SPEs (308) handle most of the computational workload of the CBE (104). While the SPEs are optimized for vectorized floating point code execution, the SPEs also may execute operating systems, such as, for example, a lightweight, modified version of Linux with the operating system stored in local memory (141) on the SPE. Each SPE (308) in the example of
The MFC (310) integrates the SPUs (302) in the CBE (104). The MFC (310) provides an SPU with data transfer and synchronization capabilities, and implements the SPU interface to the EIB (312) which serves as the transportation hub for the CBE (104). The MFC (310) also implements the communication interface between the SPE (308) and PPE (148), and serves as a data transfer engine that performs bulk data transfers between the local storage (141) of an SPU (302) and CBE system memory, RAM (140), through DMA. By offloading data transfer from the SPUs (302) onto dedicated data transfer engines, data processing and data transfer proceeds in parallel, supporting advanced programming methods such as software pipelining and double buffering. Providing the ability to perform high performance data transfer asynchronously and in parallel with data processing on the PPE (148) and SPEs (302), the MFC (310) eliminates the need to explicitly interleave data processing and transfer at the application level.
The SLMPM (146) in the example of
The SLMPM (146) of
For further explanation,
Each x86 processor core (152) in the example of
Each instance of the SLMPM (146) executing on each x86 processor core (152) in the example of
Each instance of the SLMPM (146) of
For further explanation,
The method of
The method of
The method of
The method of
The method of
The method of
Exemplary embodiments of the present invention are described largely in the context of a fully functional computer system for terminating an accelerator application program in a hybrid computing environment. Readers of skill in the art will recognize, however, that the present invention also may be embodied in a computer program product disposed on signal bearing media for use with any suitable data processing system. Such signal bearing media may be transmission media or recordable media for machine-readable information, including magnetic media, optical media, or other suitable media. Examples of recordable media include magnetic disks in hard drives or diskettes, compact disks for optical drives, magnetic tape, and others as will occur to those of skill in the art. Examples of transmission media include telephone networks for voice communications and digital data communications networks such as, for example, Ethernets™ and networks that communicate with the Internet Protocol and the World Wide Web as well as wireless transmission media such as, for example, networks implemented according to the IEEE 802.11 family of specifications. Persons skilled in the art will immediately recognize that any computer system having suitable programming means will be capable of executing the steps of the method of the invention as embodied in a program product. Persons skilled in the art will recognize immediately that, although some of the exemplary embodiments described in this specification are oriented to software installed and executing on computer hardware, nevertheless, alternative embodiments implemented as firmware or as hardware are well within the scope of the present invention.
It will be understood from the foregoing description that modifications and changes may be made in various embodiments of the present invention without departing from its true spirit. The descriptions in this specification are for purposes of illustration only and are not to be construed in a limiting sense. The scope of the present invention is limited only by the language of the following claims.
Number | Name | Date | Kind |
---|---|---|---|
4989131 | Stone | Jan 1991 | A |
5073851 | Masterson et al. | Dec 1991 | A |
5142676 | Fried et al. | Aug 1992 | A |
5363484 | Desnoyers et al. | Nov 1994 | A |
5467459 | Alexander et al. | Nov 1995 | A |
5548761 | Balasundaram et al. | Aug 1996 | A |
5590345 | Barker et al. | Dec 1996 | A |
5613146 | Gove et al. | Mar 1997 | A |
5669002 | Buch | Sep 1997 | A |
5835961 | Harvey et al. | Nov 1998 | A |
5873127 | Harvey et al. | Feb 1999 | A |
5983329 | Thaler et al. | Nov 1999 | A |
6061773 | Harvey et al. | May 2000 | A |
6070194 | Yu et al. | May 2000 | A |
6125430 | Noel et al. | Sep 2000 | A |
6266745 | De Backer et al. | Jul 2001 | B1 |
6275857 | McCartney | Aug 2001 | B1 |
6308255 | Gorishek et al. | Oct 2001 | B1 |
6330659 | Poff et al. | Dec 2001 | B1 |
6377979 | Yamashita et al. | Apr 2002 | B1 |
6473849 | Keller et al. | Oct 2002 | B1 |
6553411 | Dias et al. | Apr 2003 | B1 |
6556659 | Bowman-Amuah | Apr 2003 | B1 |
6598130 | Harris et al. | Jul 2003 | B2 |
6651132 | Trau | Nov 2003 | B1 |
6658522 | Martin et al. | Dec 2003 | B1 |
6848106 | Hipp | Jan 2005 | B1 |
6918070 | Sharma | Jul 2005 | B1 |
6948034 | Aoki | Sep 2005 | B2 |
7383330 | Moran et al. | Jun 2008 | B2 |
7418574 | Mathur et al. | Aug 2008 | B2 |
7428573 | McCanne et al. | Sep 2008 | B2 |
7436824 | Pepenella | Oct 2008 | B2 |
7437403 | Xue et al. | Oct 2008 | B2 |
7469273 | Anderson et al. | Dec 2008 | B2 |
7478154 | Cochran et al. | Jan 2009 | B2 |
7631023 | Kaiser et al. | Dec 2009 | B1 |
7668924 | Young et al. | Feb 2010 | B1 |
7725905 | Doshi et al. | May 2010 | B1 |
7752417 | Manczak et al. | Jul 2010 | B2 |
7814295 | Inglett et al. | Oct 2010 | B2 |
7904929 | Jaunin et al. | Mar 2011 | B1 |
7984267 | Aho et al. | Jul 2011 | B2 |
7991803 | Mercer et al. | Aug 2011 | B2 |
8001206 | Archer et al. | Aug 2011 | B2 |
8037217 | Arroyo et al. | Oct 2011 | B2 |
8132106 | Low et al. | Mar 2012 | B2 |
20020029289 | Byrne | Mar 2002 | A1 |
20020056033 | Huppenthal | May 2002 | A1 |
20020108059 | Canion et al. | Aug 2002 | A1 |
20020112091 | Schott et al. | Aug 2002 | A1 |
20020184217 | Bisbee et al. | Dec 2002 | A1 |
20030028751 | McDonald et al. | Feb 2003 | A1 |
20030061432 | Huppenthal et al. | Mar 2003 | A1 |
20030120723 | Bright et al. | Jun 2003 | A1 |
20030226018 | Tardo et al. | Dec 2003 | A1 |
20040221127 | Ang | Nov 2004 | A1 |
20050273571 | Lyon et al. | Dec 2005 | A1 |
20050278409 | Kutzik et al. | Dec 2005 | A1 |
20050278680 | Mukherjee et al. | Dec 2005 | A1 |
20060016435 | Svensson et al. | Jan 2006 | A1 |
20060018341 | Pettery et al. | Jan 2006 | A1 |
20060085789 | Laborczfalvi et al. | Apr 2006 | A1 |
20060168435 | Svensson et al. | Jul 2006 | A1 |
20060224830 | Davis et al. | Oct 2006 | A1 |
20060226018 | Tardo et al. | Oct 2006 | A1 |
20070112999 | Oney et al. | May 2007 | A1 |
20070113227 | Oney et al. | May 2007 | A1 |
20070150665 | Arimilli et al. | Jun 2007 | A1 |
20070226807 | Ginter et al. | Sep 2007 | A1 |
20070255802 | Aloni et al. | Nov 2007 | A1 |
20070294505 | Traut et al. | Dec 2007 | A1 |
20080028103 | Schlansker et al. | Jan 2008 | A1 |
20080091855 | Moertl et al. | Apr 2008 | A1 |
20080114937 | Reid et al. | May 2008 | A1 |
20080183882 | Flynn et al. | Jul 2008 | A1 |
20080222396 | Spracklen et al. | Sep 2008 | A1 |
20080256330 | Wang et al. | Oct 2008 | A1 |
20080259086 | Doi et al. | Oct 2008 | A1 |
20080260297 | Chung et al. | Oct 2008 | A1 |
20080288747 | Inglett et al. | Nov 2008 | A1 |
20090024734 | Merbach et al. | Jan 2009 | A1 |
20090080428 | Witkowski et al. | Mar 2009 | A1 |
20090110326 | Kim et al. | Apr 2009 | A1 |
20090182976 | Agesen | Jul 2009 | A1 |
20090276601 | Kancheria | Nov 2009 | A1 |
20100036940 | Carey et al. | Feb 2010 | A1 |
20100058031 | Aho et al. | Mar 2010 | A1 |
20100058356 | Aho et al. | Mar 2010 | A1 |
20100064295 | Aho et al. | Mar 2010 | A1 |
20100107243 | Moyer et al. | Apr 2010 | A1 |
20100153541 | Arimilli et al. | Jun 2010 | A1 |
20100191711 | Carey et al. | Jul 2010 | A1 |
20100191822 | Archer et al. | Jul 2010 | A1 |
20100191823 | Archer et al. | Jul 2010 | A1 |
20100191909 | Archer et al. | Jul 2010 | A1 |
20100191917 | Archer et al. | Jul 2010 | A1 |
20100191923 | Archer et al. | Jul 2010 | A1 |
20100192123 | Carey et al. | Jul 2010 | A1 |
20100198997 | Archer et al. | Aug 2010 | A1 |
20100250877 | Gaither et al. | Sep 2010 | A1 |
20100274868 | Arroyo et al. | Oct 2010 | A1 |
20110035556 | Aho et al. | Feb 2011 | A1 |
20110225226 | Archer et al. | Sep 2011 | A1 |
20110225255 | Archer et al. | Sep 2011 | A1 |
20110225297 | Archer et al. | Sep 2011 | A1 |
20110238949 | Archer et al. | Sep 2011 | A1 |
20110239003 | Archer et al. | Sep 2011 | A1 |
20110267197 | Archer et al. | Nov 2011 | A1 |
20110271059 | Aho et al. | Nov 2011 | A1 |
20110271263 | Archer et al. | Nov 2011 | A1 |
20120191920 | Aho et al. | Jul 2012 | A1 |
20120192204 | Aho et al. | Jul 2012 | A1 |
20130060844 | Archer et al. | Mar 2013 | A1 |
20130179901 | Aho et al. | Jul 2013 | A1 |
20130238860 | Archer et al. | Sep 2013 | A1 |
Entry |
---|
Office Action, U.S. Appl. No. 12/360,930, Dec. 29, 2011. |
Office Action, U.S. Appl. No. 12/189,342, Jul. 26, 2011. |
Office Action, U.S. Appl. No. 12/204,352, Dec. 16, 2010. |
Final Office Action, U.S. Appl. No. 12/189,342, Dec. 23, 2010. |
Office Action, U.S. Appl. No. 12/362,137, Nov. 22, 2010. |
Office Action, U.S. Appl. No. 12/364,590, Nov. 26, 2010. |
Office Action, U.S. Appl. No. 12/361,910, Nov. 19, 2010. |
Office Action, U.S. Appl. No. 12/428,646, Feb. 7, 2011. |
Notice of Allowance, U.S. Appl. No. 12/204,352, Mar. 14, 2011. |
Final Office Action, U.S. Appl. No. 12/362,137, Apr. 25, 2011. |
Notice of Allowance, U.S. Appl. No. 12/364,590, Apr. 29, 2011. |
Notice of Allowance, U.S. Appl. No. 12/361,910, Apr. 5, 2011. |
Office Action, U.S. Appl. No. 12/204,391, Aug. 17, 2011. |
Office Action, U.S. Appl. No. 12/358,663, Oct. 5, 2011. |
Office Action, U.S. Appl. No. 12/359,383, Aug. 5, 2011. |
Office Action, U.S. Appl. No. 12/361,943, Sep. 21, 2011. |
Buonadonna, Phillip, Culler, David, “Queue Pair IP: A Hybrid Architecture For System Area Networks”, Aug. 7, 2002. Computer Architecture. 2002. Proceedings. 29th Annual Symposium. pp. 247-256. |
Brightwell, Rin, Doerfler, Doug, Underwood D., Keith, “A Preliminary Analysis of the Infiniband and XD1 Network Interfaces”, Jun. 26, 2006, Parallel and Distribution Processing Symposium, 2006. IPDPS 2006. 20th International, p. 8. |
Office Action, U.S. Appl. No. 12/189,342, Aug. 11, 2008. |
U.S. Appl. No. 12/204,842, Sep. 2008, Aho et al. |
U.S. Appl. No. 12/204,352, Sep. 2008, Aho et al. |
U.S. Appl. No. 12/204,391, Sep. 2008, Aho et al. |
U.S. Appl. No. 12/189,342, Aug. 2008, Carey et al. |
U.S. Appl. No. 12/358,663, Jan. 2009, Archer et al. |
U.S. Appl. No. 12/699,162, Feb. 2010, Archer et al. |
U.S. Appl. No. 12/362,137, Jan. 2009, Archer et al. |
U.S. Appl. No. 12/359,383, Jan. 2009, Archer et al. |
U.S. Appl. No. 12/361,943, Jan. 2009, Archer et al. |
U.S. Appl. No. 12/360,930, Jan. 2009, Carey et al. |
U.S. Appl. No. 12/364,590, Feb. 2009, Archer et al. |
U.S. Appl. No. 12/360,158, Jan. 2009, Carey et al. |
U.S. Appl. No. 12/537,377, Aug. 2009, Aho et al. |
U.S. Appl. No. 12/361,910, Jan. 2009, Archer et al. |
U.S. Appl. No. 12/428,646, Apr. 2009, Arroyo et al. |
U.S. Appl. No. 12/771,627, Apr. 2010, Aho et al. |
Rexford, Jennifer, Bonomi Flavio; Greenberg Albert, Wong Albert, “Scalable Architectures for Integrated Traffic Shaping and Link Scheduling in High-Speed ATM Switches”, Jun. 5, 1997, IEEE Journal on Selected Areas in Communications, vol. 15 No. 5, pp. 938-950. |
Rexford et al., “Scalable Architectures for Integrated Traffic Shaping and Link Scheduling in High-Speed ATM Switches”, IEEE Journal on Selected Areas in Communications, Jun. 5, 1997, pp. 938-950, vol. 15, No. 5, IEEE.org. |
Rabenseifner, “Some Aspects of Message-Passing on Future Hybrid Systems”, www.springerlink.com [online], 2008 [accessed online on Nov. 12, 2010], URL: http://www.springerlink.com/content/m12170217065w185/. |
Ball, “Introduction to Direct Memory Access”, www.eetimes.com [online], Oct. 14, 2003 [accessed Nov. 12, 2010], URL: http://www.eetimes.com/discussion/other/4024879/introduction-to-direct-memory-access. |
Notice of Allowance, U.S. Appl. No. 12/204,842, Mar. 19, 2012. |
Notice of Allowance, U.S. Appl. No. 12/204,391, Dec. 7, 2011. |
Final Office Action, U.S. Appl. No. 12/358,663, Mar. 21, 2012. |
Final Office Action, U.S. Appl. No. 12/359,383, Jan. 27, 2012. |
Final Office Action, U.S. Appl. No. 12/361,943, Jan. 31, 2012. |
Office Action, U.S. Appl. No. 12/360,158, Jan. 19, 2012. |
Notice of Allowance, U.S. Appl. No. 12/537,377, Jan. 13, 2012. |
Notice of Allowance, U.S. Appl. No. 12/248,646, Jun. 9, 2011. |
Office Action, U.S. Appl. No. 12/699,162, Apr. 27, 2012. |
Martellaro, “Using the Cell Processor as an Offload Streaming Assist for Sessionization of Network Traffic for Cross Packet Inspection”, Thesis, Aug. 2008, 70 pages, Rochester Institute of Technology, USA. |
Number | Date | Country | |
---|---|---|---|
20110191785 A1 | Aug 2011 | US |