1. Field of the Invention
The present disclosure relates generally to input/output (I/O) processing, and in particular, to providing an I/O operation that includes both input and output data.
2. Description of Background
Input/output (I/O) operations are used to transfer data between memory and I/O devices of an I/O processing system. Specifically, data is written from memory to one or more I/O devices, and data is read from one or more I/O devices to memory by executing I/O operations.
To facilitate processing of I/O operations, an I/O subsystem of the I/O processing system is employed. The I/O subsystem is coupled to main memory and the I/O devices of the I/O processing system and directs the flow of information between memory and the I/O devices. One example of an I/O subsystem is a channel subsystem. The channel subsystem uses channel paths as communications media. Each channel path includes a channel coupled to a control unit, the control unit being further coupled to one or more I/O devices.
The channel subsystem may employ channel command words (CCWs) to transfer data between the I/O devices and memory. A CCW specifies the command to be executed. For commands initiating certain I/O operations, the CCW designates the memory area associated with the operation, the action to be taken whenever a transfer to or from the area is completed, and other options.
During I/O processing, a list of CCWs is fetched from memory by a channel. The channel parses each command from the list of CCWs and forwards a number of the commands, each command in its own entity, to a control unit coupled to the channel. The control unit then processes the commands. The channel tracks the state of each command and controls when the next set of commands are to be sent to the control unit for processing. The channel ensures that each command is sent to the control unit in its own entity. Further, the channel infers certain information associated with processing the response from the control unit for each command.
Performing I/O processing on a per CCW basis may involve a large amount of processing overhead for the channel subsystem, as the channels parse CCWs, track state information, and react to responses from the control units. Therefore, it may be beneficial to shift much of the processing burden associated with interpreting and managing CCW and state information from the channel subsystem to the control units. Simplifying the role of channels in communicating between the control units and an operating system in the I/O processing system may increase communication throughput as less handshaking is performed. Simplifying the role of channels in communication may include grouping multiple commands into a single I/O operation. However, altering command sequences by grouping two or more commands together in a single I/O operation may result in the I/O operation having both input data and output data. Currently, an I/O operation can support a single data area that may be utilized for data input or data output, but not both within the same I/O operation. This limits the kinds of commands that can be grouped together in a single I/O operation and thus, limits the increase in throughput that can be gained by grouping commands. Accordingly, there is a need in the art to be able to transfer both input data and output data within a single I/O operation.
An exemplary embodiment includes a computer program product for facilitating input/output (I/O) processing for an I/O operation at a control unit coupled to an I/O device. The control unit is configured for communication with a host computer system including a memory associated with an operating system, the host computer system including a channel subsystem. The computer program product includes a non-transitory tangible storage medium readable by a processing circuit and storing instructions for execution by the processing circuit for performing a method including: receiving, by the control unit, a command block including at least one input command and at least one output command specified by a transport command word (TCW) and associated with the I/O operation, the I/O operation having both input and output data and associated with the TCW specifying a location in the memory of the output data and a location in the memory for storing the input data; receiving the output data specified by the TCW and executing the at least one output command; and forwarding the input data specified by the TCW to the channel subsystem for storage at a location specified by the TCW.
Another exemplary embodiment includes an apparatus for providing bi-directional data transfer within a single input/output (I/O) operation. The apparatus includes: a control unit coupled to an I/O device, the control unit configured for communication with a host computer system including a memory associated with an operating system, the host computer system including a channel subsystem configured to communicate with the control unit. The control unit is configured to perform a method including: receiving a command block from the channel subsystem, the command block including at least one input command and at least one output command specified by a transport command word (TCW) and associated with the I/O operation, the I/O operation having both input and output data, the TCW specifying a location in the memory of the output data and a location in the memory for storing the input data; receiving the output data specified by the TCW and executing the at least one output command; and forwarding the input data specified by the TCW to the channel subsystem for storage at a location specified by the TCW.
A further exemplary embodiment includes a method of facilitating input/output (I/O) processing for an I/O operation at a control unit coupled to an I/O device, the control unit configured for communication with a host computer system including a memory associated with an operating system, the host computer system including a channel subsystem. The method includes: receiving a command block from the channel subsystem, the command block including at least one input command and at least one output command specified by a transport command word (TCW) and associated with the I/O operation, the I/O operation having both input and output data, the TCW specifying a location in the memory of the output data and a location in the memory for storing the input data; receiving the output data specified by the TCW and executing the at least one output command; and forwarding the input data specified by the TCW to the channel subsystem for storage at a location specified by the TCW.
Other articles of manufacture, apparatuses, and/or methods according to embodiments will be or become apparent to one with skill in the art upon review of the following drawings and detailed description. It is intended that all such additional articles of manufacture, apparatuses, and/or methods be included within this description, be within the scope of the present invention, and be protected by the accompanying claims.
The subject matter which is regarded as the invention is particularly pointed out and distinctly claimed in the claims at the conclusion of the specification. The foregoing and other objects, features, and advantages of the invention are apparent from the following detailed description taken in conjunction with the accompanying drawings in which:
The detailed description explains the preferred embodiments of the invention, together with advantages and features, by way of example with reference to the drawings.
In accordance with an aspect of the present invention, input/output (I/O) processing is facilitated by allowing a single I/O operation to include both input data and output data. Thus, each I/O operation can be utilized to transfer both an input stream and an output stream. This facilitates I/O processing by reducing communications between components of an I/O processing system used to perform the I/O processing. For instance, the number of exchanges and sequences between an I/O communications adapter, such as a channel, and a control unit is reduced. This is accomplished by sending a plurality of commands from the I/O communications adapter to the control unit as a single entity for execution by the control unit, and by the control unit sending the data resulting from the commands, if any, as a single entity. The plurality of device command words (DCWs) sent as a single entity to a control unit may include both read and write commands.
The plurality of commands are included in a block, referred to herein as a transport command control block (TCCB), an address of which is specified in a transport control word (TCW). The TCW is sent from an operating system (OS) or other application to the I/O communications adapter, which in turn forwards the TCCB in a command message to the control unit for processing. The control unit processes each of the commands absent a tracking of status relative to those individual commands by the I/O communications adapter. The plurality of commands is also referred to as a channel program, which is parsed and executed on the control unit rather than the I/O communications adapter.
In an exemplary embodiment, the TCW provides the pointers to the channel for all of the control blocks required to execute the I/O operation. In an exemplary embodiment, the TCW includes pointers to both an input data address and an output data address. This allows data to be transferred in both directions (e.g., from a channel to a control unit and from a control unit to a channel) within a single I/O operation.
One example of an I/O processing system incorporating and using one or more aspects of the present invention is described with reference to
Main memory 102 stores data and programs, which can be input from I/O devices 112. For example, the main memory 102 may include one or more operating systems (OSs) 103 that are executed by one or more of the CPUs 104. For example, one CPU 104 can execute a Linux® operating system 103 and a z/OS® operating system 103 as different virtual machine instances. The main memory 102 is directly addressable and provides for high-speed processing of data by the CPUs 104 and the channel subsystem 108.
CPU 104 is the controlling center of the I/O processing system 100. It contains sequencing and processing facilities for instruction execution, interruption action, timing functions, initial program loading, and other machine-related functions. CPU 104 is coupled to the storage control element 106 via a connection 114, such as a bidirectional or unidirectional bus.
Storage control element 106 is coupled to the main memory 102 via a connection 116, such as a bus; to CPUs 104 via connection 114; and to channel subsystem 108 via a connection 118. Storage control element 106 controls, for example, queuing and execution of requests made by one or more of the CPU 104 and the channel subsystem 108.
In an exemplary embodiment, channel subsystem 108 provides a communication interface between host system 101 and control units 110. Channel subsystem 108 is coupled to storage control element 106, as described above, and to each of the control units 110 via a connection 120, such as a serial link. Connection 120 may be implemented in any manner known in the art, including an optical link, employing single-mode or multi-mode waveguides in a Fibre Channel fabric (e.g., a fibre channel network). Channel subsystem 108 directs the flow of information between I/O devices 112 and main memory 102. It relieves the CPUs 104 of the task of communicating directly with the I/O devices 112 and permits data processing to proceed concurrently with I/O processing. The channel subsystem 108 uses one or more channel paths 122 as the communication links in managing the flow of information to or from I/O devices 112. As a part of the I/O processing, channel subsystem 108 also performs the path-management functions of testing for channel path availability, selecting an available channel path 122 and initiating execution of the operation with the I/O devices 112.
Each channel path 122 includes a channel 124 (channels 124 are located within the channel subsystem 108, in one example, as shown in
Also located within channel subsystem 108 are subchannels (not shown). One subchannel is provided for and dedicated to each I/O device 112 accessible to a program through the channel subsystem 108. A subchannel (e.g., a data structure, such as a table) provides the logical appearance of a device to the program. Each subchannel provides information concerning the associated I/O device 112 and its attachment to channel subsystem 108. The subchannel also provides information concerning I/O operations and other functions involving the associated I/O device 112. The subchannel is the means by which channel subsystem 108 provides information about associated I/O devices 112 to CPUs 104, which obtain this information by executing I/O instructions.
Channel subsystem 108 is coupled to one or more control units 110. Each control unit 110 provides logic to operate and control one or more I/O devices 112 and adapts, through the use of common facilities, the characteristics of each I/O device 112 to the link interface provided by the channel 124. The common facilities provide for the execution of I/O operations, indications concerning the status of the I/O device 112 and control unit 110, control of the timing of data transfers over the channel path 122 and certain levels of I/O device 112 control.
Each control unit 110 is attached via a connection 126 (e.g., a bus) to one or more I/O devices 112. I/O devices 112 receive information or store information in main memory 102 and/or other memory. Examples of I/O devices 112 include card readers and punches, magnetic tape units, direct access storage devices, displays, keyboards, printers, pointing devices, teleprocessing devices, communication controllers and sensor based equipment, to name a few.
One or more of the above components of the I/O processing system 100 are further described in “IBM® z/Architecture Principles of Operation,” Publication No. SA22-7832-05, 6th Edition, April 2007; U.S. Pat. No. 5,461,721 entitled “System For Transferring Data Between I/O Devices And Main Or Expanded Storage Under Dynamic Control Of Independent Indirect Address Words (IDAWS),” Cormier et al., issued Oct. 24, 1995; and U.S. Pat. No. 5,526,484 entitled “Method And System For Pipelining The Processing Of Channel Command Words,” Casper et al., issued Jun. 11, 1996, each of which is hereby incorporated herein by reference in its entirety. IBM is a registered trademark of International Business Machines Corporation, Armonk, N.Y., USA. Other names used herein may be registered trademarks, trademarks or product names of International Business Machines Corporation or other companies.
In one embodiment, to transfer data between I/O devices 112 and memory 102, channel command words (CCWs) are used. A CCW specifies the command to be executed, and includes other fields to control processing. One example of a CCW is described with reference to
One or more CCWs arranged for sequential execution form a channel program, also referred to herein as a CCW channel program. The CCW channel program is set up by, for example, an operating system, or other software. The software sets up the CCWs and obtains the addresses of memory assigned to the channel program. An example of a CCW channel program is described with reference to
The processing of a CCW channel program is described with reference to
Referring to
The control unit 302 opens an exchange 308 with the channel 300, in response to the open exchange of the channel 300. This can occur before or after locate command 305 and/or read command 306. Along with the open exchange, a response (CMR) is forwarded to the channel 300. The CMR provides an indication to the channel 300 that the control unit 302 is active and operating.
The control unit 302 sends the requested data 310 to the channel 300. Additionally, the control unit 302 provides the status to the channel 300 and closes the exchange 312. In response thereto, the channel 300 stores the data, examines the status and closes the exchange 314, which indicates to the control unit 302 that the status has been received.
The processing of the above CCW channel program to read 4 k of data requires two exchanges to be opened and closed and seven sequences. The total number of exchanges and sequences between the channel and control unit is reduced through collapsing multiple commands of the channel program into a TCCB. The channel, e.g., channel 124 of
One example of a channel program to read 4 k of data, as in
The processing of a TCW channel program is described with reference to
The FCP defines the following terms, as recited in “Information Technology—Fibre Channel Protocol for SCSI, Third Version (FCP-3)”, pages 3-5:
N_Port: A hardware entity that supports the FC-FS-2 FC-2 layer. It may act as an Originator, a Responder, or both;
Originator: The logical function associated with an N_Port responsible for originating an Exchange;
Responder: The logical function in an N_Port responsible for supporting the Exchange initiated by the Originator in another N_Port;
Exchange: The basic mechanism that transfers information consisting of one or more related nonconcurrent Sequences that may flow in the same or opposite directions. The Exchange is identified by an Originator Exchange_ID (OX_ID) and a Responder Exchange_Identifier (RX_ID);
Sequence: A set of one or more Data frames with a common Sequence_ID (SEQ_ID), transmitted unidirectionally from one N_Port to another N_Port with a corresponding response, if applicable, transmitted in response to each Data frame; and
FCP_Port: An N_Port or NL_Port that supports the SCSI Fibre Channel Protocol.
Fibre Channel (FC) is logically a point-to-point serial data channel. The Fibre Channel Physical layer (FC-2 layer) described by FC-FS-2 performs those functions required to transfer data from one N_Port or NL_Port to another. An FC-4 mapping layer uses the services provided by FC-FS-2 to perform the functions defined by the FC-4. The protocol is described in terms of the stream of FC IUs and Exchanges generated by a pair of FCP_Ports that support the FC-4. The I/O operation defined by SAM-3 is mapped into a Fibre Channel Exchange. A Fibre Channel Exchange carrying information for a SCSI I/O operation is an FCP Exchange. The request and response primitives of an I/O operation are mapped into Information Units (IUs) as shown in table 1.
An application client begins an FCP I/O operation when it invokes a Send SCSI Command SCSI transport protocol service request or a Send Task Management Request SCSI transport protocol service request (see SAM-3). The Send SCSI Command SCSI transport protocol service request conveys a single request or a list of linked requests from the application client to the FCP service delivery subsystem. Each request contains all the information necessary for the processing of one SCSI command or task management function, including the local storage address and characteristics of data. The Fibre Channel Protocol then performs the following actions using FC-FS-2 services to perform the SCSI command or task management function. (FCP-3, p. 10)
The FCP_Port that is the initiator for the command starts an Exchange by sending an unsolicited command IU containing the FCP_CMND IU payload, including some command controls, addressing information, and the SCSI command descriptor block (CDB). The initiator FCP_Port sends the FCP_CMND IU payload to invoke the Send SCSI Command SCSI transport protocol service request (see SAM-3) and start the FCP I/O operation. The Exchange that is started is identified by its fully qualified exchange identifier (FQXID) during the remainder of the FCP I/O operation and is used only for the IUs associated with that FCP I/O operation. (FCP-3, p. 10)
After all the data has been transferred, the device server transmits the Send Command Complete protocol service response (described in SAM-3) by requesting the transmission of an IU containing the FCP_RSP IU payload. That payload contains the SCSI status and, if the SCSI status is CHECK CONDITION, the autosense data describing the condition. The FCP_RSP IU indicates completion of the SCSI command. If no command linking, error recovery, or confirmed completion is requested, the FCP_RSP IU is the final sequence of the Exchange. The device server determines whether additional linked commands are to be performed in the FCP I/O operation. If this is the last or only command processed in the FCP I/O operation, the FCP I/O operation and the Exchange are terminated. (FCP-3, p. 11)
Referring to
In a further example, to write 4 k of customer data, the channel 500 uses the FCP link protocol phases, as follows:
1. Transfer a TCCB in the FCP_CMND IU.
2. Transfer the IU of data, and sequence initiative to the control unit 502. (FCP Transfer Ready Disabled)
3. Final status is sent in a FCP status frame that has a bit active in, for instance, byte 10 or 11 of the FCP_RSP IU Payload. The FCP_RES_INFO field or sense field is used to transport FICON ending status along with additional status information.
By executing the TCW channel program of
The number of exchanges and sequences remain the same for a TCW channel program, even if additional commands are added to the program. Compare, for example, the communications of the CCW channel program of
As depicted in
Turning now to
The control unit 110 may further include other buffer or memory elements (not depicted) to store multiple messages or status information associated with communications between the channel 124 and the I/O device 112. For example, a register located on the control unit 110 may include a maximum control unit exchange parameter that defines the maximum number of open control unit exchanges that the control unit 110 supports.
The channel 124 in the channel subsystem 108 includes multiple elements to support communication with the control unit 110. In an exemplary embodiment, the CHN control logic 806 controls communication between the channel subsystem 108 and the control unit 110. The CHN control logic 806 may directly interface to the CU control logic 802 via the connection 120 to send commands and receive responses, such as transport command and response IUs. Alternatively, messaging interfaces and/or buffers (not depicted) can be placed between the CHN control logic 806 and the CU control logic 802.
An exemplary embodiment of a transport control word (TCW) 900 is depicted in
In an exemplary TCW 900 depicted in
The TCW 900 also includes a flags field 906. The first five bits of the flags field 906 are reserved for future use and are set to zero. The sixth bit of the flags field 906 is a TIDAL read flag. In an exemplary embodiment, the TIDAL read flag is set to one when the input-data address field 918 contains an address of a TIDAL. If the TIDAL read flag is set to zero, then the input-data address field 918 contains a data address. The seventh bit of the flags field 906 is a TCCB TIDAL flag. In an exemplary embodiment, the TCCB TIDAL flag is set to one when the TCCB address field 922 contains an address of a TIDAL. If the TCCB TIDAL flag is set to zero, then the TCCB address field 922 directly addresses the TCCB. The TCCB TIDAL flag allows the operating system software or the hyper-visor to layer function and prefix user channel programs. The eighth bit of the flags field 906 is a TIDAL write flag. In an exemplary embodiment, the TIDAL write flag is set to one when the output-data address field 916 contains an address of a TIDAL. If the TIDAL write flag is set to zero, then the output-data address field 916 contains a data address.
The ninth through twenty-forth bits of the flags field 906 are reserved for future use.
The TCW 900 also includes a TCCB length field 910 which indirectly represents the length of the TCCB and may be utilized to determine the actual length of the TCCB.
The read/write bits 912 in the TCW 900 are utilized to indicate whether data is being read and/or written as a result of executing the TCW 900. In an exemplary embodiment, the read bit in the read/write 912 bits is set to one to indicate that input data is being transferred from an I/O device 112 to system storage (e.g., main memory 102) in the host system 101 as a result of executing the TCW 900. The write bit in the read/write bits 912 is set to one to indicate that output data is being transferred from system storage (e.g., main memory 102) in the host system 101 to an I/O device as a result of executing the TCW 900.
The output-data address field 916 includes the address for the output data (if any). As described previously, the contents of the output-data address field 916 may be an address of a TIDAL for output data (e.g., an indirect address) or the actual address of the output data (e.g., a direct address). The input-data address field 918 includes the address for the input data (if any). As described previously, the contents of the input-data address field 918 may be an address of a TIDAL for input data or the actual address of the input data. In an exemplary embodiment, the output-data address field 916 and the input data address field 918 are implemented as sixty-four bit addresses.
The TCW 900 also includes a transport-status-block address field 920. A portion (e.g., the extended status part) of a completion status in a transport response IU for an I/O operation is stored at this address. The TCCB address field 922 in the TCW 900 includes an address where the TCCB is located in system storage. As described previously, the TCCB is the control block where the DCWs to be executed for the TCW 900 reside. Also as described previously, the contents of the TCCB address field 922 may be an address of a TIDAL for the TCCB or the actual address of the TCCB. In an exemplary embodiment, the transport-status-block address field 920 and the TCCB address field 922 are implemented as sixty-four bit addresses.
The output count field 924 in the TCW 900 indicates the amount of output data to be transferred by the TCW/TCCB for an output operation. In an exemplary embodiment, the output count field 924 specifies the number of bytes in the output storage area designed by the TCW (the output-data address 916) to be transferred. The input count field 926 in the TCW 900 indicates the amount of input data to be transferred by the TCW/TCCB for an input operation. In an exemplary embodiment, the input count field 926 specifies the number of bytes in the output storage area designed by the TCW (the input-data address 918) to be transferred. Several additional fields in the TCW 900 are reserved: reserved field 928, reserved field 930 and reserved field 932. The interrogate-TCW address field 934 contains the address of another TCW and is used by the channel 124 to interrogate that state of an operation under the initiative of a cancel sub-channel I/O instruction.
The TCW depicted in
The processing of the TCW channel program 1000 depicted in
At block 1206, the output data is gathered from the location specified by the TCW (if the write bit in the read/write bits 912 is set to one). The amount of data gathered to be included in the output data is based on the value of the output data count field 924. As described previously, the output data address may be a direct address of the output data or an indirect address of the output data. An indirect address refers to an address containing a list of one or more addresses (e.g., a TIDAL) that point to a plurality of storage locations that collectively make up the output data. A direct address refers to an address containing the output data. In an exemplary embodiment, the TIDAL write flag in the flags field 906 in the TCW is set to one when the output-data address field 916 contains an address of a TIDAL, and set to zero when the output-data address field 916 contains the address of the output data.
At block 1208, the output data is forwarded to the control unit. For this example XFER_RDY is disabled.
At block 1210, input data is received from the control unit as a result of executing the I/O operation. At block 1212, the input data is stored at the location specified by the TCW (the input-data address 918). In an exemplary embodiment, the TCW includes input data when the read bit in the read/write bits 912 is set to one. As described previously, the input data-address 918 may be a direct address for storing the input data, or alternatively it may be an address to a list of addresses (e.g., a TIDAL or indirect address) that point to a plurality of storage locations, each storing portions of the input data. In an exemplary embodiment, the TIDAL read flag in the flags field 906 in the TCW is set to one when the input-data address field 918 contains an address of a TIDAL, and set to zero when the input-data address field 918 contains the address of the input data.
Technical effects of exemplary embodiments include the ability to include both input and output data in a single I/O operation. This provides flexibility in grouping DCWs and may lead to a decrease in the number of exchanges required between a channel and a control unit.
As described above, embodiments can be embodied in the form of computer-implemented processes and apparatuses for practicing those processes. In exemplary embodiments, the invention is embodied in computer program code executed by one or more network elements. Embodiments include a computer program product 1300 as depicted in
While the invention has been described with reference to exemplary embodiments, it will be understood by those skilled in the art that various changes may be made and equivalents may be substituted for elements thereof without departing from the scope of the invention. In addition, many modifications may be made to adapt a particular situation or material to the teachings of the invention without departing from the essential scope thereof. Therefore, it is intended that the invention not be limited to the particular embodiment disclosed as the best mode contemplated for carrying out this invention, but that the invention will include all embodiments falling within the scope of the appended claims. Moreover, the use of the terms first, second, etc. do not denote any order or importance, but rather the terms first, second, etc. are used to distinguish one element from another. Furthermore, the use of the terms a, an, etc. do not denote a limitation of quantity, but rather denote the presence of at least one of the referenced item.
This application is a continuation of U.S. patent application Ser. No. 13/075,993, filed Mar. 30, 2011, which is a continuation of U.S. patent application Ser. No. 12/030,954, filed Feb. 14, 2008, the disclosures of which are incorporated by reference herein in their entirety.
Number | Name | Date | Kind |
---|---|---|---|
3693161 | Price et al. | Sep 1972 | A |
3943283 | Caragliano et al. | Mar 1976 | A |
4004277 | Gavril | Jan 1977 | A |
4080649 | Calle et al. | Mar 1978 | A |
4207609 | Luiz et al. | Jun 1980 | A |
4374415 | Cormier et al. | Feb 1983 | A |
4380046 | Frosch et al. | Apr 1983 | A |
4455605 | Cormier et al. | Jun 1984 | A |
4497022 | Cormier et al. | Jan 1985 | A |
4564903 | Guyette et al. | Jan 1986 | A |
4760518 | Potash et al. | Jul 1988 | A |
4779188 | Gum et al. | Oct 1988 | A |
4837677 | Burrus, Jr. et al. | Jun 1989 | A |
4843541 | Bean et al. | Jun 1989 | A |
4866609 | Calta et al. | Sep 1989 | A |
4870566 | Cooper et al. | Sep 1989 | A |
5016160 | Lambeth et al. | May 1991 | A |
5031091 | Wakatsuki et al. | Jul 1991 | A |
5040108 | Kanazawa | Aug 1991 | A |
5170472 | Cwiakala et al. | Dec 1992 | A |
5185736 | Tyrrell et al. | Feb 1993 | A |
5237325 | Klein et al. | Aug 1993 | A |
5265240 | Galbraith et al. | Nov 1993 | A |
5297262 | Cox et al. | Mar 1994 | A |
5301323 | Maeurer et al. | Apr 1994 | A |
5317739 | Elko et al. | May 1994 | A |
5386512 | Crisman et al. | Jan 1995 | A |
5388219 | Chan et al. | Feb 1995 | A |
5410727 | Jaffe et al. | Apr 1995 | A |
5414851 | Brice, Jr. et al. | May 1995 | A |
5434980 | Casper et al. | Jul 1995 | A |
5440729 | Kimura et al. | Aug 1995 | A |
5452455 | Brown et al. | Sep 1995 | A |
5461721 | Cormier et al. | Oct 1995 | A |
5463736 | Elko et al. | Oct 1995 | A |
5465359 | Allen et al. | Nov 1995 | A |
5500942 | Eickemeyer et al. | Mar 1996 | A |
5517670 | Allen et al. | May 1996 | A |
5526484 | Casper et al. | Jun 1996 | A |
5528755 | Beardsley et al. | Jun 1996 | A |
5539918 | Allen et al. | Jul 1996 | A |
5546533 | Koyama | Aug 1996 | A |
5548791 | Casper et al. | Aug 1996 | A |
5561809 | Elko et al. | Oct 1996 | A |
5564040 | Kubala | Oct 1996 | A |
5568648 | Coscarella et al. | Oct 1996 | A |
5584039 | Johnson et al. | Dec 1996 | A |
5600793 | Nord | Feb 1997 | A |
5600805 | Fredericks et al. | Feb 1997 | A |
5608898 | Turpin et al. | Mar 1997 | A |
5613163 | Marron et al. | Mar 1997 | A |
5640600 | Satoh et al. | Jun 1997 | A |
5640603 | Meritt et al. | Jun 1997 | A |
5644712 | Coscarella et al. | Jul 1997 | A |
5671441 | Glassen et al. | Sep 1997 | A |
5680580 | Beardsley et al. | Oct 1997 | A |
5758190 | Johnson et al. | May 1998 | A |
5768620 | Johnson et al. | Jun 1998 | A |
5793983 | Albert et al. | Aug 1998 | A |
5812877 | Young | Sep 1998 | A |
5831985 | Sandorfi | Nov 1998 | A |
5845146 | Onodera | Dec 1998 | A |
5860022 | Kondou et al. | Jan 1999 | A |
5894583 | Johnson et al. | Apr 1999 | A |
5901327 | Ofek | May 1999 | A |
5907684 | Halma et al. | May 1999 | A |
5918028 | Silverthorn et al. | Jun 1999 | A |
5996026 | Onodera et al. | Nov 1999 | A |
6125399 | Hamilton | Sep 2000 | A |
6125411 | Sato | Sep 2000 | A |
6195330 | Sawey et al. | Feb 2001 | B1 |
6202095 | Beardsley et al. | Mar 2001 | B1 |
6230218 | Casper et al. | May 2001 | B1 |
6249787 | Schleimer et al. | Jun 2001 | B1 |
6263380 | Tsuboi et al. | Jul 2001 | B1 |
6338105 | Niizuma et al. | Jan 2002 | B1 |
6343335 | Dahman et al. | Jan 2002 | B1 |
6347334 | Fredericks et al. | Feb 2002 | B1 |
6351779 | Berg et al. | Feb 2002 | B1 |
6353612 | Zhu et al. | Mar 2002 | B1 |
6460087 | Saito et al. | Oct 2002 | B1 |
6484217 | Fuente et al. | Nov 2002 | B1 |
6546435 | Yoshimura et al. | Apr 2003 | B1 |
6584511 | Marsh, III et al. | Jun 2003 | B1 |
6609161 | Young | Aug 2003 | B1 |
6609165 | Frazier | Aug 2003 | B1 |
6647016 | Isoda et al. | Nov 2003 | B1 |
6651125 | Maergner et al. | Nov 2003 | B2 |
6654954 | Hicks | Nov 2003 | B1 |
6658603 | Ward | Dec 2003 | B1 |
6687766 | Casper et al. | Feb 2004 | B1 |
6693880 | Gregg et al. | Feb 2004 | B2 |
6694390 | Bogin et al. | Feb 2004 | B1 |
6751680 | Langerman et al. | Jun 2004 | B2 |
6751683 | Johnson et al. | Jun 2004 | B1 |
6769009 | Reisman | Jul 2004 | B1 |
6772207 | Dorn et al. | Aug 2004 | B1 |
6826661 | Umbehocker et al. | Nov 2004 | B2 |
6839773 | Vishlitzky et al. | Jan 2005 | B2 |
6862322 | Ewen et al. | Mar 2005 | B1 |
6877043 | Mallory et al. | Apr 2005 | B2 |
6882634 | Bagchi et al. | Apr 2005 | B2 |
6898202 | Gallagher et al. | May 2005 | B2 |
6910149 | Perloff et al. | Jun 2005 | B2 |
6915378 | Roberti | Jul 2005 | B2 |
6950888 | Rooney et al. | Sep 2005 | B1 |
6963940 | Glassen et al. | Nov 2005 | B1 |
7000036 | Carlson et al. | Feb 2006 | B2 |
7003700 | Elko et al. | Feb 2006 | B2 |
7020810 | Holman | Mar 2006 | B2 |
7035540 | Finan et al. | Apr 2006 | B2 |
7046665 | Walrand et al. | May 2006 | B1 |
7058735 | Spencer | Jun 2006 | B2 |
7085860 | Dugan et al. | Aug 2006 | B2 |
7100096 | Webb, Jr. et al. | Aug 2006 | B2 |
7111130 | Blake et al. | Sep 2006 | B2 |
7120728 | Krakirian et al. | Oct 2006 | B2 |
7124207 | Lee et al. | Oct 2006 | B1 |
7133988 | Fujibayashi | Nov 2006 | B2 |
7142520 | Haverinen et al. | Nov 2006 | B1 |
7149823 | Miller et al. | Dec 2006 | B2 |
7155569 | Johnson et al. | Dec 2006 | B2 |
7164425 | Kwak et al. | Jan 2007 | B2 |
7174274 | Carlson et al. | Feb 2007 | B2 |
7202801 | Chou | Apr 2007 | B2 |
7266296 | Ovadia et al. | Sep 2007 | B2 |
7277387 | Sanders et al. | Oct 2007 | B2 |
7292597 | Mills et al. | Nov 2007 | B2 |
7315911 | Davies et al. | Jan 2008 | B2 |
7373435 | Carlson et al. | May 2008 | B2 |
7382733 | Banerjee et al. | Jun 2008 | B2 |
7395284 | Sato et al. | Jul 2008 | B2 |
7398335 | Sonksen et al. | Jul 2008 | B2 |
7484021 | Rastogi et al. | Jan 2009 | B2 |
7500023 | Casper et al. | Mar 2009 | B2 |
7500030 | Hathorn et al. | Mar 2009 | B2 |
7502873 | Casper et al. | Mar 2009 | B2 |
7512133 | Dugan et al. | Mar 2009 | B2 |
7516248 | Carlson et al. | Apr 2009 | B2 |
7539777 | Aitken | May 2009 | B1 |
7543087 | Philbrick et al. | Jun 2009 | B2 |
7555554 | Manders et al. | Jun 2009 | B2 |
7558827 | Kawashima et al. | Jul 2009 | B2 |
7564791 | Jayakrishnan et al. | Jul 2009 | B2 |
7577772 | Sonksen et al. | Aug 2009 | B2 |
7577773 | Gandhi et al. | Aug 2009 | B1 |
7594057 | Gandhi et al. | Sep 2009 | B1 |
7599360 | Edsall et al. | Oct 2009 | B2 |
7600053 | Carlson et al. | Oct 2009 | B2 |
7711871 | Haechten et al. | May 2010 | B1 |
7743197 | Chavan et al. | Jun 2010 | B2 |
7765336 | Butler et al. | Jul 2010 | B2 |
7826349 | Kaur et al. | Nov 2010 | B2 |
7840717 | Flanagan et al. | Nov 2010 | B2 |
7840718 | Ricci et al. | Nov 2010 | B2 |
7840719 | Casper et al. | Nov 2010 | B2 |
7856511 | Ricci et al. | Dec 2010 | B2 |
8495253 | Flanagan et al. | Jul 2013 | B2 |
20010030943 | Gregg et al. | Oct 2001 | A1 |
20020032810 | Wagner | Mar 2002 | A1 |
20020062407 | Tateyama et al. | May 2002 | A1 |
20020099967 | Kawaguchi | Jul 2002 | A1 |
20020152338 | Elliott et al. | Oct 2002 | A1 |
20020178404 | Austen et al. | Nov 2002 | A1 |
20030056000 | Mullendore et al. | Mar 2003 | A1 |
20030084213 | Brice, Jr. et al. | May 2003 | A1 |
20030103504 | Dugan et al. | Jun 2003 | A1 |
20030158998 | Smith | Aug 2003 | A1 |
20030187627 | Hild et al. | Oct 2003 | A1 |
20030188053 | Tsai | Oct 2003 | A1 |
20030208581 | Behren et al. | Nov 2003 | A1 |
20040030822 | Rajan et al. | Feb 2004 | A1 |
20040054776 | Klotz et al. | Mar 2004 | A1 |
20040113772 | Hong Chou | Jun 2004 | A1 |
20040125960 | Fosgate et al. | Jul 2004 | A1 |
20040136241 | Rapp et al. | Jul 2004 | A1 |
20040151160 | Sanders et al. | Aug 2004 | A1 |
20040193968 | Dugan et al. | Sep 2004 | A1 |
20040210719 | Bushey et al. | Oct 2004 | A1 |
20040230706 | Carlson et al. | Nov 2004 | A1 |
20040260851 | Tu | Dec 2004 | A1 |
20050018673 | Dropps et al. | Jan 2005 | A1 |
20050102456 | Kang | May 2005 | A1 |
20050105456 | Cookson et al. | May 2005 | A1 |
20050108251 | Hunt | May 2005 | A1 |
20050175341 | Ovadia | Aug 2005 | A1 |
20050193029 | Rom et al. | Sep 2005 | A1 |
20050204069 | Carlson et al. | Sep 2005 | A1 |
20050216617 | Carlson et al. | Sep 2005 | A1 |
20050223291 | Zimmer et al. | Oct 2005 | A1 |
20050229033 | Tanaka et al. | Oct 2005 | A1 |
20050257118 | Shien | Nov 2005 | A1 |
20060036769 | Frey et al. | Feb 2006 | A1 |
20060050726 | Ahmed et al. | Mar 2006 | A1 |
20060075154 | Carlson et al. | Apr 2006 | A1 |
20060085595 | Slater | Apr 2006 | A1 |
20060159112 | Sundaram et al. | Jul 2006 | A1 |
20060224795 | Muto et al. | Oct 2006 | A1 |
20070005838 | Chang et al. | Jan 2007 | A1 |
20070016554 | Dapp et al. | Jan 2007 | A1 |
20070061463 | Hiramatsu et al. | Mar 2007 | A1 |
20070072543 | Paila et al. | Mar 2007 | A1 |
20070079022 | Carlson et al. | Apr 2007 | A1 |
20070079051 | Tanaka et al. | Apr 2007 | A1 |
20070091497 | Mizuno et al. | Apr 2007 | A1 |
20070162631 | Balakrishnan et al. | Jul 2007 | A1 |
20070174544 | Yasuda et al. | Jul 2007 | A1 |
20070239944 | Rupanagunta et al. | Oct 2007 | A1 |
20070294697 | Theimer et al. | Dec 2007 | A1 |
20080040519 | Starr et al. | Feb 2008 | A1 |
20080043563 | Brice et al. | Feb 2008 | A1 |
20080059638 | Hathorn et al. | Mar 2008 | A1 |
20080103754 | Carlson et al. | May 2008 | A1 |
20080103755 | Carlson et al. | May 2008 | A1 |
20080109580 | Carlson et al. | May 2008 | A1 |
20080147889 | Casper et al. | Jun 2008 | A1 |
20080147890 | Casper et al. | Jun 2008 | A1 |
20080183877 | Carlson et al. | Jul 2008 | A1 |
20080235553 | Chintada | Sep 2008 | A1 |
20080256264 | Muto et al. | Oct 2008 | A1 |
20080273518 | Pratt | Nov 2008 | A1 |
20080307122 | Butler et al. | Dec 2008 | A1 |
20090049241 | Ohno et al. | Feb 2009 | A1 |
20090055585 | Fernandes et al. | Feb 2009 | A1 |
20090144586 | Casper et al. | Jun 2009 | A1 |
20090172203 | Casper et al. | Jul 2009 | A1 |
20090210557 | Gainey, Jr. et al. | Aug 2009 | A1 |
20090210559 | Flanagan et al. | Aug 2009 | A1 |
20090210560 | Yudenfriend et al. | Aug 2009 | A1 |
20090210561 | Ricci et al. | Aug 2009 | A1 |
20090210562 | Huang et al. | Aug 2009 | A1 |
20090210563 | Flanagan et al. | Aug 2009 | A1 |
20090210564 | Ricci et al. | Aug 2009 | A1 |
20090210570 | Bendyk et al. | Aug 2009 | A1 |
20090210571 | Casper et al. | Aug 2009 | A1 |
20090210572 | Yudenfriend et al. | Aug 2009 | A1 |
20090210573 | Yudenfriend et al. | Aug 2009 | A1 |
20090210576 | Casper et al. | Aug 2009 | A1 |
20090210579 | Bendyk et al. | Aug 2009 | A1 |
20090210580 | Bendyk et al. | Aug 2009 | A1 |
20090210581 | Flanagan et al. | Aug 2009 | A1 |
20090210582 | Bendyk et al. | Aug 2009 | A1 |
20090210583 | Bendyk et al. | Aug 2009 | A1 |
20090210584 | Carlson et al. | Aug 2009 | A1 |
20090210585 | Ricci et al. | Aug 2009 | A1 |
20090210768 | Carlson et al. | Aug 2009 | A1 |
20090210769 | Casper et al. | Aug 2009 | A1 |
20090210884 | Ricci et al. | Aug 2009 | A1 |
20090307388 | Tchapda | Dec 2009 | A1 |
20100014526 | Chavan et al. | Jan 2010 | A1 |
20100064072 | Tang et al. | Mar 2010 | A1 |
Number | Date | Country |
---|---|---|
3931514 | Mar 1990 | DE |
1264096 | Feb 1972 | GB |
2291990 | Sep 1995 | GB |
2291990 | Feb 1996 | GB |
63236152 | Oct 1988 | JP |
2010-140127 | Jun 2010 | JP |
2006102664 | Sep 2006 | WO |
Entry |
---|
U.S. Appl. No. 12/031,201 Final Office Action dated Jun. 13, 2011. |
U.S. Appl. No. 12/946,514, Non-Final Office Action Mailed Jun. 23, 2011. |
U.S. Appl. No. 12/183,323, Notice of Allowance Mailed Jun. 23, 2011. |
U.S. Appl. No. 12/031,201 Non-Final Office Action dated Jan. 25, 2010. |
U.S. Appl. No. 12/030,989 Final Office Action dated May 24, 2010. |
U.S. Appl. No. 12/183,315, Notice of Allowance Mailed on Jun. 15, 2010. |
International Search Report; International Application No. PCT/EP2009/059184; International Filing Date: Jul. 16, 2009; Date of mailing: Jan. 14, 2010; 9 pages. |
“Protocol for Insochronous Traffic Over Fiber Channel Switching”; IBM Technical Disclosure Bulletin; vol. 37, No. 06B; Jun. 1994. pp. 377-380. |
Golasky, Richard; “Link-Level Error Recovery With Tape Backup”; Dell Power Solutions; Aug. 2005; pp. 88-91. |
Sachs, M.W.; “I/O Marker Changing”; IBM Technical Disclosure Bulletin; vol. 37, No. 02A; Feb. 1994; pp. 75-76. |
SCSI Primary Commands—4 (SPC-4); Project T10/1731-D. Rev 11. INCITS Apr. 14, 2010, 785 pages (Part 1, pp. 1-390, Part 2, pp. 391-785). |
Simmons et al.; “A Performance Comparison of Three Supercomputers: Fujitsu VP-2600, NEC SX-3, and CRAY Y-MP”; ACM, Conference on High Performance Networking and Computing, Proceedings of the 1991 ACM/IEEE conference on Supercomputing, Albuquerque, New Mexico; Jul. 1991; pp. 150-157. |
Snively, et al.; “Fibre Channel, Framing and Signaling”; (FC-FS) Rev. 1.70; NCITS Working Draft Proposed American National Standard for Information Technology; Feb. 2002; pp. i-575. |
Snively et al.; Fibre Channel Single Byte Command Code Sets-3 Mapping Protocol (FC-SB-3); T11/Project 1357-D/Rev. 1.6, INCITS; Mar. 2003; pp. 1-206. |
Srikrishnan et al.; “Sharing FCP Adapters Through Virtualization”; IBM J. Res. & Dev., vol. 51, No. 1/2; Jan./Mar. 2007; pp. 103-118. |
Stone, et al.; “When The CRC and TCP Checksum Disagree”; SIGCOMM '00, Stockholm, Sweden; Jul. 2000; 10 pages. |
Laudon et al. •System Overview of the SGI Origin 200/2000 Product Line, 1997, iEEE Publication pp. 150-156. |
Tachikawa, T., et al. “ARQ protocols for bi-directional data transmission,” Information Networking, 1998 (ICOIN-12) Proceedings., Twelfth International Conference on., vol., No., pp. 468-473, Jan. 21-23, 1998. |
U.S. Appl. No. 12/183,323, filed on Jul. 31, 2008. |
U.S. Appl. No. 12/030,939 Notice of Alllowance mailed Jun. 29, 2010. |
U.S. Appl. No. 12/030,954 Non Final Office Action mailed Jul. 12, 2010. |
U.S. Appl. No. 12/030,961 Final Office Action mailed Jul. 12, 2010. |
U.S. Appl. No. 12/030,993 Non Final Office Action mailed Jun. 28, 2010. |
U.S. Appl. No. 12/031,021 Notice of Allowance mailed Jul. 8, 2010. |
U.S. Appl. No. 12/031,023 Non Final Office Action mailed Jun. 11, 2010. |
U.S. Appl. No. 12/183,323 Non Final Office Action mailed Jul. 19, 2010. |
U.S. Appl. No. 12/392,246 Notice of Allowance mailed Jul. 15, 2010. |
Z/Architecture, “Principles of Operation SA 22-7832-01 International Business Machines Corporation,” 2nd Edition, Oct. 2001, pp. 1-1024. |
“Z/Architecture-Principles of Operation,” IBM Publication No. SA22-7832-04, 5th Ed., Sep. 2005, pp. 1-1144. |
U.S. Appl. No. 12/030,954 Non-Final Office Action dated Jan. 21, 2010. |
U.S. Appl. No. 12/031,042, Final Office Action Mailed Oct. 25, 2010. |
U.S. Appl. No. 12/031,042, Non-Final Office Action Mailed Apr. 5, 2010. |
U.S. Appl. No. 12/031,021, Notice of Allowance Mailed Apr. 30, 2010. |
U.S. Appl. No. 12/181,662, Notice of Allowance Mailed Aug. 4, 2010. |
U.S. Appl. No. 12/364,615, Non Final Office Action Mailed Oct. 7, 2010. |
U.S. Appl. No. 12/364,615, Notice of Allowance Mailed Mar. 10, 2011. |
U.S. Appl. No. 12/183,305, Non-Final Office Action Mailed May 11, 2010. |
U.S. Appl. No. 12/183,305, Notice of Allowance Mailed Nov. 1, 2010. |
U.S. Appl. No. 12/183,315, Notice of Allowance Mailed Dec. 13, 2010. |
U.S. Appl. No. 12/183,315 Notice of Allowance dated Sep. 15, 2010. |
U.S. Appl. No. 12/183,323, Non-Final Office Action Mailed Jan. 3, 2011. |
IBM, “Method and Apparatus to Monitor PAV Utilization”, Feb. 2005, pp. 1-3. http://priorartdatabase.com/IPCOM/000082878. |
IBM® z/Architecture Principles of Operation, Publication No. SA22-7832-05, 6th Edition, Apr. 2007. 1,215 pages separated into 4 electronic attachments—Part 1. |
IBM® z/Architecture Principles of Operation, Publication No. SA22-7832-05, 6th Edition, Apr. 2007. 1,215 pages separated into 4 electronic attachments. Part 2. |
IBM® z/Architecture Principles of Operation, Publication No. SA22-7832-05, 6th Edition, Apr. 2007. 1,215 pages separated into 4 electronic attachments. Part 3. |
IBM® z/Architecture Principles of Operation, Publication No. SA22-7832-05, 6th Edition, Apr. 2007. 1,215 pages separated into 4 electronic attachments. Part 4. |
Z/Series Input/Output Configuration Program users Guide for IYP IOCP, SB10-7029-03c. International Business Machines Corporation, Jun. 2003, pp. 1-372. |
Iren, et al.; “The Transport Layer: Tutorial and Survey”; ACM Computing Surveys; vol. 31, No. 4; Dec. 1999; pp. 360-405. |
Ishikawa, Hikaru, et al. “Bi-Directional OFDM Transmission using Adaptive Modulation that spreads Data Symbols”. Power Line Communications and its Applications, 2006, IEEE International Symposium on, vol., No., pp. 202-207. |
International Search Report and Written Opinion for PCT/EP2009/051447 dated Jul. 1, 2009. |
International Search Report and Written Opinion for PCT/EP2009/051483 dated Jul. 27, 2009. |
Written Opinion and International Search Report for PCT/EP2009/051445 dated Jun. 25, 2009. |
Written Opinion and International Search Report for PCT/EP2009/051446 dated Jun. 25, 2009. |
Written Opinion and International Search Report for PCT/EP2009/051461 dated Sep. 22, 2009. |
Written Opinion and International Search Report for PCT/EP2009/051462 dated Jul. 1, 2009. |
Written Opinion and International Search Report for PCT/EP2009/051450 dated Jul. 7, 2009. |
Written Opinion and International Search Report for PCT/EP2009/051459 dated Jun. 23, 2009. |
Written Opinion and International Search Report for PCT/EP2009/051463 dated Jul. 22, 2009. |
Moore et al., Reconfiguration of Storage Elements to Improve Performance, IBM, Dec. 1983, pp. 1-3. http://priorartdatabas.com/IPCOM/000047719. |
Nordstrom.; “Sequence Reception Method for a Fibre Channel Protocol Chip”; IBM Technical Disclosure Bulletin; vol. 38, No. 12; Dec. 1995; pp. 267-269. |
Peterson; “Information Techonology, Fibre Channel Protocol for SCSI, Fourth Version (FCP-3)”, Draft Proposed American National Standard, Jun. 2004; pp. 1-142. |
Patent No. 7,000,036 Notice of Allowance dated Feb. 3, 2006. |
Patent No. 7,000,036 Non-Final Office Action dated Jul. 15, 2005. |
Patent No. 7,174,274 Non-Final Office Action dated Jun. 8, 2006. |
Patent No. 7,174,274 Non-Final Office Action dated Jun. 21, 2006. |
Patent No. 7,174,274 Notice of Allowance Sep. 13, 2007. |
Patent No. 7,174,274 Notice of Allowance Dec. 27, 2006. |
U.S. Appl. No. 11/126,728 Non-Final Office Action Apr. 16, 2007. |
Patent No. 7,373,435 Non-Final Office Action Jun. 11, 2007. |
Patent No. 7,373,435 Non-Final Office Action Sep. 13, 2007. |
Patent No. 7,373,435 Notice of Allowance dated Apr. 30, 2008. |
U.S. Appl. No. 11/469,573 Non-Final Office Action dated Apr. 11, 2008. |
Patent No. 7,600,053 Non-Final Office Action dated Mar. 17, 2009. |
Patent No. 7,600,053 Notice of Allowance dated Aug. 26, 2009. |
U.S. Appl. No. 11/965,866 Non-Final Office Action dated Jun. 3, 2010. |
Patent No. 7,516,248 Notice of Allowance Feb. 20, 2009. |
U.S. Appl. No. 11/548,060 Non-Final Office Action dated Apr. 15, 2008. |
U.S. Appl. No. 11/548,093 Non-Final Office Action dated Apr. 17, 2008. |
U.S. Appl. No. 12/031,182 Non-Final Office Action dated Jan. 22, 2010. |
U.S. Appl. No. 12/183,315, filed Jul. 31, 2008. |
U.S. Appl. No. 12/030,967 Restriction Requirement Mailed Dec. 29, 2009. |
U.S. Appl. No. 12/183,305, filed Jul. 31, 2008. |
ANSI INCITS 433-2007, Information Technology Fibre Channel Link Services (FC-LS), Jul. 2007, pp. 1-211. |
Behrs, JR, “Adaptive Prediction Minimizes Data Overrun and Underrun”, IBM, Nov. 1994, pp. 1-3. http://priorartdatabase.com/IPCOM/000114189. |
Cakmakci, Melih, et al. “Bi-Directional Communication amoung “Smart” Compoents in a Networked Control System”, University of Michigan: Department of Mechanical Engineering, 2005 American control conference, Jun. 8-10, 2005, Portland, OR, pp. 627-632. |
Meritt, A.S. and J.H. Sorg, “Correction of Channel Measurement Data Caused by Control Unit Queuing,” IBM Technical Disclosure Bulletin, vol. 33, No. 11, Apr. 1991, pp. 100-103. |
Dauby, et al. “Contention Resolution Between Two Processors”; IBM Technical Disclosure Bulletin; vol. 26; No. 10A; Mar. 1984; 3 pages. |
DeVeer, J.A.; “Control Frame Multiplexing on Serial I/O Channels”; IBM Technical Disclosure Bulletin; vol. 32; No. 10A; Mar. 1990; pp. 39-40. |
Fibre Channel Single Byte Command Code Sets-2 Mapping Protocol (FC-SB-3), T11/Project 1357-D/Rev 1.6, INCITS Mar. 2003, pp. 1-206. |
“Information Technology-Fibre Channel Protocol for SCSI, Third Version (FCP-3),” T10 Project 1560-D, Revision 4g, Sep. 13, 2005, pp. 1-140. |
U.S. Appl. No. 12/031,038 Non-Final Office Action dated Nov. 16, 2009. |
U.S. Appl. No. 12/030,912 Non-Final Office Action dated Mar. 18, 2010. |
U.S. Appl. No. 12/030,920 Non-Final Office Action dated Feb. 23, 2010. |
U.S. Appl. No. 12/030,975 Non-Final Office Action dated Oct. 22, 2009. |
U.S. Appl. No. 12/030,932 Non-Final Office Action dated Dec. 16, 2009. |
U.S. Appl. No. 12/031,023 Non-Final Office Action dated Oct. 29, 2009. |
U.S. Appl. No. 12/030,951 Non-Final Office Action dated May 20, 2010. |
U.S. Appl. No. 12/030,951 Non-Final Office Action dated Nov. 23, 2009. |
U.S. Appl. No. 12/030,961 Non-Final Office Action dated Dec. 17, 2009. |
U.S. Appl. No. 12/030,939 Non-Final Office Action dated Nov. 16, 2009. |
U.S. Appl. No. 12/030,989 Non-Final Office Action dated Oct. 22, 2009. |
U.S. Appl. No. 12/030,993 Non-Final Office Action dated Oct. 28, 2009. |
U.S. Appl. No. 12/031,021 Non-Final Office Action dated Jan. 8, 2010. |
U.S. Appl. No. 12/181,662—Non-Final Office Action dated Jun. 18, 2009. |
U.S. Appl. No. 12/181,662—Final Office Action dated Jan. 4, 2010. |
U.S. Appl. No. 12/031,038, Notice of Allowance Mailed Oct. 6, 2010. |
U.S. Appl. No. 12/031,038, Non-Final Office Action Mailed Apr. 15, 2010. |
U.S. Appl. No. 12/030,912; Final Office Action; mailed Oct. 6, 2010. |
U.S. Appl. No. 12/031,182 Final Office Action Mailed Jul. 22, 2010. |
U.S. Appl. No. 12/031,182, Non Final Office Action Mailed Dec. 23, 2010. |
U.S. Appl. No. 12/030,920, Notice of Allowance Mailed Dec. 28, 2010. |
U.S. Appl. No. 12/030,920 Notice of Allowance Mailed Aug. 23, 2010. |
U.S. Appl. No. 12/030,954, Notice of Allowance mailed Dec. 28, 2010. |
U.S. Appl. No. 12/030,975; Final Office Action Mailed May 13, 2010. |
U.S. Appl. No. 12/030,975, Notice of Allowance Mailed Oct. 19, 2010. |
U.S. Appl. No. 12/030,932, Final Office Action Mailed Jul. 23, 2010. |
U.S. Appl. No. 12/030,932, Non-Final Office Action Mailed Dec. 16, 2010. |
U.S Appl. No. 12/031,023, Final Office Action Mailed Nov. 18, 2010. |
U.S. Appl. No. 12/030,951, Final Office Action Mailed Oct. 26, 2010. |
U.S. Appl. No. 12/030,951, Notice of Allowance Mailed Apr. 4, 2011. |
U.S. Appl. No. 12/030,961 Notice of Allowance Mailed Nov. 5, 2010. |
U.S. Appl. No. 12/030,967 Notice of Allowance Mailed Oct. 7, 2010. |
U.S. Appl. No. 12/030,967, Notice of Allowance mailed Apr. 23, 2010. |
U.S. Appl. No. 12/031,201, Final Office Action Mailed Aug. 3, 2010. |
U.S. Appl. No. 12/031,201, Non-Final Office Action Mailed Dec. 27, 2010. |
U.S. Appl. No. 12/0303,985, Non Final Office Action Mailed May 5, 2010. |
U.S. Appl. No. 12/030,985, Notice of Allowance mailed Nov. 24, 2010. |
U.S. Appl. No. 12/030,993, Final Office Action Mailed Dec. 10, 2010. |
U.S. Appl. No. 12/030,912 Non Final Office Action Mailed Aug. 18, 2011. |
U.S. Appl. No. 12/031,182 Final Office Action dated Oct. 20, 2011. |
U.S. Appl. No. 12/030,925, Notice of Allowance Mailed Sep. 7, 2011. |
U.S. Appl. No. 12/030,932, Notice of Allowance mailed Nov. 1, 2011. |
U.S. Appl. No. 12/030,981 Non Final Office Action Mailed Aug. 2, 2011. |
U.S. Appl. No. 12/030,938, Notice of Allowance Mailed Aug. 8, 2011. |
U.S. Appl. No. 12/030,989, Notice of Allowance Mailed Aug. 5, 2011. |
U.S. Appl. No. 12/031,042, Non-Final Office Action Mailed Sep. 30, 2011. |
Aboda, B.-et al.; Network Working Group; “Securing Block Storage Protocols Over IP”; ACM Digital Library; RFC3723; Apr. 2004, pp. 1-66. |
Azimi, R.-et al.; “miNI: Reducing Network Interface Memory Requirements with Dynamic Handle Lookup”; ACM Digital Library; pp. 261-272; Jun. 2003. |
Emulex Corporation; “Install the LP850 Host Adapter”; Google/Emulex Corporation, LightPulse LP850 Fibre Channel PCI Host Adapter Manuals; pp. 1-10, 1999. |
Foong, A.-et al.; “Towards SSD-Ready Enterprise Platforms”; Google/Intel Corporation; 2008-2009, pp. 1-7. |
Hewlett-Packard Company; HP A4800A PCI FWD SCSI Host Bus Adapter—Service & User Guide, Edition 6; Google/H-P; 2001, pp. 1-64. |
Hewlett-Packard Company; “HP A5149 PCI Ultra2 SCSI Host Bus Adapter—Service and User Guide”, Edition 2; Google/H-P; 2001. |
Jiang, J.-et al.; “The Role of FCoE in I/O Consolidation”; ACM Digital Library/International Conf on Advanced Infocomm Technology '08; Jul. 2008, pp. 1-6. |
Josephson, WK.-et al.; “DFS: A File System for Virtualized Flash Storage”; ACM Digital Library; vol. 6, No. 3, Article 14, Sep. 2010, pp. 1-15. |
LSI Corporation; “PCI Express to 6Gb/s SAS Host Bus Adapters”; Google; Chapter 1, Introduction/Overview; LSI User Guide; Oct. 2009, pp. 1-28. |
LSI; “ScsiPortGetDeivceBase”; Google/LSI; Apr. 2003, pp. 1-3. |
Magoutis, K.; “The Optimistic Direct Access File System: Design and Network Interface Support”; Division of Engineering & Applied Science, Harvard Univ.; Feb. 2002, pp. 1-12. |
Miller, DJ.-et al.; “Motivating Future Interconnects: A Differential Measurement Analysis of PCI Latency”; ACM Digital Library; pp. 94-105; Oct. 2009. |
Network Storage Systems; Google; Oct. 2007, pp. 1-7. |
Sun, Oracle; “Sun Storage 6 Gb SAS PCIe HBA, External—Installation Guide for HBA Models”; Google; Revision A; Nov. 2010, 80 pages. |
Petersen, MK.-et al.; “DIF/DIX Aware Linux SCSI HBA Interface”; Google; Oracle Linux Engineering; Jul. 2008, pp. 1-258. |
Satran, J.-et al.; Network Working Group; “Internet Small Computer Systems Interface (iSCSI)”; ACM Digital Library; RFC3720; Apr. 2004., pp. 1-258. |
Vaghani, SB.; “Virtual Machine File System”; VMWare Inc./ACM Digital Library; pp. 57-69; 2008-2009. |
U.S. Appl. No. 13/833,378, Notice of Allowance Mailed Dec. 6, 2013. |
URL, http://en.wikipedia.org/wiki/FICON, FICON, Wikipedia, USA, Wikimedia Foundation, Inc., Aug. 9, 2011, 3 pages. |
U.S. Appl. No. 13/024,468, Non Final Office Action Mailed Jan. 26, 2012. |
U.S. Appl. No. 12/030,912, Final Office Action Mailed Feb. 27, 2012. |
U.S. Appl. No. 12/031,182 Non-Final Office Action dated Mar. 16, 2012. |
U.S. Appl. No. 12/030,981, Notice of Allowance mailed Jan. 27, 2012. |
U.S. Appl. No. 12/031,023, Non-Final Office Action Mailed Feb. 1, 2012. |
U.S. Appl. No. 13/351,073, Non Final Office Action Mailed Mar. 30, 2012. |
U.S. Appl. No. 12/030,993 Notice of Allowance Mailed Dec. 22, 2011. |
U.S. Appl. No. 12/031,042, Notice of Allowance Mailed Feb. 29, 2012. |
Number | Date | Country | |
---|---|---|---|
20130282929 A1 | Oct 2013 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 13075993 | Mar 2011 | US |
Child | 13917280 | US | |
Parent | 12030954 | Feb 2008 | US |
Child | 13075993 | US |