Abstract: The invention relates to a novel variable hydrate crystalline form of 1-(5-(4-chloro-3,5-dimethoxyphenyl)furan-2-yl)-2-ethoxy-2-(4-(5-methyl-1,3,4-thiadiazol-2-yl)phenyl)ethanone, methods for the preparation thereof, pharmaceutical compositions thereof and their use in the inhibition of PDE10.

Abstract: The present invention is directed to an improved process for the preparation of compounds of Formula (II) and Formula (III), which are useful in the inhibition of PDE10. In particular, the present invention is directed to an improved process for the preparation of 1-(5-(4-chloro-3,5-dimethoxyphenyl)furan-2-yl)-2-ethoxy-2-(4-(5-methyl-1,3,4-thiadiazol-2-yl)phenyl)ethanone, which is useful in the inhibition of PDE10.

Abstract: The invention relates to a novel variable hydrate crystalline form of 1-(5-(4-chloro-3,5-dimethoxyphenyl)furan-2-yl)-2-ethoxy-2-(4-(5-methyl-1,3,4-thiadiazol-2-yl)phenyl)ethanone, methods for the preparation thereof, pharmaceutical compositions thereof and their use in the inhibition of PDE10.

Abstract: The present invention is directed to an improved process for the preparation of compounds of Formula (II) and Formula (III), which are useful in the inhibition of PDE10. In particular, the present invention is directed to an improved process for the preparation of 1-(5-(4-chloro-3,5-dimethoxyphenyl)furan-2-yl)-2-ethoxy-2-(4-(5-methyl-1,3,4-thiadiazol-2-yl)phenyl)ethanone, which is useful in the inhibition of PDE10.

Abstract: The present invention is directed to an improved process for the preparation of compounds of Formula (II) and Formula (III), which are useful in the inhibition of PDE10. In particular, the present invention is directed to an improved process for the preparation of 1-(5-(4-chloro-3,5-dimethoxyphenyl)furan-2-yl)-2-ethoxy-2-(4-(5-methyl-1,3,4-thiadiazol-2-yl)phenyl)ethanone, which is useful in the inhibition of PDE10.

Abstract: A computing system group member, signal bearing medium, and method. A configuration of a computing system group member is determined to be able to assume a role of a primary member of the computing system group and, in response thereto, a first status is assigned in the member. All members of the computing system group receive, in order, all messages directed to group members. A second status is assigned in response to determining that the configuration of the member is not able to support performance as a primary member. The member then processes, within the member, all messages that are transmitted to all members of the group when the member is assigned the first status and when the member is assigned the second status. The configuration of the member, while assigned either the first status or the second status, is adjusted based upon contents of the messages.

Abstract: A method backs up computer data by organizing update requests into groups. All update requests in one group complete concurrently before requests of a subsequent group complete.

Abstract: A computing system group member, signal bearing medium, and method. A configuration of a computing system group member is determined to be able to assume a role of a primary member of the computing system group and, in response thereto, a first status is assigned in the member. All members of the computing system group receive, in order, all messages directed to group members. A second status is assigned in response to determining that the configuration of the member is not able to support performance as a primary member. The member then processes, within the member, all messages that are transmitted to all members of the group when the member is assigned the first status and when the member is assigned the second status. The configuration of the member, while assigned either the first status or the second status, is adjusted based upon contents of the messages.

Abstract: A computing node that functions as a member within a computing system group, such as a cluster, that has a status allowing receipt of group messages even though the node is not an active member of the cluster. The node is able to function as a primary member or as a backup member that controls redundant resources to be utilized in case of a failure. The computing node is able to have one of two status values, an “Active” status and an “Ineligible” status. Members that are able to function as a primary member have an “Active” status assigned, and a member that is not configured or otherwise eligible to perform as a primary member is assigned an “Ineligible” status. Members with an Ineligible status receive all group messages and therefore are able to become configured and eligible to become a primary member.

Abstract: A computing system group processing architecture that facilitates asymmetric processing at different computing nodes within a group or cluster of nodes. Nodes within a group are assigned to subgroups. Each node in a subgroup performs similar processing, but nodes in different subgroups are able to perform different processing for the same group level protocol. All nodes monitor processing completion votes that are cast by all nodes, and node in subgroups that finish processing before other subgroups synchronize to the processing of those other subgroups by casting dummy votes during vote rounds of other subgroups that are still processing their subgroup protocol.

