Abstract: A system and associated methodology for controlling block duplicates when deduplicating data (Dedup Blocks) to a storage space. The system includes a persistent database of known duplicates stored in the storage space (KD Table), and a non-persistent database of possible duplicates stored in the storage space (PD Table). Computer logic executes programming instructions stored in memory that are configured to index the KD Table according to a value derived from bits of a Dedup Block's hash signature, to index the PD Table according to another value derived by other bits of the Dedup Block's hash signature, to demote known duplicates from the KD Table to the PD Table, and to promote possible duplicates from the PD Table to the KD Table.

Abstract: An efficient RAID-6 double parity erasure code scheme. Efficiency is provided by the addition of a single term to a diagonal parity equation. For example, in a five-wide layout (having five physical storage devices) the RAID-6 “parity diagonals” end up with six terms, which are the actual diagonal plus one more data block. As a result, no one data symbol contributes to the erasure code determined from the data symbols, such that no more than n+1 data symbols contribute to any one parity symbol.

Abstract: A very large virtual volume (e.g., in excess of 500 GB) is formed by distributing the disks in eleven, six-disk RAID-5 sets across the six busses of a primary local back-end controller. A spare disk is provided on each of the six busses. Each RAID-5 set is protected from the failure of a single disk by the spare disks on the busses, which can use the parity data stored in a RAID-5 set to rebuild the data stored on a failing disk and thereby restore redundancy to the RAID-5 set. Each RAID-5 set is also protected from the failure of a bus by the parity inherent in RAID-5. The RAID-5 sets are striped by a front-end controller connected to the primary local back-end controller, and the striped RAID-5 sets are presented to a host computer as a very large virtual volume. If the individual disks are 9.1 GB in size, the size of the very large virtual volume can reach 500.5 GB.

Abstract: A very large virtual storage volume formed by distributing disks in multiple, multi-disk RAID (redundant array of independent disks) sets across busses of a back-end controller. The multiple RAID sets are striped by a front-end controller connected to the back-end controller and presented to a host computer as a very large virtual storage volume.

Abstract: A disaster-tolerant data backup and remote copy system which is implemented as a controller-based replication of one or more LUNs (logical units) between two remotely separated pairs of array controllers connected by redundant links. The system provides a method for allowing a large number of commands to be ‘outstanding’ in transit between local and remote sites while ensuring the proper ordering of commands on remote media during asynchronous or synchronous data replication. In addition, the system provides a mechanism for automatic ‘tuning’ of links based on the distance between the array controllers.

Abstract: The present invention provides a virtual storage system that generally stores uses larger segmentations, but divides large segments into smaller sub-segments during data movement operations. The present invention provides a method and system having this hierarchy of segment sizes, namely a large segment for the normal case, while breaking the large segment into single disk blocks during data movement. The mapping has large segments except for those segments undergoing data movement. For those segments, it would be desirable to have the smallest segment size possible, namely, a single disk block. In this way, the administration costs are generally low, but latencies caused by the movement of large data blocks are avoided.

Abstract: A disaster-tolerant data backup and remote copy system which is implemented as a controller-based replication of one or more LUNs (logical units) between two remotely separated pairs of array controllers connected by redundant links. The system provides a method for allowing a large number of commands to be ‘outstanding’ in transit between local and remote sites while ensuring the proper ordering of commands on remote media during asynchronous or synchronous data replication. In addition, the system provides a mechanism for automatic ‘tuning’ of links based on the distance between the array controllers.

Abstract: A disaster-tolerant data backup and remote copy system which is implemented as a controller-based replication of one or more LUNs (logical units) between two remotely separated pairs of array controllers connected by redundant links. The system provides a method for allowing a large number of commands to be ‘outstanding’ in transit between local and remote sites while ensuring the proper ordering of commands on remote media during asynchronous or synchronous data replication. In addition, the system provides a mechanism for automatic ‘tuning’ of links based on the distance between the array controllers.

Abstract: A data replication system having a redundant configuration including dual Fibre Channel fabric links interconnecting each of the components of two data storage sites, wherein each site comprises a host computer and associated data storage array, with redundant array controllers and adapters. Each array controller in the system is capable of performing all of the data replication functions, and each host ‘sees’ remote data as if it were local. Each array controller has a dedicated link via a fabric to a partner on the remote side of the long-distance link between fabric elements. Each dedicated link does not appear to any host as an available link to them for data access; however, it is visible to the partner array controllers involved in data replication operations. These links are managed by each partner array controller as if being ‘clustered’ with a reliable data link between them.

