Abstract: Apparatus, method and program product for use in passing initiative to a processor for handling an I/O request for an I/O operation for sending data between a main storage and one or more devices. A hierarchy of vectors registers I/O requests by the devices to send or receive data from the main storage. The hierarchy of vectors has one or more lower levels and a highest level. Each device sets a vector in the lowest level of the hierarchy for registering an I/O request, the setting of a vector in the lowest level being reflected up the hierarchy to the highest level, thereby registering I/O requests on any lower level of the hierarchy in the highest level. A dispatcher polls the hierarchy in high to low order with the dispatcher passing initiative to the processor to handle I/O requests registered in said hierarchy responsive to registering of an I/O request on the lowest level as reflected to the highest level of said hierarchy.

Abstract: A method and apparatus for providing configuration information is provided in a network computing environment having a plurality of hosts and at least one Gateway attachment and a channel interface, using a QDIO device. A set of special tables and commands are provided at initialization time over the channel interface which provide all configuration information. The tables can map any Host images and Host Device Addresses which will be using the QDIO Interface to the specific bits defined in a SIGA vector, the SIGA Vector giving initiative to said QDIO connected Gateway device.

Abstract: An apparatus, method and program product for sending data to or receiving data from one or more I/O devices in an I/O operation with a main storage controlled by a processor in a data processing system. The apparatus includes a time-of-day (TOD) register for containing a TOD value, a clock for containing a current TOD value, and a summary register having a first condition when any one of said devices requests an I/O operation and a second condition when no devices have an outstanding I/O request, each device having an outstanding I/O request sets the summary register to its first condition only when the summary register is in its second condition, and further places the current TOD value in the TOD register. A checking program determines if a specified time delay has been exceeded between the value in said TOD register and the current TOD for each requested I/O operation. The checking program drives an interrupt to the processor when the specified time delay has been exceeded.

Abstract: Apparatus, method and program product for use in passing initiative to a processor for handling an I/O request for an I/O operation for sending data between a main storage and one or more devices. A hierarchy of vectors registers I/O requests by the devices to send or receive data from the main storage. The hierarchy of vectors has one or more lower levels and a highest level. Each device sets a vector in the lowest level of the hierarchy for registering an I/O request, the setting of a vector in the lowest level being reflected up the hierarchy to the highest level, thereby registering I/O requests on any lower level of the hierarchy in the highest level. A dispatcher polls the hierarchy in high to low order with the dispatcher passing initiative to the processor to handle I/O requests registered in said hierarchy responsive to registering of an I/O request on the lowest level as reflected to the highest level of said hierarchy.

Abstract: A method of transferring data in a network computing environment having a controlling program and a main storage in processing communication with an interface element including one or more adapters. A queuing mechanism is first established in the main storage for asynchronous transmittal of data between the program and said interface element. At least one queue-set is dedicated to input data and another queue-set to output data in the queuing mechanism. Queuing priorities both for said input and output queue-sets are then determined according to importance of data to be processed or transferred or other internal dependencies and a queue-description record is established by passing a QDIO queue command. From this the priority and number of the output queue are provided by order in which the order specified in the queue descriptor record relative to any other output queues described in that record.

Abstract: A method of providing direct data processing access in a network computing system environment. The system environment has a main storage which can be connected to one or more application servers and is in processing communication with an interface element. The interface element has at least one adapter and can be connected to one or more application user(s). One or more queues are established in the main storage that can handle data without causing interrupts in the running programs. Incoming data is received using the adapter and as data is received or modified, the status of the network computing system will be updated to reflect the new data or change. Data is then processed in the main storage after interrogating the multiple existing queues in the main storage and forwarding them in turn to their appropriate destination or application server after a determination has been made by interrogating these queues.

Abstract: A computer program product and storage device used for exchange and transfer of data in a network computing system having a main storage capable of connecting to at least one application server and an interface element with at least one adapter capable of establishing processing communication with at least one application user(s).

