Abstract: Provided are data structures for use in storing data. A plurality of data structures are defined in a computer readable medium, wherein each data structure indicates a plurality of attributes and at least one function of a storage resource to store data. Policies are defined in the computer readable medium that associate data characteristics to data structures based on a correspondence of data characteristics and the attributes defined in the data structures, wherein each defined data structure is adapted to provide requirements to determine a storage resource to store associated data, and wherein the defined data structure is adapted to provide the storage resource with requirements for storing the data.

Abstract: Provided are data structures for use in storing data. A plurality of data structures are defined in a computer readable medium, wherein each data structure indicates a plurality of attributes and at least one function of a storage resource to store data. Policies are defined in the computer readable medium that associate data characteristics to data structures based on a correspondence of data characteristics and the attributes defined in the data structures, wherein each defined data structure is adapted to provide requirements to determine a storage resource to store associated data, and wherein the defined data structure is adapted to provide the storage resource with requirements for storing the data.

Abstract: A volume container system automatically relates components of a storage area network in membership association of a volume container. The volume container is an abstract entity that maps a relationship between servers and storage devices. The entity captures network access control between servers and storage subsystems such as, for example, security, access, and zoning. Policies of the volume container guide operations in a volume container. The membership associates access and security within the volume container. The volume container reduces administration required for a storage area network, improves consistency in mapping, security, and zoning, and reduces complexity in consistently replicating a logical group of volumes, making failure recovery easier.

Abstract: Provided are data structures for use in storing data. A plurality of data structures are defined in a computer readable medium, wherein each data structure indicates a plurality of attributes and at least one function of a storage resource to store data. Policies are defined in the computer readable medium that associate data characteristics to data structures based on a correspondence of data characteristics and the attributes defined in the data structures, wherein each defined data structure is adapted to provide requirements to determine a storage resource to store associated data, and wherein the defined data structure is adapted to provide the storage resource with requirements for storing the data.

Abstract: Aspects for data sharing across batch sequential processes and on-line transactional processes in a clustered arrangement of multiple data processing systems are described. In a method aspect, the method includes performing on-line transaction process accesses and batch sequential process accesses on record data. The method further includes utilizing a dual-level locking protocol for the on-line transaction process accesses and batch sequential process accesses to achieve substantially concurrent accessibility to the record data with minimized processing overhead for the batch sequential processes.

Abstract: Aspects for data sharing across batch sequential processes and on-line transactional processes in a clustered arrangement of multiple data processing systems are described. In a method aspect, the method includes performing on-line transaction process accesses and batch sequential process accesses on record data. The method further includes utilizing a dual-level locking protocol for the on-line transaction process accesses and batch sequential process accesses to achieve substantially concurrent accessibility to the record data with minimized processing overhead for the batch sequential processes.

Abstract: Aspects for data sharing across batch sequential processes and on-line transactional processes in a clustered arrangement of multiple data processing systems are described. In a method aspect, the method includes performing on-line transaction process accesses and batch sequential process accesses on record data. The method further includes utilizing a dual-level locking protocol for the on-line transaction process accesses and batch sequential process accesses to achieve substantially concurrent accessibility to the record data with minimized processing overhead for the batch sequential processes.

Abstract: Provided are data structures for use in storing data. A plurality of data structures are defined in a computer readable medium, wherein each data structure indicates a plurality of attributes and at least one function of a storage resource to store data. Policies are defined in the computer readable medium that associate data characteristics to data structures based on a correspondence of data characteristics and the attributes defined in the data structures, wherein each defined data structure is adapted to provide requirements to determine a storage resource to store associated data, and wherein the defined data structure is adapted to provide the storage resource with requirements for storing the data.

Abstract: Aspects for read/write data sharing of DASD (direct access storage device) data in a cluster of multiple data processing systems are described. In a method aspect, the method includes utilizing a first system as a managing system for file data modification of at least one file system, the at least one file system including a byte file system. The method further includes controlling access by at least one second system within the cluster of multiple system to data of the at least one file system through global token management, wherein concurrent, direct DASD read/write sharing of data of the at least one file system across the cluster of multiple systems occurs.

Abstract: A method of taking a backup copy of a data set, for use with a log, with the data set being open for update by multiple updaters is described. A point on the log is identified (Recovery Time) from which it can be ensured that all data updates identified on the log have been written by an updater from buffers to the data set. This is done by recording a Recovery Time, and then not taking the backup until all the updaters have confirmed that they have written all updates from buffers to the data set. In addition, if tokens are used on the log to avoid having to identify the data set in full, then these are also written to the log before the update is taken.

Abstract: A Structured External Storage (SES) processor is linked by a communication means to one or more general purpose processors. Two or more applications executing on the one or more general purpose processors communicate function request messages to a message processor within the SES to effect serialized sharing of data within the SES. Within the message processor, a predicate function means executes unconditionally on receipt of one of the function request messages, and a data function means executes conditionally and atomically with respect to the predicate function means following a "successful" condition produced by the predicate function means.