公开(公告)号：US07343517B2

公开(公告)日：2008-03-11

申请号：US11704071

申请日：2007-02-08

Applicant: Wayne Eugene Miller ,  Frank Joseph Inzerillo

Inventor： Wayne Eugene Miller ,  Frank Joseph Inzerillo

IPC: G06F11/00

CPC classification number: G06F11/1666 ,  G06F3/065 ,  G06F3/067 ,  G06F11/1435 ,  G06F11/1658 ,  G06F11/1662 ,  G06F11/20

Abstract: The present invention relates to a method of updating SMD in an array of storage devices. In an embodiment, the method employs an array controller to change the start tag values of a copy set X, write an updated SMD of the copy set X, change the end tag values of copy set X, change the value of X, and repeat the change and write steps above to generate multiple SMD copies on each storage device. In another embodiment, the method updates the SMD in an array of SATA storage devices. In another embodiment, the invention is a data storage system, including at least one host, a plurality of storage nodes coupled to the host(s), where each storage node includes an array controller coupled to an array of storage devices and each storage device includes one or more copies of the SMD, and a system for managing SMD on each storage device. Another feature of the invention is the copying of SMD in all of the storage devices of a data storage system to increase the probability that a map for the data can be recovered.

Abstract translation: 本发明涉及一种在存储装置阵列中更新SMD的方法。 在一个实施例中，该方法采用阵列控制器来改变拷贝集合X的开始标签值，写入复制集合X的更新的SMD，改变拷贝集X的结束标签值，改变X的值，并重复 以上更改和写入步骤，以在每个存储设备上生成多个SMD副本。 在另一个实施例中，该方法更新SATA存储设备阵列中的SMD。 在另一个实施例中，本发明是数据存储系统，其包括至少一个主机，耦合到主机的多个存储节点，其中每个存储节点包括耦合到存储设备阵列的阵列控制器和每个存储设备 包括SMD的一个或多个副本，以及用于在每个存储设备上管理SMD的系统。 本发明的另一个特征是在数据存储系统的所有存储设备中复制SMD以增加可以恢复数据的映射的概率。

公开(公告)号：US07287134B2

公开(公告)日：2007-10-23

申请号：US11803916

申请日：2007-05-15

Applicant: Wayne Eugene Miller ,  Yuri Vladimirovich Bagashev ,  David Alan Burton ,  Noel Simen Otterness ,  Paul Michael Remley

Inventor： Wayne Eugene Miller ,  Yuri Vladimirovich Bagashev ,  David Alan Burton ,  Noel Simen Otterness ,  Paul Michael Remley

IPC: G06F13/00

CPC classification number: G06F3/0659 ,  G06F3/0611 ,  G06F3/067 ,  G06F2206/1012 ,  H04L67/1097

Abstract: The invention relates to management of I/O in data storage systems. In an embodiment, the invention provides a data storage subsystem processing I/O requests each having a priority, comprising a processor, a memory coupled to the processor, a disk array, an array controller coupled to the processor and the disk array, a network interface, coupled to the processor, to receive an I/O request with a priority, and a program in the memory for managing the I/O request based on the priority, a clip level of the priority, the total workload in the data storage subsystem, and processing I/O requests based on priority, workload clip levels, and fairness levels. The invention also contemplates the use of static and dynamic adjusted clip levels. The invention also relates to a method of managing I/O requests, comprising receiving an I/O request, determining the priority of the I/O request, comparing the total workload to the clip level for the priority, and processing the I/O request if the total workload is below the clip level or the priority workload is below a fairness level.

Abstract translation: 本发明涉及数据存储系统中I / O的管理。 在一个实施例中，本发明提供了一种处理具有优先级的I / O请求的数据存储子系统，包括处理器，耦合到处理器的存储器，磁盘阵列，耦合到处理器和磁盘阵列的阵列控制器，网络 接口，耦合到处理器，以优先级接收I / O请求;以及存储器中用于基于优先级管理I / O请求的程序，优先级的剪辑级别，数据存储器中的总工作量 子系统和基于优先级，工作负载剪辑级别和公平级别处理I / O请求。 本发明还考虑使用静态和动态调整的剪辑级别。 本发明还涉及一种管理I / O请求的方法，包括接收I / O请求，确定I / O请求的优先级，将总工作量与优先级​​的剪辑级别进行比较，以及处理I / O 请求是否总工作量低于剪辑级别或优先级工作负载低于公平级别。

公开(公告)号：US07222223B2

公开(公告)日：2007-05-22

申请号：US10976430

申请日：2004-10-29

Applicant: Wayne Eugene Miller ,  Yuri Vladimirovich Bagashev ,  David Alan Burton ,  Noel Simen Otterness ,  Paul Michael Remley

