公开(公告)号：JP2001142854A

公开(公告)日：2001-05-25

申请号：JP2000289884

申请日：2000-09-25

Applicant: IBM

Inventor： MAERGNER JUERGEN ,  MERITT ALLAN S ,  NICK JEFFREY M ,  WYMAN LESLIE W ,  YUDENFRIEND HARRY M

IPC: G06F15/16 ,  G06F9/46 ,  G06F9/50 ,  G06F15/177

Abstract: PROBLEM TO BE SOLVED: To manage asynchronous requests such as input/output requests inside a coprocessor in a computer environment. SOLUTION: The asynchronous requests are managed on the basis of priority related to the asynchronous requests. This management includes the selection of the asynchronous request to be processed while using a priority system, for example, and the application of a resource to the asynchronous request while using the priority system or the both.

公开(公告)号：GB2365589B

公开(公告)日：2004-11-24

申请号：GB0103673

申请日：2001-02-15

Applicant: IBM

Inventor： GLASSEN STEVEN ,  HALMA MARTEN J ,  HEFFERON EUGENE P ,  MERITT ALLAN S ,  OAKES KENNETH J ,  YUDENFRIEND HARRY M

IPC: G06F11/34

公开(公告)号：GB2365589A

公开(公告)日：2002-02-20

申请号：GB0103673

申请日：2001-02-15

Applicant: IBM

Inventor： GLASSEN STEVEN ,  HALMA MARTEN J ,  HEFFERON EUGENE P ,  MERITT ALLAN S ,  OAKES KENNETH J ,  YUDENFRIEND HARRY M

IPC: G06F11/34

Abstract: The utilisation of various individual components of a channel is determined in order to learn which portion of a channel is busy and to what extent that portion is busy. The determination of a component's utilisation is dependent on the type of component, as well as the operational characteristics of that component.

公开(公告)号：CA2068805A1

公开(公告)日：1993-02-28

申请号：CA2068805

申请日：1992-05-15

Applicant: IBM

Inventor： BROWN PAUL J ,  FREDERICKS KENNETH J SR ,  HEFFERON EUGENE P ,  MOFFITT GERALD T ,  MERITT ALLAN S

IPC: G06F13/14 ,  G06F13/00 ,  H04L29/00 ,  G06F12/00 ,  G06F9/00

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.

公开(公告)号：CA2068805C

公开(公告)日：1996-09-17

申请号：CA2068805

申请日：1992-05-15

Applicant: IBM

Inventor： BROWN PAUL J ,  FREDERICKS KENNETH J SR ,  HEFFERON EUGENE P ,  MOFFITT GERALD T ,  MERITT ALLAN S

IPC: G06F13/14 ,  G06F13/00 ,  H04L29/00 ,  G06F9/00 ,  G06F12/00

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.

公开(公告)号：CA1209270A

公开(公告)日：1986-08-05

申请号：CA462901

申请日：1984-09-11

Applicant: IBM

Inventor： GUYETTE RICHARD R ,  HALL EDDIE T ,  MERITT ALLAN S ,  NEWSON STEPHEN R ,  SCALZI CASPER A ,  SEARS GLENN W JR

IPC: G06F15/16 ,  G06F9/455 ,  G06F9/46 ,  G06F9/48 ,  G06F12/00 ,  G06F12/02 ,  G06F15/167 ,  G06F9/22

Abstract: The disclosure provides a unique multiprocessing (MP) method for executing on plural CPUs of the MP a uniprocessor system (UPS) program not written to run on a MP system. Separate copies of the UPS are provided in the shared main storage (MS) of the MP. A hypervisor type of control program (called a partitioned multiprocessing system, PMP) uses the MP method to enable simultaneous execution of the plural copies of a UPS on different CPUs of the MP as UPS guest virtual machines. PMP can dedicate any CPU to the sole execution of a particular copy of UPS. The copies of the UPS run on the different CPUs independently of each other, but they may share I/O devices. PMP may run with a virtual machine (VM) type of job entry and task dispatching control programming system designed to operate on CPUs having 370-XA architecture and to use emulation on the CPUs to permit a UPS designed for the same or another architecture (e.g. S/360 or S/370) to execute on the 370-XA CPUs as a UPS guest by using an emulation instruction (e.g. start interpretive execution, SIE). Efficient direct I/O handling for the executing UPS copies (i.e. UPS guests) requires the MS boundary of each UPS to be located at a different 2n byte absolute address, so that the I/O processor can easily translate channel program and I/O data addresses used by each UPS to the actual absolute MS addresses of the MP, n being the number of bits in the effective address used by the UPS. Zone parameters are derived from the 2n boundary addresses for the respective guests. This channel translation does not require any translation tables and can avoid a MS access for each translation. A CPU may use segment and page tables to translate UPS addresses for any UPS guest's CPU requests.