1.
    发明专利
    未知

    公开(公告)号:AT179002T

    公开(公告)日:1999-04-15

    申请号:AT92110130

    申请日:1992-06-16

    Applicant: IBM

    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.

    2.
    发明专利
    未知

    公开(公告)号:DE69122013T2

    公开(公告)日:1997-03-13

    申请号:DE69122013

    申请日:1991-06-18

    Applicant: IBM

    Abstract: In a computer I/O system including a plurality of link-level facilities and a dynamic switch (10) having a plurality of ports (P), each link-level facility being attached to an individual one of the ports (P), a mechanism and method for assigning a unique link level address to each of the link-level facilities. As each of the link-level facilities comes on line, it sends an acquire link address (ALA) frame and waits for a response (ACK) frame. The ALA frame may be addressed to a general to-whom-it-may-concern address and have a source address of who-am-I. Only a dynamic switch (10) normally assigns link addresses. When receiving (110) an ALA frame, the dynamic switch returns (115) an ACK frame having a unique link address assigned to the sender of the ALA frame. Provision is made for determining if there is a dynamic switch present, or, if the link-level facilities are connected together by a static connection through the dynamic switch, for the link-level facility of a channel to assign the unique link addresses.

    3.
    发明专利
    未知

    公开(公告)号:MX9204928A

    公开(公告)日:1993-03-01

    申请号:MX9204928

    申请日:1992-08-26

    Applicant: IBM

    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.

    4.
    发明专利
    未知

    公开(公告)号:DE69228904T2

    公开(公告)日:1999-11-25

    申请号:DE69228904

    申请日:1992-06-16

    Applicant: IBM

    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.

    5.
    发明专利
    未知

    公开(公告)号:DE69228904D1

    公开(公告)日:1999-05-20

    申请号:DE69228904

    申请日:1992-06-16

    Applicant: IBM

    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.

    6.
    发明专利
    未知

    公开(公告)号:DE69122013D1

    公开(公告)日:1996-10-17

    申请号:DE69122013

    申请日:1991-06-18

    Applicant: IBM

    Abstract: In a computer I/O system including a plurality of link-level facilities and a dynamic switch (10) having a plurality of ports (P), each link-level facility being attached to an individual one of the ports (P), a mechanism and method for assigning a unique link level address to each of the link-level facilities. As each of the link-level facilities comes on line, it sends an acquire link address (ALA) frame and waits for a response (ACK) frame. The ALA frame may be addressed to a general to-whom-it-may-concern address and have a source address of who-am-I. Only a dynamic switch (10) normally assigns link addresses. When receiving (110) an ALA frame, the dynamic switch returns (115) an ACK frame having a unique link address assigned to the sender of the ALA frame. Provision is made for determining if there is a dynamic switch present, or, if the link-level facilities are connected together by a static connection through the dynamic switch, for the link-level facility of a channel to assign the unique link addresses.

    PARTITIONED MULTIPROCESSOR PROGRAMMING SYSTEM

    公开(公告)号:DE3479768D1

    公开(公告)日:1989-10-19

    申请号:DE3479768

    申请日:1984-09-28

    Applicant: IBM

    Abstract: A multiprocessing (MP) method is described 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 2 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 2 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.

Patent Agency Ranking