12.
    发明专利
    未知

    公开(公告)号:AT460703T

    公开(公告)日:2010-03-15

    申请号:AT00308493

    申请日:2000-09-27

    Applicant: IBM

    Abstract: The configuration of the logical processors of a logical partition is managed dynamically. A logical partition is initially configured with one or more logical processors. Thereafter, the configuration can be dynamically adjusted. This dynamic adjustment may be in response to workload of the logical partition.

    13.
    发明专利
    未知

    公开(公告)号:DE60042191D1

    公开(公告)日:2009-06-25

    申请号:DE60042191

    申请日:2000-09-25

    Applicant: IBM

    Abstract: An exemplary embodiment of the invention is a method for assigning resources in a system configurable into logical partition clusters. The method includes defining at least one logical partition cluster. A LPC name index record storing a LPC name index for each of a plurality of resources is provided. The LPC name index record is indexed by a resource identifier. A LPC name record storing at least one LPC name is also provided. At least one LPC name index points to a LPC name in the LPC name record and each LPC name identifies an LPC. A resource is assigned to a group in response to the LPC name index record and the LPC name record.

    17.
    发明专利
    未知

    公开(公告)号:AT431588T

    公开(公告)日:2009-05-15

    申请号:AT00120828

    申请日:2000-09-25

    Applicant: IBM

    Abstract: An exemplary embodiment of the invention is a method for assigning resources in a system configurable into logical partition clusters. The method includes defining at least one logical partition cluster. A LPC name index record storing a LPC name index for each of a plurality of resources is provided. The LPC name index record is indexed by a resource identifier. A LPC name record storing at least one LPC name is also provided. At least one LPC name index points to a LPC name in the LPC name record and each LPC name identifies an LPC. A resource is assigned to a group in response to the LPC name index record and the LPC name record.

    CONCURRENT PATCH TO LOGICAL PARTITION MANAGER OF A LOGICALLYPARTITIONED SYSTEM

    公开(公告)号:CA2237681C

    公开(公告)日:2002-03-26

    申请号:CA2237681

    申请日:1998-05-14

    Applicant: IBM

    Abstract: A method of replacing a current version of a program module with a replacement version of the module concurrently with the execution of the program on a computer system. While execution of the program is suspended, each address reference in the program to an entry point within the current version of the module is replaced with an address reference to the corresponding entry point within the replacement version of the module. After the address references have been replaced and before execution is resumed, a patch initialization routine is invoked to perform initialization functions such as storage allocation, table initialization and feature detection that are performed before execution of the concurrently applied patch. Execution of the program is resumed when each address reference to the current module has been replaced with one to the replacement module and the patch initialization routine has been performed. A bit vector is used to ensure that each initialization function is performed only once per instantiation of the program being patched. An available storage value indicates the amount of initially allocated storage remaining available after performing an initialization function involving storage allocation.

    CONCURRENT PATCH TO LOGICAL PARTITION MANAGER OF A LOGICALLY PARTITIONED SYSTEM

    公开(公告)号:CA2237681A1

    公开(公告)日:1998-11-28

    申请号:CA2237681

    申请日:1998-05-14

    Applicant: IBM

    Abstract: A method of replacing a current version of a program module with a replacement version of the module concurrently with the execution of the program on a computer system. While execution of the program is suspended, each address reference in the program to an entry point within the current version of the module is replaced with an address reference to the corresponding entry point within the replacement version of the module. After the address references have been replaced and before execution is resumed, a patch initialization routine is invoked to perform initialization functions such as storage allocation, table initialization and feature detection that are performed before execution of the concurrently applied patch. Execution of the program is resumed when each address reference to the current module has been replaced with one to the replacement module and the patch initialization routine has been performed. A bit vector is used to ensure that each initialization function is performed only once per instantiation of the program being patched. An available storage value indicates the amount of initially allocated storage remaining available after performing an initialization function involving storage allocation.

Patent Agency Ranking