Abstract: An apparatus for transferring data in a network computing environment having a controlling program and a main storage in processing communication with an interface element including one or more adapters. A queuing mechanism is first established in the main storage for asynchronous transmittal of data between the program and said interface element. At least one queue-set is dedicated to input data and another queue-set to output data in the queuing mechanism. Queuing priorities both for said input and output queue-sets are then determined according to importance of data to be processed or transferred or other internal dependencies and a queue-description record is established by passing a QDIO queue command. From this the priority and number of the output queue are provided by order in which the order specified in the queue descriptor record relative to any other output queues described in that record.

Abstract: A queuing method and apparatus for transfer or incoming and outgoing data in a network environment having a main storage is presented. A plurality of queue sets are provided in the main storage with at least one or more sets being dedicated for input and output. The queues can share access to a plurality of devices in the network across a plurality of communication stacks. Various network resources are mapped to the queues in order to facilitate resource allocation and dynamic configuration by providing initialization of a plurality of configuration parameters. In this way dynamic expanding and contracting of the number of queues in each set as dictated by traffic patterns and feedback indicators is provided.

Abstract: A computer program device and product is provided for timely processing of data. The computer program device comprises a program storage device readable by a digital processing apparatus and a program means including instructions executable by the digital processing apparatus by designating at least one set of queues in the queuing mechanism as input queues and another as output queues; issuing a signal adapter instruction to provide initiative to check content of any or all queues in the queuing mechanism; specifying initiate-output or initiate-input appropriately by means of said signal adapter instruction to cause associated adapter to asynchronously process said output or input queues; and causing synchronization by means of said signal adapter instruction by signaling the associated data queues to update all entries in order to render them current.

Abstract: A method and apparatus for exchanging data in a network computing system having a main storage capable of connecting to at least one application server and an interface element with at least one adapter capable of establishing processing communication with at least one application user(s). A state change signalling protocol is used for transfer of data between the main storage and said adapter. In addition a queuing mechanism is established in the main storage having a plurality of queues each with a plurality of buffers. Some of these queues are dedicated to be input and others as output queues. By applying the protocol each input and output data buffer is associated with each of the active input and output queues. In this manner the input and output buffers are managed by placing the buffers into various states which are maintained in a special location that is set aside and is associated with each buffer.

Abstract: A method and an apparatus for timely and accurate processing of data in a network computing environment controlled by a running program and having a queuing mechanism established in a main storage. The main storage is in processing communication with an interface element having one or more adapters. At least one set of queues in the queuing mechanism is designated for input and another set for output. A signal adapter instruction can be issued to provide initiative to check content of any or all queues in the mechanism. With the help of the signal adapter an initiate-output can be specified when appropriate and the associated adapter can then asynchronously process the input or the output queues. A synchronize option is also available to signal the associated data queues to update all entries in order to render them current as observed by both the adapter and the controlling running program.

Abstract: A method and an apparatus for providing concurrent patch in a computing network environment using microcode and having a queued direct I/O and a main memory in processing communication with an adapter. First it is allowed for a new level of microcode to be installed to an adapter without interrupting any running applications and/or services. It is then determined if the affected adapter is a network or a channel adapter. If the adapter is a channel adapter, applications using the channel adapter are to run without requiring any connection type information to be kept across any code updates. If the adapter is determined to be a network adapter, all adapter sessions are kept alive and activated while accessing information about any client station connected to a LAN and each present in said environment.

Abstract: A computer program product in a network environment having a main storage in processing communication with an interface element having adapters for storing data in a queuing mechanism in the main storage. The program product comprises a data storage device including a computer usable medium having computer readable program means for ensuring proper and timely processing of data and computer readable code means for providing a plurality of queue sets; for dedicating one or more queues in each set as input or output queues; for providing the ability to said queues to share access to a plurality of devices in said network across a plurality of communication stacks; for mapping various resources to said queues to facilitate resource allocation and dynamic configuration by providing initialization of a plurality of configuration parameters; and for providing dynamic expanding and contracting of the number of queues in each set as dictated by traffic patterns and feedback indicators.

