Abstract:
A communication system which connects input/output (I/O) devices of different data rates with a data processing system. Transfer of the first byte of data to the data processing system from an I/O device is synchronized with the rise of an inbound tag from the I/O device. Receipt of the first byte by the data processing system is signalled by raising the outbound tag, following which the device drops the inbound tag. Transfer of the second byte from the I/O device is synchronized with the rise of a data in tag. Receipt of the second byte is signalled by raising the data out tag. The outbound tag is dropped after the inbound tag has dropped. The data out tag is dropped after the data in tag has dropped. Transfer of data to the device from the data processing system utilizes the same sequence, however, transfer of the first byte is synchronized with the rise of the outbound tag and transfer of the second byte is synchronized with the rise of data out.
Abstract:
A data processing technique is disclosed which permits a plurality of users of a data processing system to share data in a data store, providing independent and asynchronous access to the data for subsequent processing by either user. The sharing of small data items is accomplished without requiring the use of interlocks to prevent one user from obtaining access to the shared data item while the other is processing the data for subsequent replacement in the shared data store. In addition, sharing of data items of sufficient size permit the user to build up controls for safe and efficient sharing of data items of any size.
Abstract:
INDEPENDENT HANDLING OF I/O INTERRUPT REQUESTS AND ASSOCIATED STATUS INFORMATION TRANSFERS In a tightly coupled multiprocessing system wherein plural central processing elements share an operating system (supervisory program), a main store, and a multipath I/O channel processing facility for linking to peripheral devices, and in which the channel processing facility contains a single unique subchannel for each device regardless of the number of paths available for connecting to the device, apparatus disclosed herein ensures that a central processing element which attempts to start an operation of the device will have reference to the latest pertinent status even if another central processing element is simultaneously attending to an interruption associated with such status. This apparatus retains status information in the subchannel, along with an indication of its retention, while the interruption is being handled in the central complex. The central complex is required to examine and reset the retention indication, and recover any associated status, before it can stimulate the channel facility to start the device. The apparatus for performing these operations includes means in the central complex for executing the examining, resetting and recovery operations in response to a special program instruction Test Subchannel (TSCH).
Abstract:
Buffers 54,58 are provided in two elements 52,56 between which data is to be transferred wherein both buffers are managed solely by the originator of the data transfer. Only one transfer is required to transmit a message, and a second transfer acknowledges the completion of the function because message delivery to the receiver is guaranteed under the implemented protocol. When a request is sent, a message timer is started at the sender. When the normal response for the request is received, the timer is reset; however, if the duration of the message operation exceeds the timeout value, a message-timeout procedure is initiated. When the cancel command is issued, a second timer is set. If this timer is exceeded, subsequent cancel commands can be issued. If subsequent cancel commands are issued, a cancel complete command must be sent and responded to. Since the commands must be executed in the sequence in which they are received, a response to the cancel complete command ensures that there are no other cancel operation commands remaining in the receiver, allowing subsequent operations to start without danger of being cancelled.
Abstract:
A system and method for asynchronously transmitting data blocks, in parallel, across multiple fibers in a serial manner. Frame groups are provided as a mechanism to transmit associated data serially on each fiber and tie the data being transmitted together. The frame groups do not have sequence numbers, therefore, the receiver determines which frames are part of a frame group by the arrival times of the individual frames. In one embodiment, the transceivers for each member of the parallel bus asynchronously achieve synchronism at each end of the fiber. Thus the need for a common clock is eliminated. The receivers on each side of the bus determine the relative skew for each conductor by performing skew measurements on a calibration message generated by the transmitters on the other side of the bus. When the skew on all conductors, viewed from both sides of the bus, has been determined, the skew values are exchanged across the bus, thus enabling the transmitters to set proper frame spacing.
Abstract:
A method for acquiring the node identifier of a node in a data processing input/output (I/O) system having a plurality of nodes. This procedure is part of the initialization of each node in the I/O system and may be used to establish the configuration of the I/O system such that if a connection breaks or a fault occurs between nodes, the configuration can be confirmed after the break or fault is corrected. This prevents data from being sent to the wrong device if lines were connected in a different configuration during the correction of a fault. The node identifier is a worldwide-unique identifier such that only one node is identified by a node identifier. The node identifier contains a validity code that specifies if the node identifier is valid. Also disclosed is a retry procedure for retrying the acquisition of a node identifier if the acquired node identifier is not valid, and a deferral procedure which defers the retry procedure if a link is not available.
Abstract:
A system and method for asynchronously transmitting data blocks, in parallel, across multiple fibers in a serial manner. Frame groups are provided as a mechanism to transmit associated data serially on each fiber and tie the data being transmitted together. The frame groups do not have sequence numbers, therefore, the receiver determines which frames are part of a frame group by the arrival times of the individual frames. In one embodiment, the transceivers for each member of the parallel bus asynchronously achieve synchronism at each end of the fiber. Thus the need for a common clock is eliminated. The receivers on each side of the bus determine the relative skew for each conductor by performing skew measurements on a calibration message generated by the transmitters on the other side of the bus. When the skew on all conductors, viewed from both sides of the bus, has been determined, the skew values are exchanged across the bus, thus enabling the transmitters to set proper frame spacing.