Abstract: A node of a database system is operable to determine, at a first time, to prepare for a shutdown. The shutdown of the node is performed at a second time that is a period of time after the first time based on the node delaying the shutdown until a plurality of currently running processes being run by the node that initiated prior to the first time are determined to be complete. During the period of time after the first time and prior to performing the shutdown, a set of new processing requests are rejected by the node.

Abstract: A node of a database system is operable to determine, at a first time, to prepare for a shutdown. The shutdown of the node is performed at a second time that is a period of time after the first time based on the node delaying the shutdown until a plurality of currently running processes being run by the node that initiated prior to the first time are determined to be complete. During the period of time after the first time and prior to performing the shutdown, a set of new processing requests are rejected by the node.

Abstract: A database system is operable to cache first resultant data generated via executing a first query in cache memory resources during a first temporal period. An instruction to re-execute the first query is processed during the first temporal period by accessing the first resultant data in the cache memory resources. A cached resultant invalidation instruction indicating the first relational database table is received. The first resultant data from the cache memory resources is removed during a second temporal period based on processing the cached resultant invalidation instruction. A third instruction to re-execute the first query is processed after the second temporal period by re-executing the first query via access to the first relational database table in the first storage resources to re-generate corresponding first resultant data for the first query.

Abstract: A node of a database system is operable to determine, at a first time, to prepare for a shutdown. The shutdown of the node is performed at a second time that is a period of time after the first time based on the node delaying the shutdown until a plurality of currently running processes being run by the node that initiated prior to the first time are determined to be complete. During the period of time after the first time and prior to performing the shutdown, a set of new processing requests are rejected by the node.

Abstract: A hosting partition update mechanism allows updating I/O capability of a logically-partitioned computer system in a way that minimally affects the performance and availability of I/O in the computer system. When an update is needed, a new hosting partition is created with the desired update(s). I/O adapters in the current hosting partition are then migrated to the new hosting partition. The migration of an I/O adapter from the current hosting partition to the new hosting partition is relatively fast, thereby minimally impacting system performance and availability of I/O. Once all of the I/O adapters have been migrated to the new hosting partition, the current hosting partition may be kept as a backup, or may be eliminated. Providing a new or backup hosting partition allows updates to be performed in the new or backup hosting partition in a non-disruptive manner while the current hosting partition continues to service I/O requests.

Abstract: A hosting partition update mechanism allows updating I/O capability of a logically-partitioned computer system in a way that minimally affects the performance and availability of I/O in the computer system. When an update is needed, a new hosting partition is created with the desired update(s). I/O adapters in the current hosting partition are then migrated to the new hosting partition. The migration of an I/O adapter from the current hosting partition to the new hosting partition is relatively fast, thereby minimally impacting system performance and availability of I/O. Once all of the I/O adapters have been migrated to the new hosting partition, the current hosting partition may be kept as a backup, or may be eliminated. Providing a new or backup hosting partition allows updates to be performed in the new or backup hosting partition in a non-disruptive manner while the current hosting partition continues to service I/O requests.

Abstract: Methods, apparatus and computer program product implement enhanced dynamic copy-on-write storage compression. For a write operation, a freed block is detected by the COW storage for compressing freed blocks from the COW storage. Responsive to the detected freed block being a previously written block in the COW storage, the previously written block in the COW storage is deleted from the COW storage. Responsive to the detected freed block not being a previously written block in the COW storage, the block is marked as zero in the COW storage.

Abstract: Methods, apparatus and computer program product implement enhanced dynamic copy-on-write storage compression. For a write operation, a purge function for a block being written is detected by the COW storage for compressing freed blocks from the COW storage. Responsive to the detected purge function and the block being a previously written block in the COW storage, the previously written block in the COW storage is deleted from the COW storage. Responsive to the detected purge function and the block not being a previously written block in the COW storage, the block is marked as zero in the COW storage.

Abstract: An apparatus and method provide a protocol for communicating between an operating system that owns a shared resource and other operating systems that use the shared resource so that the operating systems that use the shared resource will not crash if the operating system that owns the shared resource is restarted. Messages are defined that allow handshaking between operating systems so that operating systems that share a resource will realize the resource will be unavailable for some period of time, and that allow resuming the sharing of the resource once the operating system that owns the shared resource is restarted.

Abstract: A hosting partition update mechanism allows updating the I/O capability of a logically-partitioned computer system in a way that minimally affects the performance and availability of I/O in the computer system. When an update is needed, a new hosting partition is created with the desired update(s). The I/O adapters in the current hosting partition are then migrated to the new hosting partition. The migration of an I/O adapter from the current hosting partition to the new hosting partition is relatively fast, thereby minimally impacting system performance and availability of I/O. Once all of the I/O adapters have been migrated to the new hosting partition, the current hosting partition may be kept as a backup, or may be eliminated. Providing a new or backup hosting partition allows updates to be performed in the new or backup hosting partition in a non-disruptive manner while the current hosting partition continues to service I/O requests.

Abstract: A hosting partition update mechanism allows updating I/O capability of a logically-partitioned computer system in a way that minimally affects the performance and availability of I/O in the computer system. When an update is needed, a new hosting partition is created with the desired update(s). I/O adapters in the current hosting partition are then migrated to the new hosting partition. The migration of an I/O adapter from the current hosting partition to the new hosting partition is relatively fast, thereby minimally impacting system performance and availability of I/O. Once all of the I/O adapters have been migrated to the new hosting partition, the current hosting partition may be kept as a backup, or may be eliminated. Providing a new or backup hosting partition allows updates to be performed in the new or backup hosting partition in a non-disruptive manner while the current hosting partition continues to service I/O requests.

Abstract: Methods, apparatus and computer program product implement enhanced dynamic copy-on-write storage compression. For a write operation, a freed block is detected by the COW storage for compressing freed blocks from the COW storage. Responsive to the detected freed block being a previously written block in the COW storage, the previously written block in the COW storage is deleted from the COW storage. Responsive to the detected freed block not being a previously written block in the COW storage, the block is marked as zero in the COW storage.

Abstract: Methods, apparatus and computer program product implement enhanced dynamic copy-on-write storage compression. For a write operation, a purge function for a block being written is detected by the COW storage for compressing freed blocks from the COW storage. Responsive to the detected purge function and the block being a previously written block in the COW storage, the previously written block in the COW storage is deleted from the COW storage. Responsive to the detected purge function and the block not being a previously written block in the COW storage, the block is marked as zero in the COW storage.

Abstract: A memory tag mechanism creates a logical memory tag of a first length that corresponds to an I/O address of a second length. The memory tag is “logical” because it does not represent physical memory. When an I/O adapter device driver that expects an address of the first length is invoked, the memory tag is passed. When the I/O adapter device driver makes a call to the partition manager to convert the address of the first length (i.e., memory tag) to an I/O address of the second length, the partition manager detects that the passed address is a memory tag instead of a real address, and returns the corresponding I/O address. In this manner existing device drivers that expect addresses of the first length may be used for redirected DMA, which allows performing DMA operations directly from a shared I/O adapter in a hosting partition to memory in a hosted partition.

Abstract: A method and computer program product are provided for automatic conversion of data by a server computer system based on a location extension in a universal naming convention (UNC) name. Responsive to receiving a universal naming convention (UNC) name used for identifying data stored on the server computer system, a predefined location extension to a share name in the universal naming convention (UNC) name is identified. The identified predefined location extension is utilized for automatic conversion of the stored server data.