公开(公告)号：US5210865A

公开(公告)日：1993-05-11

申请号：US925307

申请日：1992-08-04

申请人： Scott H. Davis ,  William L. Goleman ,  David W. Thiel

发明人： Scott H. Davis ,  William L. Goleman ,  David W. Thiel

IPC分类号： G06F11/16 ,  G06F11/20

CPC分类号： G06F11/2082 ,  G06F11/16 ,  G06F11/2087

摘要： A system and method for transferring data from a first storage medium to a second storage medium, each of the storage media being divided into corresponding data blocks, the method comprising steps of: (a) reading data stored in a first data block in the first storage medium, the first data block initially constituting a current data block; (b) comparing data read in the current data block to data stored in a corresponding data block in the second storage medium; (c) if the data compared in step b are identical, reading data stored in a different data block in the first storage medium, the different data block becoming the current data block, and returning to step b; (d) modifying the data stored in one of the storage media such that the data in the current data block is identical to the corresponding data in the second storage medium; and (e) rereading the data in the current data block and returning to step b.

摘要翻译： 一种用于将数据从第一存储介质传送到第二存储介质的系统和方法，每个存储介质被分成相应的数据块，所述方法包括以下步骤：（a）读取存储在第一数据块中的第一数据块中的数据 存储介质，所述第一数据块最初构成当前数据块; （b）将当前数据块中读取的数据与存储在第二存储介质中相应数据块中的数据进行比较; （c）如果在步骤b中比较的数据相同，则读取存储在第一存储介质中的不同数据块中的数据，将不同数据块变为当前数据块，并返回到步骤b; （d）修改存储在一个存储介质中的数据，使得当前数据块中的数据与第二存储介质中的对应数据相同; 和（e）重新读取当前数据块中的数据并返回到步骤b。

公开(公告)号：US4290013A

公开(公告)日：1981-09-15

申请号：US50993

申请日：1979-06-22

申请人： David W. Thiel

发明人： David W. Thiel

IPC分类号： G01R31/02 ,  G01R15/12

CPC分类号： G01R31/025

摘要： This disclosure is concerned with a process for connecting a short detector to electrical nodes in such apparatus as backplanes, cables and circuit boards before components are assembled thereto, to identify shorted node pairs in a substantially smaller number of tests than required by previously known methods, through a novel binary screening and then binary searching technique; the invention being especially efficient in the case where no shorts are present.

摘要翻译： 本公开涉及将组件组装到其之前的诸如背板，电缆和电路板之类的装置中的短节点连接到电节点的过程，以便以比以前已知方法要求的更小数量的测试来识别短节点对， 通过一个新颖的二进制检查和二值检索技术; 本发明在不存在短裤的情况下是特别有效的。

公开(公告)号：US06775790B2

公开(公告)日：2004-08-10

申请号：US09872980

申请日：2001-06-01

申请人： James M. Reuter ,  David W. Thiel ,  Richard F. Lary

发明人： James M. Reuter ,  David W. Thiel ,  Richard F. Lary

IPC分类号： G06F1210

CPC分类号： G06F3/0605 ,  G06F3/0608 ,  G06F3/061 ,  G06F3/0611 ,  G06F3/0614 ,  G06F3/0617 ,  G06F3/064 ,  G06F3/0647 ,  G06F3/065 ,  G06F3/0665 ,  G06F3/067 ,  G06F3/0683 ,  G06F11/0727 ,  G06F11/0772 ,  G06F11/0793 ,  G06F11/1435 ,  G06F11/1451

摘要： 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.

摘要翻译： 本发明提供一种虚拟存储系统，其通常存储使用更大的分段，但是在数据移动操作期间将大段划分成更小的子段。 本发明提供了一种方法和系统，其具有这种分段大小的层级，即用于正常情况的大段，同时在数据移动期间将大段分割成单个磁盘块。 映射具有大的段，除了正在进行数据移动的段。 对于这些段，希望具有可能的最小段大小，即单个磁盘块。 这样，管理成本通常较低，但是避免了由大数据块移动引起的延迟。

公开(公告)号：US06718404B2

公开(公告)日：2004-04-06

申请号：US09872721

申请日：2001-06-01