Inventor： Wayne Eugene Miller ,  Yuri Vladimirovich Bagashev ,  David Alan Burton ,  Noel Simen Otterness ,  Paul Michael Remley

IPC: G06F13/00

CPC classification number: G06F3/0659 ,  G06F3/0611 ,  G06F3/067 ,  G06F2206/1012 ,  H04L67/1097

Abstract: The invention relates to management of I/O in data storage systems. In an embodiment, the invention provides a data storage subsystem processing I/O requests each having a priority, comprising a processor, a memory coupled to the processor, a disk array, an array controller coupled to the processor and the disk array, a network interface, coupled to the processor, to receive an I/O request with a priority, and a program in the memory for managing the I/O request based on the priority, a clip level of the priority, the total workload in the data storage subsystem, and processing I/O requests based on priority, workload clip levels, and fairness levels. The invention also contemplates the use of static and dynamic adjusted clip levels. The invention also relates to a method of managing I/O requests, comprising receiving an I/O request, determining the priority of the I/O request, comparing the total workload to the clip level for the priority, and processing the I/O request if the total workload is below the clip level or the priority workload is below a fairness level.

Abstract translation: 本发明涉及数据存储系统中I / O的管理。 在一个实施例中，本发明提供了一种处理具有优先级的I / O请求的数据存储子系统，包括处理器，耦合到处理器的存储器，磁盘阵列，耦合到处理器和磁盘阵列的阵列控制器，网络 接口，耦合到处理器，以优先级接收I / O请求;以及存储器中用于基于优先级管理I / O请求的程序，优先级的剪辑级别，数据存储器中的总工作量 子系统和基于优先级，工作负载剪辑级别和公平级别处理I / O请求。 本发明还考虑使用静态和动态调整的剪辑级别。 本发明还涉及一种管理I / O请求的方法，包括接收I / O请求，确定I / O请求的优先级，将总工作量与优先级​​的剪辑级别进行比较，以及处理I / O 请求是否总工作量低于剪辑级别或优先级工作负载低于公平级别。

公开(公告)号：US07124243B2

公开(公告)日：2006-10-17

申请号：US10440347

申请日：2003-05-16

Applicant: David Alan Burton ,  Noel Simen Otterness

Inventor： David Alan Burton ,  Noel Simen Otterness

IPC: G06F12/00

CPC classification number: G06F12/0871 ,  G06F2201/84 ,  G06F2212/284 ,  G06F2212/285 ,  G06F2212/311

Abstract: The present invention relates to a cache memory management system suitable for use with snapshot applications. The system includes a cache directory including a hash table, hash table elements, cache line descriptors, and cache line functional pointers, and a cache manager running a hashing function that converts a request for data from an application to an index to a first hash table pointer in the hash table. The first hash table pointer in turn points to a first hash table element in a linked list of hash table elements where one of the hash table elements of the linked list of hash table elements points to a first cache line descriptor in the cache directory and a cache memory including a plurality of cache lines, wherein the first cache line descriptor has a one-to-one association with a first cache line. The present invention also provides for a method converting a request for data to an input to a hashing function, addressing a hash table based on a first index output from the hashing function, searching the hash table elements pointed to by the first index for the requested data, determining the requested data is not in cache memory, and allocating a first hash table element and a first cache line descriptor that associates with a first cache line in the cache memory.

公开(公告)号：US06965979B2

公开(公告)日：2005-11-15

申请号：US10354797

申请日：2003-01-29

Applicant: David Alan Burton

Inventor： David Alan Burton

IPC: G06F11/20 ,  G06F12/08 ,  G06F12/00

CPC classification number: G06F11/1666 ,  G06F11/20 ,  G06F11/202 ,  G06F12/0866 ,  G06F2212/311

Abstract: The invention relates to host caching in data storage systems. In an embodiment, the invention provides a first host and a second host, each having memory. The host memory includes nonvolatile and volatile portions available for cache. Each host logically owns its volatile memory and the other host's nonvolatile memory. By assigning ownership in this way data can be transmitted between the hosts with little communication overhead. In addition, if the first host fails between write acknowledgment and destaging the write data, the write data is safely stored in the second nonvolatile memory of the second host. Thus, the second host can destage the data from the second nonvolatile memory. In addition, the host cache writes and reads the data rapidly by its nature.

Abstract translation: 本发明涉及数据存储系统中的主机缓存。 在一个实施例中，本发明提供了具有存储器的第一主机和第二主机。 主机存储器包括可用于缓存的非易失性和易失性部分。 每个主机逻辑上拥有其易失性存储器和另一个主机的非易失性存储器。 通过以这种方式分配所有权，可以在主机之间传输数据，同时很少的通信开销。 此外，如果第一主机在写入确认和登录写入数据之间失败，则写入数据被安全地存储在第二主机的第二非易失性存储器中。 因此，第二主机可以从第二非易失性存储器中退出数据。 此外，主机缓存根据其性质快速写入和读取数据。

