Abstract: Techniques are provided for distributing data. It is determined that a source storage device is becoming a bottleneck. One or more blocks to be moved from the source storage device to one or more other storage devices are identified. The one or more other storage devices are selected. Copy services are used to move the blocks from the source storage device to the one or more other storage devices. A metadata store is updated with locations of the blocks that have been moved.

Abstract: Techniques are provided for processing a request. When the request is to read a data unit, information regarding the closest physical block locations is returned. When the request is to write to the data unit, information regarding one or more source block locations is returned, wherein the write is applied to one or more source blocks of the data unit. When a number of requests for the data unit exceed a threshold level and at least one quality of a service policy is not being met, a copy of the one or more source blocks of the data unit is created at a location selected based on proximity to at least one client computer from which the number of requests are high.

Abstract: A technique for performing configuration checking of a network is provided. A network data store is scanned for at least one transaction. At least one event is generated for the transaction. At least one configuration policy is associated with the event. The configuration policy is compared with configuration data associated with the event. It is determined whether the configuration policy has been violated based on the comparison.

Abstract: Disclosed is a technique for correcting a configuration problem. The configuration problem is detected. It is determined whether there is at least one solution for the configuration problem in a knowledge data store. When it is determined that there is at least one solution in the knowledge data store, automatically selecting a solution to solve the configuration problem. When said solution can be automatically applied, automatically applying said solution. When said solution cannot be automatically applied, notifying a user.

Abstract: Techniques are provided for locating data. Mapping information for blocks associated with a file is provided. It is determined that a copy service has copied source blocks to target blocks. It is determined whether the mapping information should be updated to refer to the target blocks. Then, updated mapping information is provided in response to determining that the mapping information should be updated to refer to the target blocks.

Abstract: Provided are techniques for copying data. A volume container copyset that includes volume containers is received. A volume container copyset that includes volume containers is received. Each of the volume containers is associated with a copyset role, and each of the volume containers includes zero or more volumes, wherein each of the volumes in a volume container has the copyset role of that volume container. Sets of volumes are associated with a replication session, wherein each of the sets of volumes has one volume from each of the volume containers. Each of the sets of volumes has volumes associated with a copyset role that is associated with the volume containers with which each volume is associated. In response to determining that one of membership of one of the volume containers and a size of a volume in one of the volume containers has been modified, one or more corresponding volume containers in the volume container copyset are automatically modified.

Abstract: Techniques are provided for processing a request. When the request is to read a data unit, information regarding the closest physical block locations is returned. When the request is to write to the data unit, information regarding one or more source block locations is returned, wherein the write is applied to one or more source blocks of the data unit. When a number of requests for the data unit exceed a threshold level and at least one quality of a service policy is not being met, a copy of the one or more source blocks of the data unit is created at a location selected based on proximity to at least one client computer from which the number of requests are high.

Abstract: Techniques are provided for distributing data. It is determined that a source storage device is becoming a bottleneck. One or more blocks to be moved from the source storage device to one or more other storage devices are identified. The one or more other storage devices are selected. Copy services are used to move the blocks from the source storage device to the one or more other storage devices. A metadata store is updated with locations of the blocks that have been moved.

Abstract: Disclosed are a queue management system and a method of managing a queue. This system and method are for use with a parallel processing system including a plurality of clients and a plurality of processors. The clients receive messages and transmit the messages to a shared queue for storage, and the processors retrieve messages from the shared queue and process said messages. The queue management system includes a mirror queue for maintaining a copy of each message transmitted to the shared queue by one of the clients; and the queue management system stores to the mirror queue, a copy of each message transmitted to the shared queue by that one of the clients. The mirror queue provides the system with continuity in case of an outage of the shared queue. In the event of such an outage, each instance of an application can simply discontinue using the shared queue and process requests from the mirror queue. The mirror queue is used until the shared queue is once again available.