申请人： James M. Reuter ,  David W. Thiel ,  Richard F. Wrenn ,  Robert G. Bean

发明人： James M. Reuter ,  David W. Thiel ,  Richard F. Wrenn ,  Robert G. Bean

IPC分类号： G06F1314

CPC分类号： G06F3/0605 ,  G06F3/0608 ,  G06F3/061 ,  G06F3/0611 ,  G06F3/0614 ,  G06F3/0617 ,  G06F3/064 ,  G06F3/0647 ,  G06F3/065 ,  G06F3/0665 ,  G06F3/067 ,  G06F3/0683 ,  G06F11/0727 ,  G06F11/0772 ,  G06F11/0793 ,  G06F11/1435 ,  G06F11/1451

摘要： A system for moving physically stored data in a distributed, virtualized storage network is disclosed. A group of data sets is written to a first storage device as part of a write operation such as migration. A plurality of storage devices partially filled with data are designated as substitutes. The write operation to the first storage device is suspended upon receiving a request to read a data set stored in the first storage device, such as occurs in a recall operation. A second storage device is then selected from the plurality of substitute storage devices. The write operation is continued by writing data sets from the group of data sets included in the write operation that were not written to the first storage device to the selected second storage device. The requested data is then read from the first storage device. After data has been read from the first storage device, the first storage device may be designated as a substitute storage device so that the partially filled first storage device may be selected for continuing write operations. Data sets from substitute storage devices may be transferred or merged into a lesser number of storage devices during recycle operations to prevent the number of substitute storage devices from increasing beyond a predetermined limit or goal. Recycling operations in which data sets from different storage devices are transferred or merged may be performed by building a first queue including a list of filled tapes ordered according to the least amount of valid data and a second queue including all unassociated partially filled storage devices ordered by the amount of available storage space, and merging.

摘要翻译： 公开了一种用于在分布式虚拟化存储网络中移动物理存储数据的系统。 作为诸如迁移的写入操作的一部分，将一组数据集写入第一存储设备。 部分填充数据的多个存储装置被指定为替代品。 在接收到读取存储在第一存储装置中的数据集的请求时，例如在召回操作中发生的情况下，暂停对第一存储装置的写入操作。 然后从多个替代存储装置中选择第二存储装置。 通过从未写入第一存储装置的写入操作中包括的数据组组写入到所选择的第二存储装置来继续写入操作。 然后从第一存储设备读取所请求的数据。 在从第一存储设备读取数据之后，可以将第一存储设备指定为替代存储设备，使得可以选择部分填充的第一存储设备用于继续写入操作。 来自替代存储设备的数据集可以在再循环操作期间被转移或合并到较少数量的存储设备中，以防止替代存储设备的数量增加超出预定的限制或目标。 可以通过构建包括根据有效数据的最少量排序的填充磁带的列表的第一队列和包括由所有未关联的部分填充的存储设备的第二队列来执行的循环操作，其中来自不同的存储设备的数据集被传送或合并 可用存储空间的数量和合并。

公开(公告)号：US07197665B2

公开(公告)日：2007-03-27

申请号：US10700140

申请日：2003-11-03

申请人： Andrew C. Goldstein ,  David W. Thiel ,  Richard F. Wrenn

发明人： Andrew C. Goldstein ,  David W. Thiel ,  Richard F. Wrenn

IPC分类号： G06F11/00

CPC分类号： G06F11/1451 ,  G06F2201/84

摘要： A backup apparatus and method suitable for protecting the data volume in a computer system function by acquiring a base state snapshot and a sequential series of data volume snapshots, the apparatus concurrently generating succedent and precedent lists of snapshot differences which are used to create succedent and precedent backups respectively. The data volume is restored by overwriting the base state data with data blocks identified in one or more succedent backups. File recovery is accomplished by overwriting data from a current snapshot with one or more precedent backups.

摘要翻译： 一种适用于通过获取基本状态快照和一系列数据卷快照来保护计算机系统功能中的数据量的备份设备和方法，该设备同时生成用于创建后续和先例的快照差异的先后和先前列表 备份分别。 通过在一个或多个后续备份中标识的数据块覆盖基本状态数据来恢复数据卷。 文件恢复是通过使用一个或多个先例备份覆盖来自当前快照的数据来实现的。