公开(公告)号：US07836029B2

公开(公告)日：2010-11-16

申请号：US12586682

申请日：2009-09-25

Applicant: Kurt Alan Shoens

Inventor： Kurt Alan Shoens

IPC: G06F17/30

CPC classification number: G06F17/30088 ,  G06F11/1435 ,  G06F2201/84

Abstract: The invention relates to a method of determining if a block was modified in a file system by comparing the versions of the base snapshot, the delta snapshot, and the space map block entry (b, e). In another aspect, the invention relates to a method of searching for blocks modified in a tree structured file system. The invention relates to methods and systems of snapshot management of a file system in a data storage system. To represent the snapshots, the invention maintains pointers to the root block pointer of each snapshot. When the active file system is modified, this invention avoids overwriting any blocks used by previous snapshots by allocating new blocks for the modified blocks. When the invention needs to put an established block in a new location, it must update a parent block to point to the new location. The update to the parent block may then require allocating a new block for the new parent block and so forth. Parts of the file system not modified since a snapshot remain in place. The amount of space required to represent snapshots scales with the fraction of the file system that users modify. To maintain snapshot integrity, this invention keeps track of the first and last snapshots that use each block in space map blocks spread throughout the file system data space. When users delete snapshots, this invention may use a background process to find blocks no longer used by any snapshot and makes them available for future use.

Abstract translation: 本发明涉及通过比较基本快照，增量快照和空间地图块条目（b，e）的版本来确定文件系统中块是否被修改的方法。 在另一方面，本发明涉及一种搜索在树结构化文件系统中修改的块的方法。 本发明涉及数据存储系统中文件系统的快照管理方法和系统。 为了表示快照，本发明保持指向每个快照的根块指针的指针。 当活动文件系统被修改时，本发明通过为修改的块分配新的块来避免覆盖先前快照所使用的任何块。 当本发明需要将一个已建立的块放在新位置时，它必须更新一个父块以指向新的位置。 然后，对父块的更新可能需要为新的父块等分配新块。 文件系统的部分因为快照保留到位而未被修改。 代表快照所需的空间量会随着用户修改的文件系统的一小部分而缩放。 为了保持快照完整性，本发明记录使用遍及文件系统数据空间的空间图块中的每个块的第一个和最后一个快照。 当用户删除快照时，本发明可以使用后台进程来查找不再被任何快照使用的块，并使之可供将来使用。

公开(公告)号：US07685176B2

公开(公告)日：2010-03-23

申请号：US11521793

申请日：2006-09-15

Applicant: David Alan Burton ,  Noel Simen Otterness ,  Kurt Alan Shoens

Inventor： David Alan Burton ,  Noel Simen Otterness ,  Kurt Alan Shoens

IPC: G06F17/30

CPC classification number: G06F17/30578 ,  G06F11/2074 ,  Y10S707/99942 ,  Y10S707/99943 ,  Y10S707/99944 ,  Y10S707/99953 ,  Y10S707/99955

Abstract: The present invention relates to systems and methods of asynchronous data replication. In an embodiment, the system includes a primary host that asynchronously transmits write and sync commands where each write and sync command includes a data set ID and a sequence number. A secondary host coupled to the primary host receives the write and sync commands out of order, tracks receipt of write and sync commands, and after receipt of the write and sync commands of the data set writes blocks associated with the write commands to data storage coupled to the secondary host.

Abstract translation: 本发明涉及异步数据复制的系统和方法。 在一个实施例中，系统包括主机，其异步地发送写入和同步命令，其中每个写入和同步命令包括数据集ID和序列号。 耦合到主主机的辅助主机接收写入和同步命令无序，跟踪写入和同步命令的接收，并且在接收到与写入命令相关联的写入命令的数据组的写入和同步命令之后，将数据存储耦合 到二级主机。

公开(公告)号：US07257606B2

公开(公告)日：2007-08-14

申请号：US11147739

申请日：2005-06-07

Applicant: Vikram Kapoor ,  Kurt Alan Shoens ,  Mark Steven Schultz ,  Rex Rilen Hamilton

Inventor： Vikram Kapoor ,  Kurt Alan Shoens ,  Mark Steven Schultz ,  Rex Rilen Hamilton

IPC: G06F17/30

CPC classification number: G06F17/30067 ,  Y10S707/915 ,  Y10S707/99953 ,  Y10S707/99956