Abstract: Techniques are provided for processing a request. When the request is to read a data unit, information regarding the closest physical block locations is returned. When the request is to write to the data unit, information regarding one or more source block locations is returned, wherein the write is applied to one or more source blocks of the data unit. When a number of requests for the data unit exceed a threshold level and at least one quality of a service policy is not being met, a copy of the one or more source blocks of the data unit is created at a location selected based on proximity to at least one client computer from which the number of requests are high.

Abstract: Techniques are provided for distributing data. It is determined that a source storage device is becoming a bottleneck. One or more blocks to be moved from the source storage device to one or more other storage-devices are identified. The one or more other storage devices are selected. Copy services are used to move the blocks from the source storage device to the one or more other storage devices. A metadata store is updated with locations of the blocks that have been moved.

Abstract: A technique for performing configuration checking of a network is provided. A network data store is scanned for at least one transaction. At least one event is generated for the transaction. At least one configuration policy is associated with the event. The configuration policy is compared with configuration data associated with the event. It is determined whether the configuration policy has been violated based on the comparison.

Abstract: Disclosed is a technique for correcting a configuration problem. The configuration problem is detected. It is determined whether there is at least one solution for the configuration problem in a knowledge data store. When it is determined that there is at least one solution in the knowledge data store, automatically selecting a solution to solve the configuration problem. When said solution can be automatically applied, automatically applying said solution. When said solution cannot be automatically applied, notifying a user.

Abstract: Techniques are provided for locating data. Mapping information for blocks associated with a file is provided. It is determined that a copy service has copied source blocks to target blocks. It is determined whether the mapping information should be updated to refer to the target blocks. Then, updated mapping information is provided in response to determining that the mapping information should be updated to refer to the target blocks.

Abstract: A technique for performing configuration checking of a network is provided. A network data store is scanned for at least one transaction. At least one event is generated for the transaction. At least one configuration policy is associated with the event. The configuration policy is compared with configuration data associated with the event. It is determined whether the configuration policy has been violated based on the comparison.

Abstract: Techniques are provided for locating data. Mapping information for blocks associated with a file is provided. It is determined that a copy service has copied source blocks to target blocks. It is determined whether the mapping information should be updated to refer to the target blocks. Then, updated mapping information is provided in response to determining that the mapping information should be updated to refer to the target blocks.

Abstract: A queue management system and a method of managing a queue. This system and method are for use with a parallel processing system including a plurality of clients and a plurality of processors. The clients receive messages and transmit the messages to a shared queue for storage, and the processors retrieve messages from the shared queue and process said messages. The queue management system includes a mirror queue for maintaining a copy of each message transmitted to the shared queue by one of the clients; and means, running on said one of the clients, for storing to the mirror queue, a copy of each message transmitted to the shared queue by said one of the clients. The mirror queue provides the system with continuity in case of an outage of the shared queue. In the event of such an outage, each instance of an application can simply discontinue using the shared queue and process requests from the mirror queue. The mirror queue is used until the shared queue is once again available.

Abstract: A technique for determining an optimal number of tasks for processing requests is provided. It is determined whether there are one or more first requests that have not been processed. A parallelism assessment is performed for simulating the assignment of said first requests to one or more task representations.

Abstract: In a data storage system with multiple output media types, each request to store a data object is automatically analyzed to select the optimal output media type. In choosing the output media type best suited to quickly and efficiently complete the storage requests, the storage system considers (1) attributes of the data object itself, such as its size, (2) any perceived urgency required to complete the data storage request, and (3) attributes of the system's storage devices, such as the availability of different output media types, presence of other storage requests queued for storage for each type, level of ongoing access of each storage type by concurrent storage tasks, delays to initiate storage such as mount/demount times, amount of storage space available in different output media types, and the like.

Abstract: In a computing system with non-shareable resources, use-arbitrating processes are executed on behalf of each task seeking or having access to non-shareable resource. The processes compete according to prescribed rules and priority guidelines, the resolution of which determines access to the non-shareable resource. If application of the priority guidelines permits, a use-requesting task can institute takeaway of a resource from a task that is already using the resource.