Abstract:
A triple parity (TP) technique reduces overhead of computing diagonal and anti-diagonal parity for a storage array adapted to enable efficient recovery from the concurrent failure of three storage devices in the array. The diagonal parity is computed along diagonal parity sets that collectively span all data disks and a row parity disk of the array. The parity for all of the diagonal parity sets except one is stored on the diagonal parity disk. Similarly, the anti-diagonal parity is computed along anti-diagonal parity sets that collectively span all data disks and a row parity disk of the array. The parity for all of the anti-diagonal parity sets except one is stored on the anti-diagonal parity disk. The TP technique provides a uniform stripe depth and an optimal amount of parity information.
Abstract:
A system and method for prioritization of clock rates in a multi-core processor is provided. Instruction arrival rates are measured during a time interval Ti−1 to Ti by a monitoring module either internal to the processor or operatively interconnected with the processor. Using the measured instruction arrival rates, the monitoring module calculates an optimal instruction arrival rate for each core of the processor. For processors that support continuous frequency changes for cores, each core is then set to an optimal service rate. For processors that only support a discrete set of arrival rates, the optimal rates are mapped to a closest supported rate and the cores are set to the closest supported rate. This procedure is then repeated for each time interval.
Abstract:
A system and method for providing persistent node names is provided. The system and method stores the node name associated with a given storage system in the root volume associated with the storage system. Thus various components of the storage appliance may be modified without changing the node name associated with a given storage system. This enables clients to have a consistent and persistent node name to connect to in a given network environment.
Abstract:
A system and method verifies and repairs mirrored data sets. Verification modules executing on both the source and destination computers cooperate to identify a common persistent consistency point image (PCPI) of the source and destination data sets. Once the common image has been identified, the source sends a data stream comprising the data from the source data set to the destination to be compared with the destination data set.
Abstract:
The present invention provides a system and method for fast restart of a guest operating system executing on a virtual machine operating system in a virtual machine environment. During initialization, the guest operating system saves a set of checkpoint information to persistent storage. Upon detection of an error condition during operation, the guest operating system begins a re-initialization procedure in accordance with an illustrative embodiment of the present invention. During the re-initialization procedure, the guest operating system retrieves the checkpoint information and configures itself using the retrieved information. By utilizing the retrieved information, the guest operating system avoids the need to perform lengthy configuration discovery routines, thereby shortening the re-initialization time substantially.
Abstract:
A system and method for examining content of a client computer operating system is provided. Layout information of data related to a data container stored within the client computer is retrieved, where the layout information is implemented in terms of native operating system semantic of the client computer. The layout information is transmitted to a storage system. The storage system reconstructs the layout information of the data container stored within the client computer in a shadow volume implemented in terms of native operating system semantic of the storage system.
Abstract:
A method and system for providing an improved compliance clock service are described. An example method comprises establishing a system compliance clock (SCC) for a storage system that provides a compliant storage service, and establishing, for a volume in the storage system, a volume compliance clock (VCC). A current value of the SCC may be periodically updated based on hardware ticks monitored at the associated storage node. The volume compliance clock is to update its value based on a current value of the SCC.
Abstract:
A system and method for logging and storing failure analysis information on disk drive so that the information is readily and reliably available to vendor customer service and other interested parties is provided. The information, in an illustrative embodiment, is stored on a nonvolatile (flash) random access memory (RAM), found generally in most types of disk drives for storage of updateable disk drive firmware. A known location of limited size is defined in the flash RAM, to form a scratchpad. This scratchpad is a blank area of known addresses, formed during the original firmware download onto the memory, and which is itself free of firmware code. This scratchpad is sufficient in size to write a series of failure codes in a non-erasable list as failures/errors (and user/administrator attempts to unfail the disk) are logged. The log of failures always travels with the drive, and can be read by the vendor to determine the general nature of the most recent failure(s) and whether these failures represent a problematic history for the drive.
Abstract:
A data access request to a file system is decomposed into a plurality of lower-level I/O tasks. A logical combination of physical storage components is represented as a hierarchical set of objects. A parent I/O task is generated from a first object in response to the data access request. A child I/O task is generated from a second object to implement a portion of the parent I/O task. The parent I/O task is suspended until the child I/O task completes. The child I/O task is executed in response to an occurrence of an event that a resource required by the child I/O task is available. The parent I/O task is resumed upon an event indicating completion of the child I/O task. Scheduling of any child I/O task is not conditional on execution of the parent I/O task, and a state diagram regulates the child I/O tasks.
Abstract:
Provided is a method and system for redirecting data access requests in a clustered computing environment. A clustered namespace applied to the clustered computing environment includes multiple modules for storing and manipulating data. The clustered namespace is enabled by using a replicated storage location repository listing storage locations distributed throughout the clustered computing environment. When searching for data, pathnames to storage locations are examined and compared with values listed in the storage location repository to identify a storage location to visit. A module associated with an identified storage location is visited to satisfy a data access request. If a redirection identifier is encountered when examining the metadata of the identified storage location, then the storage location repository is examined to find the next storage location to visit to satisfy the data access request.