Abstract: A management interface for a virtualized storage system including a virtualized logical disk object representing a virtual storage container, wherein the logical disk is an abstract representation of physical storage capacity provided by plurality of physical stores. A virtual disk object represents a virtual storage container. The virtual disk object is an abstract representation of one or more logical disk objects, the virtual disk object including an exposed management interface. Wherein the virtual disk object is managed through the management interface to select the one or more logical disk objects represented by the virtual disk object.

Abstract: A virtual storage system comprises an agent to store a first table to map virtual storage segments to storage locations, and a controller to store a second table and to intermittently cause contents of the first table to be replaced by contents of the second table. During an I/O operation, one of the entries in the first table can be accessed by a host to determine one of the storage locations. Also, a method for performing an I/O operation on a virtual storage segment, defined by first table that maps a storage segment to a first storage location, comprises turning off I/O operations at the first storage location, identifying portions of the virtual storage segment to be effected during a write operation, storing a record of identified portions at a second table not the first table, and writing to portions of the second storage location associated with the identified portions.

Abstract: Generating unique identifiers (UUIDs) for software objects and other components in a network in which a large number of components may exist simultaneously and/or over a period of time. UUIDs generated by a particular product are divided into two sub-fields. One sub-field is stored in non-volatile memory, and incremented infrequently. The other sub-field is stored in volatile memory, that can be incremented frequently. During operation, the product creating the UUIDs generates new UUIDs by incrementing the field stored in volatile memory. When overflow of the volatile memory field occurs, the field stored in non-volatile memory is incremented. A block of non-volatile memory is initialized to all of a first logical state, and the bits therein are then sequentially cleared to generate a subsequent unique identifier.

Abstract: A system for generating unique identifiers (UUIDs) for software objects and other components in a network in which a large number of components may exist simultaneously and/or over a period of time. UUIDs generated by a particular product are divided into two sub-fields. One sub-field is stored in (relatively slow) non-volatile memory, and incremented infrequently. The other sub-field is stored in relatively fast, volatile RAM, that can be incremented quickly. During operation, the product creating the UUIDs generates new UUIDs by incrementing the field stored in RAM. When overflow of the RAM field occurs, the field stored in non-volatile memory is incremented. A block of flash memory is initialized to all ones, and the bits therein are then sequentially cleared to generate each subsequent unique identifier.

Abstract: A management interface for a virtualized storage system including a virtualized logical disk object representing a virtual storage container, wherein the logical disk is an abstract representation of physical storage capacity provided by plurality of physical stores. A virtual disk object represents a virtual storage container. The virtual disk object is an abstract representation of one or more logical disk objects, the virtual disk object including an exposed management interface. Wherein the virtual disk object is managed through the management interface to select the one or more logical disk objects represented by the virtual disk object.

Abstract: In response to these and other needs, the present invention provides a virtual storage system that generally uses larger segmentations, but has the ability to divide the large segments into smaller sub-segments during data movement operations. The mapping has large segments except for those segments undergoing data movement. For those segments being moved, the mapping uses the smallest segment size possible, namely, a single disk block. The present invention provides a method and system having this hierarchy of segment sizes, a large segment for normal uses and breaking the large segment into single disk blocks during data movement. In this way, the administration costs are generally low, but latencies caused by the movement of large data blocks are avoided. The hierarchy of segment sizes is accomplished through a distributed virtual storage system having a controller that manages a mapping table and multiple agents that present the mapping to devices on the network.

Abstract: A speed and memory control system and method for use with a sort accelerator having a rebound sorter. The speed and memory control system includes a variable length shift register which utilizes circulating RAM indexing, tag extraction lookahead features to speed up access of records, and merge lookahead and memory management features to provide quick and effective storage of records.

Abstract: A data integrity checking system and method for use with a sort accelerator having a rebound sorter as a merger. The data integrity checking system checks the integrity of data which has been processed by a sorting system wherein unsorted data has been received from and sorted data has been delivered to a host processor. Parity valves and checksum schemes are used. Sorted data is also checked for proper sorting by a sort order checker.

Abstract: A stable sorting system and method for use with a sort accelerator having a rebound sorter as a merger is disclosed. The stable sorting system maintains an output order of records which have equal keys. This output order is the same order of those records as they entered the rebound sorter. Stable sorting is maintained in both the sorting and the merging operations of the sort accelerator. An additional byte is inserted between the key and the data of a record to preserve record order for records having equal keys.

Abstract: A control system and method for use with a sort accelerator having a rebound sorter as a merger in disclosed. The control system allows records to be efficiently and effectively transferred between processing elements and record storage elements of a rebound sorter. The control system allows consecutive groups of records to be sorted in the rebound sorter without mixing records from separate groups. The control system also pipelines records through the sorter by allowing different groups of records to input into the rebound sorter directly adjacent to each other.

Abstract: A data integrity checking system and method for use with a sort accelerator having a rebound sorter as a merger. The data integrity checking system checks the integrity of data which has been processed by a sorting system wherein unsorted data has been received from and sorted data has been delivered to a host processor. Parity valves and checksum schemes are used. Sorted data is also checked for proper sorting by a sort order checker.