Abstract: Techniques for processing requests are described. A first thread is selected for execution. Only a single thread is allowed to execute at a time. Each thread is associated with a queue of requests to be processed by the thread. A first request is selected from the queue of first thread that performs first processing to service the first request. A service time classification for the first request is determined in accordance with criteria that includes a runtime determination of what resource(s) are used in servicing the first request. It is determined, in accordance with the service time classification, whether to allow the first thread to continue execution and process a second request from the queue of the first thread. If the first thread is allowed to continue execution, second processing is performed by the first thread to service the second request. Otherwise, a second thread is selected for execution.

Abstract: A method, computer program product, and computing system for receiving, on a first storage processor, a configuration IO request concerning a data array coupled to the first storage processor. The configuration IO request is provided to the data array for execution. A failure indication that the configuration IO request failed to execute is received. In response to receiving the failure indication, a status indicator is determined for a second storage processor coupled to the data array. Whether to reset the first storage processor is determined based, at least in part, upon the status indicator of the second storage processor.

Abstract: A method is used in managing database access. A framework is provided for translating versioned data between memory and persistent storage. Based on the framework, read and write requests that access records in a database are translated. Based on the framework, it is made to appear that the database is a different version of the database.

Abstract: Methods, systems, and computer program products for preserving atomic writes to disk arrays are disclosed. According to one method, portions of a file are stored in paired locations on a disk array such that a first location of a location pair for a file portion stores scratch data for the file portion and a second portion of the location pair for the file portion stores valid data for the file portion. A bitmap is stored on the disk array. The bitmap has bits indicating whether valid data for each file portion resides in the first or the second location for its respective location pair. A write request to write data to a portion of the file being less than the entire file is received. The bitmap indicates that valid data for the portion of the file to be written to resides in a first memory location of one of the location pairs on the disk array.

Abstract: An architecture and apparatus for atomic operations across multi-volume or multi-LUNs in a data storage environment. It is difficult to manage data storage and replication operations occurring across such multi-LUNs. The architecture and apparatus embodiments of the invention overcome these deficiencies and facilitate data storage management and replication operations through library initializations in response to host I/O requests to complete atomic operations. Accordingly, the invention ensures the integrity of the data being managed without introducing significant cost or overhead.

Abstract: A method system and program product for atomic operations across multi-volume or multi-LUNs in a data storage environment. It is difficult to manage data storage and replication operations occurring across such multi-LUNs. The method system and program product embodiments overcome these deficiencies and facilitate data storage management and replication operations through library initializations in response to host I/O requests. Accordingly, the invention ensures the integrity of the data being managed without introducing significant cost or overhead.

Abstract: A system, device, and method for providing mutual exclusion for computer system resources utilizes a lock mechanism in which a process that does not own a particular resource creates a lock for the resource upon receiving an inquiry from another process. The lock may be a full instantiation of a lock or a partial instantiation of a lock. In either case, the lock indicates, among other things, the owner process for the resource. When the non-owner process requires access to the resource, the non-owner process uses the lock to determine the owner process and sends a request to the owner process requesting access to the resource.