公开(公告)号：US06961838B2

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

申请号：US09872597

申请日：2001-06-01

申请人： James M. Reuter ,  David W. Thiel ,  Richard F. Wrenn ,  Robert G. Bean

发明人： James M. Reuter ,  David W. Thiel ,  Richard F. Wrenn ,  Robert G. Bean

IPC分类号： G06F3/06 ,  G06F11/14 ,  G06F12/00 ,  G06F12/08 ,  G06F12/10 ,  G06F13/14 ,  G06F13/00

CPC分类号： G06F3/0605 ,  G06F3/0608 ,  G06F3/061 ,  G06F3/0611 ,  G06F3/0614 ,  G06F3/0617 ,  G06F3/064 ,  G06F3/0647 ,  G06F3/065 ,  G06F3/0665 ,  G06F3/067 ,  G06F3/0683 ,  G06F11/0727 ,  G06F11/0772 ,  G06F11/0793 ,  G06F11/1435 ,  G06F11/1451

摘要： The present invention provides a method for copying data through a virtualized storage system using distributed table driven (I/O) mapping. In a system having a virtual disk (the “original disk”), a persistent mapping table for this virtual disk exists on a controller, and volatile copies of some or all entries in this mapping table are distributed to one or more more mapping agents. The method of the present invention creates a new virtual disk mapping table that has the exact same entries as the mapping table as the original virtual disk. The new snapshot disk then shares the same storage as the original disk, so it is space efficient. Furthermore, creating new snapshot disk involves only copying the contents of the mapping table, not moving data, so the creation is fast. In order to allow multiple virtual disks to share storage segments, writes to either the original virtual disk or the snapshot copy cannot be seen by the other. Therefore, in addition to simply copying the mapping table, both the original and snapshot disk mapping table must also cause writes to these disks to be handled specially. Finally, any changes to the original disk mapping table stored in the controller must be coordinated with the volatile copies stored in the mapping agent in such a way so that all hosts see a consistent view of that disk.

摘要翻译： 本发明提供一种使用分布式表驱动（I / O）映射通过虚拟化存储系统复制数据的方法。 在具有虚拟磁盘（“原始磁盘”）的系统中，在该控制器上存在该虚拟磁盘的持久性映射表，并将该映射表中的一些或所有条目的易失性副本分发到一个或多个映射代理。 本发明的方法创建一个新的虚拟磁盘映射表，其具有与原始虚拟磁盘相同的条目与映射表。 新的快照磁盘与原始磁盘共享相同的存储空间，因此它具有空间效率。 此外，创建新的快照磁盘仅涉及复制映射表的内容，而不是移动数据，因此创建速度很快。 为了允许多个虚拟磁盘共享存储段，对原始虚拟磁盘或快照副本的写入不能被另一个看到。 因此，除了简单地复制映射表之外，原始和快照磁盘映射表也必须导致对这些磁盘的写入被特别处理。 最后，存储在控制器中的原始磁盘映射表的任何更改必须与存储在映射代理中的易失性副本进行协调，以使所有主机都能看到该磁盘的一致视图。

公开(公告)号：US06665815B1

公开(公告)日：2003-12-16

申请号：US09599707

申请日：2000-06-22

申请人： Andrew C. Goldstein ,  David W. Thiel ,  Richard F. Wrenn

发明人： Andrew C. Goldstein ,  David W. Thiel ,  Richard F. Wrenn

IPC分类号： G06F1100

CPC分类号： G06F11/1451 ,  G06F2201/84

摘要： A backup apparatus and method suitable for protecting the data volume in a computer system function by acquiring a base state snapshot and a sequential series of data volume snapshots, the apparatus concurrently generating succedent and precedent lists of snapshot differences which are used to create succedent and precedent backups respectively. The data volume is restored by overwriting the base state data with data blocks identified in one or more succedent backups. File recovery is accomplished by overwriting data from a current snapshot with one or more precedent backups.

摘要翻译： 一种适用于通过获取基本状态快照和一系列数据卷快照来保护计算机系统功能中的数据量的备份设备和方法，该设备同时生成用于创建后续和先例的快照差异的先后和先前列表 备份分别。 通过在一个或多个后续备份中标识的数据块覆盖基本状态数据来恢复数据卷。 文件恢复是通过使用一个或多个先例备份覆盖来自当前快照的数据来实现的。