Abstract: A very large virtual volume (e.g., in excess of 500 GB) is formed by distributing the disks in eleven, six-disk RAID-5 sets across the six busses of a primary local back-end controller. A spare disk is provided on each of the six busses. Each RAID-5 set is protected from the failure of a single disk by the spare disks on the busses, which can use the parity data stored in a RAID-5 set to rebuild the data stored on a failing disk and thereby restore redundancy to the RAID-5 set. Each RAID-5 set is also protected from the failure of a bus by the parity inherent in RAID-5. The RAID-5 sets are striped by a front-end controller connected to the primary local back-end controller, and the striped RAID-5 sets are presented to a host computer as a very large virtual volume. If the individual disks are 9.1 GB in size, the size of the very large virtual volume can reach 500.5 GB.

Abstract: The present invention provides a virtual storage system that generally stores uses larger segmentations, but divides large segments into smaller sub-segments during data movement operations. The present invention provides a method and system having this hierarchy of segment sizes, namely a large segment for the normal case, while breaking the large segment into single disk blocks during data movement. The mapping has large segments except for those segments undergoing data movement. For those segments, it would be desirable to have the smallest segment size possible, namely, a single disk block. In this way, the administration costs are generally low, but latencies caused by the movement of large data blocks are avoided.

Abstract: A system and technique for optimizing the efficiency of maintenance operations performed on skip lists of data elements or nodes stored in memory is provided. Each node of a skip list includes a back pointer for pointing to an immediate predecessor node and a node level field for recording the node level associated with the node. The system further includes a system agent for operating on the data structure, the system agent capable of locating the address of the immediate predecessor node pointing to a selected node by using the back pointer in the selected node.

Abstract: Systems and methods for performing the check code calculations for RAID 6 computer mass storage arrays are disclosed such that it becomes computationally feasible to implement a RAID 6 system in software on a modern high-speed computer. For a standard "P+Q" RAID 6 array, the system and method of the present invention allow the calculation of both RAID 6 check codes in less than twice the time it takes to calculate simple RAID 5 parity. The system and method of the present invention are based on a careful matching of the characteristics of the Commutative Ring in which calculations take place to the capabilities of modern high-speed computers. In a particular embodiment, defining the mapping of data and check symbols to computer storage locations in a transposed manner affords a further reduction of computation time.

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: Methods and apparatus for optimizing prefetch caching for sets of disc drives with reverse ordered logical block mapping.

Abstract: An improved arbitration technique for a computer network system in which multiple nodes communicate using a shared bus, and at least one node has no knowledge of the current status of the arbitration taking place between all nodes in the system. Such a node is called a "deaf node". Each node in the system is assigned an initial arbitration count number, for example, N+1, where N is the node number assigned to the node. The arbitration count number is the number of quiet slots a node must count before trying to transmit on the system bus. The length of a quiet slot is determined by a particular system's electrical characteristics. One quiet slot is reserved as the "deaf node quiet slot", during which a deaf node may transmit. In response to a transmission occurring in the deaf node quiet slot, each node in the system reinitializes its arbitration count number to its initial arbitration count number.

Abstract: A pipelined multi-staged logic control device for controlling the movement of information between a number of storage devices and a host computer. The pipelined multi-staged logic control device resides in a controller having a first and a second data bus wherein each of the data buses can access up to four drive ports. Information can flow through either of the data buses to any one of the eight total drive ports. A pair of indentical integrated circuit chips are each coupled individually to a single state machine. Each of the integrated circuit chips act in concert with their associated state machine to examine the state of the drive ports and to decide if a requested drive port can be accessed. The present invention is extremely fast due to the use of state machines. While a pickup head is locating information on a storage device, other requests for information are checked during this time to determine whether additional requests can be satisfied during the pickup head's locate time.

Abstract: A sort accelerator is disclosed which uses a rebound sorter as a merger in which large numbers of records can be efficiently and rapidly sorted. The rebound sorter not only can sort a number of records but can be used to merge together previously sorted groups of records into larger sorted groups. A certain number of processing elements and record storage elements are used to simultaneously compare records. Depending on the sort chosen either a descending or ascending sort can be made.The merging operation consists of an input phase, and a merge-up phase, an output phase, and a final merge phase. Successively larger strings of records are created until a final sorted string of records remains. Through various enhancements and associated circuitry the rebound sorter can sort and merge large numbers of records quickly and efficiently.

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.