-
1.发明申请
公开(公告)号：WO02088946A3
公开(公告)日：2003-09-18
申请号：PCT/GB0201809
申请日：2002-04-18
IPC: G06F15/177 , G06F9/38 , G06F9/46 , G06F9/50 , G06F9/52 , G06F15/173
CPC classification number: G06F9/5061 , G06F9/3885 , G06F9/3891 , G06F2209/505
Abstract: An apparatus, clustered computer system, program product and method utilize a unique prepare operation in connection with a resource action to effectively "lock out" missing or inactive cluster entities such as nodes and cluster objects from rejoining a clustered computer system subsequent to the resource action. The prepare operation includes modification of one or more cluster configuration parameters associated with entities in a clustered computer system, such that any such cluster entity that is active during the prepare operation accepts the modifications, while any cluster entity that is inactive during the prepare operation does not accept the modifications. By modifying cluster configuration parameters for active cluster entities, attempts by previously-inactive cluster entities to activate or rejoin clustering after resource actions will generally fail due to incorrect or stale cluster configuration parameters for such entities, and thus such entities will be effectively blocked from being accepted into the clustered computer system.
Abstract translation: 一种装置，集群计算机系统，程序产品和方法利用与资源动作相结合的唯一准备操作，以在资源动作之后有效地“锁定”丢失或不活动的集群实体（例如节点和集群对象）来重新连接集群计算机系统 。 准备操作包括修改与集群计算机系统中的实体相关联的一个或多个集群配置参数，使得在准备操作期间活动的任何这样的集群实体接受修改，而在准备操作期间处于非活动状态的任何集群实体 不接受修改。 通过修改活动集群实体的集群配置参数，先前不活动的集群实体在资源操作后激活或重新加入集群的尝试通常会由于这些实体的不正确或过时的集群配置参数而失败，因此这样的实体将被有效地阻止 接收到集群计算机系统中。
-
Patent Agency Ranking
公开(公告)号：IT1165345B
公开(公告)日：1987-04-22
申请号：IT2608079
申请日：1979-09-28
Applicant: IBM
Inventor： MITCHELL GLEN ROBERT , KEMPKE WILLIAM GEORGE , JONES EUGENE REESE , HOUDEK MERLE EDWARD , RANWEILER JAMES GREGORY
Abstract: Tagged pointer handling apparatus is provided for implementation in a computer system wherein a tag bit is provided for each word in main storage. This invention provides for the mixing of data and pointers within the same storage space, and provides a capability for checking and verifying the validity of the pointers without affecting the performance or operation of other instructions. Only the tag instructions can set the tag bits ON in main storage; all other instructions store data and set the corresponding tag bits OFF. Thus, if a pointer was modified inadvertently by one of these data handling instructions, the fact that the pointer is untagged is detected and the values in the pointer are treated as invalid when the pointer is used by the Load and Verify Tags instruction. Instructions to load, store, set, move, extract and insert tags are implemented by the tagged pointer handling apparatus. A Load and Verify Tags instruction checks the validity of the pointer and if valid, loads the pointer into a specified general purpose register. A Store and Set Tags instruction stores the value in a specified general purpose register into main storage and sets the associated tag bits ON. A Move and Set Tags instruction moves a word from one location in main storage to another or the same location in main storage and sets the associated tag bits ON. A Move Characters and Tags instruction moves a word and the associated tag bits from one storage location to another storage location. An Extract Tags instruction fetches each word from an operand in main storage, extracts the tag bits, compresses the tag bits to one tag bit per quadword, and stores the tag bits in main storage as data. An Insert Tags instruction fetches the tag bits stored in main storage as data, expands the tag bits to one tag bit per word, and inserts them on each associated word of an operand in main storage.
-
公开(公告)号：DE2964732D1
公开(公告)日：1983-03-17
申请号：DE2964732
申请日：1979-09-24
Applicant: IBM
Inventor： ABERLE GARY FRANCIS , BALM GERALD JOHN , BERSTIS VIKTORS , GREGG LEON EDWARD , HU KUANG-CHI , RICHARDSON WILLIAM CAIN , SCHARDT TERRY LYLE , RANWEILER JAMES GREGORY , WATSON CHARLES THOMAS
Abstract: In a multitasking restricted access data processing system a common compact mechanism is provided for resolving access conflicts automatically irrespective of the category of restriction tread access, modify access or destroy access; the type of restriction (shared or exclusive) of the origin of the restriction (user specified or instruction implied). The mechanism operates by testing codewords (34) totally defining the access restriction in relation to a newly required access and currently in force access restrictions in relation to the inhabitants of a chained list (24) associated by a hashed object address form (18) access being denied, held pending until released or a time-out exception occurs or granted, the list appropriate to the transaction being updated accordingly and also updated as restrictions are released.
-
公开(公告)号：AU2002253319A1
公开(公告)日：2002-11-11
申请号：AU2002253319
申请日：2002-04-18
Applicant: IBM
IPC: G06F15/177 , G06F9/38 , G06F9/46 , G06F9/50 , G06F9/52 , G06F15/173
Abstract: An apparatus, clustered computer system, program product and method utilize a unique prepare operation in connection with a resource action to effectively "lock out" missing or inactive cluster entities such as nodes and cluster objects from rejoining a clustered computer system subsequent to the resource action. The prepare operation includes the modification of one or more cluster configuration parameters associated with a plurality of entities in a clustered computer system, such that any such cluster entity that is active during the prepare operation accepts the modifications, while any such cluster entity that is inactive during the prepare operation does not accept the modifications. By modifying cluster configuration parameters for active cluster entities, attempts by previously-inactive cluster entities to activate or rejoin clustering subsequent to resource actions will generally fail due to an incorrect or stale cluster configuration parameters for such entities, and as a result, such entities will be effectively blocked from being accepted into the clustered computer system.
-
公开(公告)号：DE2961891D1
公开(公告)日：1982-03-04
申请号：DE2961891
申请日：1979-09-24
Applicant: IBM
Inventor： MITCHELL GLEN ROBERT , KEMPKE WILLIAM GEORGE , JONES EUGENE REESE , HOUDEK MERLE EDWARD , RANWEILER JAMES GREGORY
Abstract: Tagged pointer handling apparatus is provided for implementation in a computer system wherein a tag bit is provided for each word in main storage. This invention provides for the mixing of data and pointers within the same storage space, and provides a capability for checking and verifying the validity of the pointers without affecting the performance or operation of other instructions. Only the tag instructions can set the tag bits ON in main storage; all other instructions store data and set the corresponding tag bits OFF. Thus, if a pointer was modified inadvertently by one of these data handling instructions, the fact that the pointer is untagged is detected and the values in the pointer are treated as invalid when the pointer is used by the Load and Verify Tags instruction. Instructions to load, store, set, move, extract and insert tags are implemented by the tagged pointer handling apparatus. A Load and Verify Tags instruction checks the validity of the pointer and if valid, loads the pointer into a specified general purpose register. A Store and Set Tags instruction stores the value in a specified general purpose register into main storage and sets the associated tag bits ON. A Move and Set Tags instruction moves a word from one location in main storage to another or the same location in main storage and sets the associated tag bits ON. A Move Characters and Tags instruction moves a word and the associated tag bits from one storage location to another storage location. An Extract Tags instruction fetches each word from an operand in main storage, extracts the tag bits, compresses the tag bits to one tag bit per quadword, and stores the tag bits in main storage as data. An Insert Tags instruction fetches the tag bits stored in main storage as data, expands the tag bits to one tag bit per word, and inserts them on each associated word of an operand in main storage.
-
公开(公告)号：IT7926080D0
公开(公告)日：1979-09-28
申请号：IT2608079
申请日：1979-09-28
Applicant: IBM
Inventor： MITCHELL GLEN ROBERT , KEMPKE WILLIAM GEORGE , JONES EUGENE REESE , HOUDEK MERLE EDWARD , RANWEILER JAMES GREGORY
Abstract: Tagged pointer handling apparatus is provided for implementation in a computer system wherein a tag bit is provided for each word in main storage. This invention provides for the mixing of data and pointers within the same storage space, and provides a capability for checking and verifying the validity of the pointers without affecting the performance or operation of other instructions. Only the tag instructions can set the tag bits ON in main storage; all other instructions store data and set the corresponding tag bits OFF. Thus, if a pointer was modified inadvertently by one of these data handling instructions, the fact that the pointer is untagged is detected and the values in the pointer are treated as invalid when the pointer is used by the Load and Verify Tags instruction. Instructions to load, store, set, move, extract and insert tags are implemented by the tagged pointer handling apparatus. A Load and Verify Tags instruction checks the validity of the pointer and if valid, loads the pointer into a specified general purpose register. A Store and Set Tags instruction stores the value in a specified general purpose register into main storage and sets the associated tag bits ON. A Move and Set Tags instruction moves a word from one location in main storage to another or the same location in main storage and sets the associated tag bits ON. A Move Characters and Tags instruction moves a word and the associated tag bits from one storage location to another storage location. An Extract Tags instruction fetches each word from an operand in main storage, extracts the tag bits, compresses the tag bits to one tag bit per quadword, and stores the tag bits in main storage as data. An Insert Tags instruction fetches the tag bits stored in main storage as data, expands the tag bits to one tag bit per word, and inserts them on each associated word of an operand in main storage.
-
-
-
-
-
Search Results
6
records
(took 0.017 seconds)