公开(公告)号：US5390327A

公开(公告)日：1995-02-14

申请号：US85021

申请日：1993-06-29

申请人： Clark E. Lubbers ,  David W. Thiel

发明人： Clark E. Lubbers ,  David W. Thiel

IPC分类号： G06F11/10 ,  G11B20/18 ,  G06F11/20

CPC分类号： G06F11/1084 ,  G11B20/1833 ,  G06F2211/1004

摘要： In a storage system having a plurality of disks arranged in a RAID-4 or RAID-5 array, a method of improving the performance and reliability of the array in the absence of a member. The method re-organizes the array into the equivalent of a higher performance and reliability RAID-0 organization while allowing concurrent high performance application access to the array and includes a deliberate reorganization activity concurrent with application access. The method also restores the RAID-4 or RAID-5 organization subsequent to the failure of a member using a replacement member while continuing to allow concurrent high performance application access to the array. In order to perform this reorganization on-line state information is maintained for each parity block, each data block and the array itself. A recently removed disk may be reinserted using an expedited replacement process.

摘要翻译： 在具有以RAID-4或RAID-5阵列布置的多个盘的存储系统中，提供在不存在成员的情况下提高阵列的性能和可靠性的方法。 该方法将阵列重新组织成相当于更高性能和可靠性的RAID-0组织，同时允许并发高性能应用程序访问阵列，并包括与应用程序访问同时进行的故意重组活动。 该方法还可以在使用替换成员的成员发生故障之后恢复RAID-4或RAID-5组织，同时继续允许并发高性能应用程序访问阵列。 为了执行这种重组，对于每个奇偶校验块，每个数据块和阵列本身维持在线状态信息。 可以使用快速更换过程重新插入最近删除的磁盘。

公开(公告)号：US5247618A

公开(公告)日：1993-09-21

申请号：US882765

申请日：1992-05-11

申请人： Scott H. Davis ,  William L. Goleman ,  David W. Thiel ,  Robert G. Bean ,  James A. Zahrobsky

发明人： Scott H. Davis ,  William L. Goleman ,  David W. Thiel ,  Robert G. Bean ,  James A. Zahrobsky

IPC分类号： G06F11/14 ,  G06F11/16 ,  G06F11/20

CPC分类号： G06F11/2071 ,  G06F11/16

摘要： A method and apparatus for transferring data between two storage media, and is used in an illustrative embodiment to transfer data between two storage media in a shadow set, the storage media being accessible to one or more host processors. The method of the preferred embodiment includes the steps of: A. receiving a command from one of the host processors, the command specifying data to be transferred from a first storage medium to a second storage medium; B. transferring the data specified in the command received from the host from the first storage medium to the second storage medium in a series of subtransfers, each of the subtransfers transferring a portion of the data; and C. processing one or more I/O requests to the shadow set received from one or more host processors by, for each received I/O request: a. implementing the I/O request if the I/O request does not involve a section of the shadow set currently involved in one of the subtransfers; and b. stalling the I/O request if the I/O request involves a section of said shadow set currently involved in one of the subtransfers, and implementing the I/O request when the subtransfer has completed.

摘要翻译： 一种用于在两个存储介质之间传送数据的方法和装置，并且在说明性实施例中用于在影子集中的两个存储介质之间传送数据，该存储介质可由一个或多个主机处理器访问。 优选实施例的方法包括以下步骤：A.从主处理器之一接收命令，指定要从第一存储介质传送到第二存储介质的数据; 在一系列的子传输中，将从主机接收的命令中指定的数据从第一存储介质传送到第二存储介质，每个子传输传送数据的一部分; 以及C.对于每个接收的I / O请求，通过针对每个所接收的I / O请求，处理对从一个或多个主机处理器接收的影子集的一个或多个I / O请求：a。 如果I / O请求不涉及其中一个子传输中当前涉及的影子集的一部分，则实现I / O请求; 和b。 如果I / O请求涉及当前涉及其中一个子传输的所述影子集的一部分，并且在子传输完成时实现I / O请求，则停止I / O请求。