Abstract: A queuing method and apparatus for receipt and transfer of incoming and outgoing data inn a network environment having a main storage. The mechanism includes at least one set of dedicated input queues and at least another set of dedicated output queues. In addition a plurality of queuing components is also provided that include attributes of devices to and from which data is to be transferred or received, and information about the queuing mechanism itself. The input and output queues also comprise an information block containing address of all input and output queues, a storage information block providing information about the queuing mechanism and storage list information blocks that defined for each queue containing specific information about that queue itself.

Abstract: A method and apparatus for error detection in a network computing system having a main storage capable of connecting to at least one application server and an interface element with at least one adapter capable of establishing processing communication with at least one application user(s). Data is transferred across the interface element to and from the main storage. The main storage includes a queuing mechanism providing a plurality of queuing components having attributes of devices to and from which data is to be transferred or received as well as information about the queuing mechanism itself. As part of the queuing component, providing a Storage-List-State Block (SLSB) having state indicators that provide state information about a plurality of buffers that make up each queue. A plurality of Error States is defined for by the SLSB Status Block. These Error States are set in the SLSB each time the interface element detects errors in the data stream.

Abstract: For parallel, massively parallel and data server networks a zone relocation facility and dynamic I/O data address relocation facility which allows the relocation of memory space for partitions for on or more clients or guests while the client guest and one or more of the server/host or another client guest are actively executing I/O instructions. An I/O data address relocation facility includes an operation request block in the local storage of a client/guest with a second copy of the operation request block in a server/host located in the main store, and a comparator in the system channel subsystem. An application locates CCWs and IDAWS anywhere and the server/host will relocate data to its partition. The partition size can be expanded to allow dynamic response to a need for memory by changing the partition and moving data to the expanded partition while other activities are being processed.

Abstract: A data processing system includes a host processor and host memory means. The processor interacts with a plurality of peripheral units through an I/O system that includes a plurality of channels, one or more I/O processors (IOP's), and control data in a system area of the host memory means. Each channel has an associated busy bit in a vector, and is provided with a one position queue for dispatching work to the channel. Each queue has a bit in a vector indicating its full or empty status. A very efficient algorithm for the assignment of work for peripherals by the IOP's is provided in a system that provides for multiple paths through multiple channels between the host and a particular peripheral using the busy vector and queue vector.

Abstract: A data processing I/O system including a main storage for storing data and data processing instructions arranged in software programs, and a channel subsystem having hardware for reporting conditions in the channel subsystem to the software. A special Channel Subsystem Call (CHSC) instruction is used to store event information from the channel subsystem into the main memory for use by the software such that new or restored resources such as a channel path, a channel path and partial control unit link address, or a channel path and full control unit link address, may be originally made accessible, or may be restored to the I/O system. A mechanism is also provided to inquire of a device how long it expects to not be accessible to give the device sufficient time to reset itself before it is varied offline, thus preventing a device from being isolated or "boxed" prematurely.

Abstract: Provides a method for measuring the busy utilization time for I/O channel used by any of plural operating systems (OSs) in a CEC. The measured utilization time for any OS excludes the time shared channels are utilized by other OSs during a measurement period. A channel measurement facility (CMF) is provided in the I/O subsystem hardware and microcode for each of the OSs in the I/O subsystem. The CMF is logically constructed because it uses only a small portion of I/O resources already existing in a CEC by adding microcode to control these resources to perform the time measurement function. The resources for a logical CMF including the partial use of: an I/O processor to store identifiers of an assigned OS, the partial use of channel processors controlling channels selected by the assigned OS during a measurement period, the local storage of each I/O processor, and OS storage needed for communicating the measurement data from the CMF to the OS.