Abstract: The present invention relates to methods and systems of snapshot management of a file system in a data storage system. To represent the snapshots, the invention maintains pointers to the root block pointer of each snapshot. When the active file system is modified, this invention avoids overwriting any blocks used by previous snapshots by allocating new blocks for the modified blocks. When the invention needs to put an established block in a new location, it must update a parent block to point to the new location. The update to the parent block may then require allocating a new block for the new parent block and so forth. Parts of the file system not modified since a snapshot remain in place. The amount of space required to represent snapshots scales with the fraction of the file system that users modify. To maintain snapshot integrity, this invention keeps track of the first and last snapshots that use each block in space map blocks spread throughout the file system data space. When users delete snapshots, this invention may use a background process to find blocks no longer used by any snapshot and makes them available for future use.

Abstract translation: 本发明涉及数据存储系统中文件系统的快照管理方法和系统。 为了表示快照，本发明保持指向每个快照的根块指针的指针。 当活动文件系统被修改时，本发明通过为修改的块分配新的块来避免覆盖先前快照所使用的任何块。 当本发明需要将一个已建立的块放在新位置时，它必须更新一个父块以指向新的位置。 然后，对父块的更新可能需要为新的父块等分配新块。 文件系统的部分因为快照保留到位而未被修改。 代表快照所需的空间量会随着用户修改的文件系统的一小部分而缩放。 为了保持快照完整性，本发明记录使用遍及文件系统数据空间的空间图块中的每个块的第一个和最后一个快照。 当用户删除快照时，本发明可以使用后台进程来查找不再被任何快照使用的块，并使之可供将来使用。

公开(公告)号：US07143122B2

公开(公告)日：2006-11-28

申请号：US10696327

申请日：2003-10-28

Applicant: David Alan Burton ,  Noel Simen Otterness ,  Kurt Alan Shoens

Inventor： David Alan Burton ,  Noel Simen Otterness ,  Kurt Alan Shoens

IPC: G06F17/30

CPC classification number: G06F17/30578 ,  G06F11/2074 ,  Y10S707/99942 ,  Y10S707/99943 ,  Y10S707/99944 ,  Y10S707/99953 ,  Y10S707/99955

Abstract: The present invention relates to system and method of asynchronous data replication. In an embodiment, the system includes a primary host that asynchronously transmits write and sync commands where each write and sync command includes a data set ID and a sequence number. A secondary host coupled to the primary host receives the write and sync commands out of order, tracks receipt of write and sync commands, and after receipt of the write and sync commands of the data set writes blocks associated with the write commands to data storage coupled to the secondary host.

Abstract translation: 本发明涉及异步数据复制的系统和方法。 在一个实施例中，系统包括主机，其异步地发送写入和同步命令，其中每个写入和同步命令包括数据集ID和序列号。 耦合到主主机的辅助主机接收写入和同步命令无序，跟踪写入和同步命令的接收，并且在接收到与写入命令相关联的写入命令的数据组的写入和同步命令之后，将数据存储耦合 到二级主机。

公开(公告)号：US07136974B2

公开(公告)日：2006-11-14

申请号：US10600417

申请日：2003-06-19

Applicant: David Alan Burton ,  Noel Simen Otterness

Inventor： David Alan Burton ,  Noel Simen Otterness

IPC: G06F12/16 ,  G06F13/00

CPC classification number: G06F3/065 ,  G06F3/0608 ,  G06F3/0647 ,  G06F11/1402 ,  G06F2201/82

Abstract: The invention relates to snapshots of a data storage system including a host that communicates with a cache memory, source storage, target storage, and metadata, including a source storage for active data, a target storage to store migrated snapshot data, first metadata (e.g., bitmaps and log files with pointers) to indicate when and where the first snapshot data is in target storage, and second metadata (e.g., bitmaps and log files pointers) to indicate when and where the second snapshot data is in target storage where the first and second metadata locate the same snapshot data in the target storage. The invention maintains data consistency when reading metadata for snapshots into host memory, searching the metadata to identify snapshots that require original data to be destaged, destaging the original data to target storage, and updating the metadata to locate the original data and indicate completion of the target destage operation.

Abstract translation: 本发明涉及包括与高速缓冲存储器，源存储器，目标存储器和元数据通信的主机的数据存储系统的快照，其包括用于活动数据的源存储器，用于存储迁移的快照数据的目标存储器，第一元数据（例如， ，位图和具有指针的日志文件），以指示第一个快照数据在目标存储器中的何时和何地以及第二个元数据（例如，位图和日志文件指针），以指示第二个快照数据在目标存储中的何时和位置，其中第一个 并且第二元数据在目标存储器中定位相同的快照数据。 当将快照的元数据读入主机存储器时，本发明保持数据一致性，搜索元数据以识别需要去往原始数据的快照，将原始数据降级到目标存储，以及更新元数据以定位原始数据并指示完成 目标运行。