Abstract: Failover processing that accommodates failures of backup computing nodes and resources, such as data storage units and printers. Failure of a computing node that controls resources causes another computing node to assume control of the resources controlled by the failed node. Failure of the primary computing node causes another computing node, at either the same or at a different site, to be selected as the new primary node. Failure of a resource at the primary site causes the site with the next highest priority backup resource to become the new primary site. Failure of a backup computing node causes a new backup node at the same site as the failed backup node to replace the failed backup node as host for the site's resources. Backup mirroring data flows are then adjusted to reflect the new functions of the affected nodes.

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.

Abstract: A computing system group processing architecture that facilitates asymmetric processing at different computing nodes within a group or cluster of nodes. Nodes within a group are assigned to subgroups. Each node in a subgroup performs similar processing, but nodes in different subgroups are able to perform different processing for the same group level protocol. All nodes monitor processing completion votes that are cast by all nodes, and node in subgroups that finish processing before other subgroups synchronize to the processing of those other subgroups by casting dummy votes during vote rounds of other subgroups that are still processing their subgroup protocol.

Abstract: A computing node that functions as a member within a computing system group, such as a cluster, that has a status allowing receipt of group messages even though the node is not an active member of the cluster. The node is able to function as a primary member or as a backup member that controls redundant resources to be utilized in case of a failure. The computing node is able to have one of two status values, an “Active” status and an “Ineligible” status. Members that are able to function as a primary member have an “Active” status assigned, and a member that is not configured or otherwise eligible to perform as a primary member is assigned an “Ineligible” status. Members with an Ineligible status receive all group messages and therefore are able to become configured and eligible to become a primary member.

Abstract: Method and apparatus for ensuring availability of disk units in a disk pool which may be switched between a primary system and one or more backup systems. One embodiment provides a method for ensuring accessibility of one or more disk units by a system, comprising: configuring a storage pool for the system; validating availability of the one or more disk units for the storage pool; and selecting one or more valid disk units for the storage pool. The method may further comprise ranking availability of each disk unit for the storage pool and selecting one or more valid disk units for the storage pool according to availability ranking.

Abstract: Method and apparatus for ensuring availability of disk units in a disk pool which may be switched between a primary system and one or more backup systems. One embodiment provides a method for ensuring accessibility of one or more disk units by a system, comprising: configuring a storage pool for the system; validating availability of the one or more disk units for the storage pool; and selecting one or more valid disk units for the storage pool. The method may further comprise ranking availability of each disk unit for the storage pool and selecting one or more valid disk units for the storage pool according to availability ranking.

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.

Abstract: A method for recovering a computer system from a loadsource direct access storage device located at a remote location. In accordance with the method and system of the present invention, after a catastrophic damage and the installation of a local loadsource direct access storage device, an indicator within the local loadsource direct access storage device is set such that the local loadsource direct access storage device cannot be utilized for initial program load. Thereafter, the contents of the entire loadsource direct access storage device located at a remote location are copied to the replacement local loadsource direct access storage device. The indicator within the replacement local loadsource direct access storage device is reset such that the replacement local loadsource direct access storage device can be utilized for initial program load again. Finally, an initial program load is performed from the replacement local loadsource direct access storage device.

Abstract: Method and apparatus for managing data on DASD units to improve system performance comprises monitoring portions of data on a plurality of DASD units to determine the times the data is accessed within a given time period, and characterizing accessed data portions of a DASD unit as HOT and COLD data. The DASD units are monitored to determine the number of times each unit is accessed within a time period to develop utilization factors reflective of the number of times the DASD unit is accessed during the time period. HOT and COLD data is moved between DASD units based on the utilization factors of the DASD units.

Abstract: DASD failures occurring on sector boundaries currently go undetected. While this sort of problem can occur at any time, it usually occurs when the program executing on the computer system's processor is operating on a multisector piece of data and periodically updating that information in auxiliary storage so that the copy in auxiliary storage is relatively up to date with the changes being made by the program. The storage management mechanism of the present invention solves the problem of sector boundary write failures by associating a sequence number with each piece of multisector data. Essentially, the sequence number becomes a property of the particular piece of data itself. When the mechanism retrieves the information from disk, it checks to make sure that all the sequence numbers match. If they do not, a data integrity problem has been detected.