公开(公告)号：US08458399B2

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

申请号：US12948321

申请日：2010-11-17

Applicant: Donald R. Humlicek ,  Timothy R. Snider ,  Brian D. McKean

Inventor： Donald R. Humlicek ,  Timothy R. Snider ,  Brian D. McKean

IPC: G06F12/00

CPC classification number: G06F12/0646 ,  G06F11/3409 ,  G06F11/3485 ,  G06F12/0802 ,  G06F2201/81 ,  G06F2201/88 ,  G06F2201/885

Abstract: Methods and structure for automated determination and reconfiguration of the size of a cache memory in a storage system. Features and aspects hereof generate historical information regarding frequency of hits on cache lines in the cache memory. The history maintained is then analyzed to determine a desired cache memory size. The historical information regarding cache memory usage may be communicated to a user who may then direct the storage system to reconfigure its cache memory to a desired cache memory size. In other embodiments, the storage system may automatically determine the desired cache memory size and reconfigure its cache memory. The method may be performed automatically periodically, and/or in response to a user's request, and/or in response to detecting thrashing caused by least recently used (LRU) cache replacement algorithms in the storage system.

Abstract translation: 用于自动确定和重新配置存储系统中的高速缓存的大小的方法和结构。 其特征和方面产生关于高速缓冲存储器中的高速缓存行上的命中频率的历史信息。 然后分析维护的历史以确定期望的高速缓冲存储器大小。 关于高速缓存存储器使用的历史信息可以被传送给用户，用户然后可以指示存储系统将其高速缓冲存储器重新配置到期望的高速缓冲存储器大小。 在其他实施例中，存储系统可以自动确定期望的高速缓冲存储器大小并重新配置其高速缓冲存储器。 可以周期性地和/或响应于用户的请求和/或响应于检测由存储系统中最近最少使用的（LRU）高速缓存替换算法引起的抖动来自动执行该方法。

公开(公告)号：US20080307160A1

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

申请号：US12191445

申请日：2008-08-14

Applicant: Donald R. Humlicek

Inventor： Donald R. Humlicek

IPC: G06F12/08

CPC classification number: G06F12/0804 ,  G06F12/0811 ,  G06F12/0866 ,  G06F2212/1032

Abstract: Methods and associated structures for utilizing write-back cache management modes for local cache memory of disk drives coupled to a storage controller while maintaining data integrity of the data transferred to the local cache memories of affected disk drives. In one aspect hereof, a state machine model of managing cache blocks in a storage controller cache memory maintains blocks in the storage controller's cache memory in a new state until verification is sensed that the blocks have been successfully stored on the persistent storage media of the affected disk drives. Responsive to failure or other reset of the disk drive, the written cache blocks may be re-written from the copy maintained in the cache memory of the storage controller. In another aspect, an alternate controller's cache memory may also be used to mirror the cache blocks from the primary storage controller's cache memory as additional data integrity assurance.

Abstract translation: 用于利用写回缓存管理模式的磁盘驱动器的本地高速缓存存储器的方法和相关联的结构，该存储器耦合到存储控制器，同时保持传输到受影响的磁盘驱动器的本地高速缓冲存储器的数据的完整性。 在一个方面，管理存储控制器高速缓存存储器中的高速缓存块的状态机模型在新状态下维持存储控制器的高速缓冲存储器中的块，直到检测到块已被成功存储在受影响的持久存储介质上 磁盘驱动器 响应于磁盘驱动器的故障或其他重置，写入的高速缓存块可以从存储控制器的高速缓冲存储器中保存的副本重新写入。 在另一方面，备用控制器的高速缓冲存储器还可用于从主存储控制器的高速缓存存储器镜像高速缓存块作为额外的数据完整性保证。

公开(公告)号：US06671777B1

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

申请号：US09883141

申请日：2001-06-15

Applicant: Stanley E. Krehbiel ,  William P. Delaney ,  Donald R. Humlicek ,  Gregory A. Yarnell ,  Joseph G. Moore

Inventor： Stanley E. Krehbiel ,  William P. Delaney ,  Donald R. Humlicek ,  Gregory A. Yarnell ,  Joseph G. Moore

IPC: G06F1216

CPC classification number: G06F11/2058 ,  G06F11/1402 ,  G06F11/1443 ,  G06F11/2056 ,  G06F11/2087

Abstract: A data storage system and a method of managing data in the storage system. A method of performing a write to a data storage system, including a first storage device and a second storage device, may include writing a first set of header information to a first storage device and a second storage device. The first set of header information includes a first sequence number and a second sequence number, in which the first set of header information includes a first sequence number incremented to indicate a change from the second sequence number. The method may also include returning status of completion of writing the second set of header information. Invalid data or an interruption may also be detected by examining the first and second sequence numbers. Data is written to the first storage device and the second storage device. Then, a second set of header information is written to a first storage device and a second storage device. The second set of header information includes a first sequence number and a second sequence number, in which the second set of header information includes a second sequence number incremented to correspond to the first sequence number.

Abstract translation: 数据存储系统和管理存储系统中的数据的方法。 对包括第一存储设备和第二存储设备的数据存储系统执行写入的方法可以包括将第一组标题信息写入第一存储设备和第二存储设备。 第一组标题信息包括第一序列号和第二序列号，其中第一组标题信息包括递增以指示从第二序列号的改变的第一序列号。 该方法还可以包括返回完成写入第二组标题信息的状态。 也可以通过检查第一和第二序列号来检测无效的数据或中断。 数据被写入第一存储设备和第二存储设备。 然后，将第二组标题信息写入第一存储装置和第二存储装置。 第二组标题信息包括第一序列号和第二序列号，其中第二组标题信息包括递增以对应于第一序列号的第二序列号。

公开(公告)号：US06629203B1

公开(公告)日：2003-09-30

申请号：US09755458

申请日：2001-01-05

Applicant: Donald R. Humlicek

Inventor： Donald R. Humlicek

IPC: G06F1200

CPC classification number: G06F11/1435 ,  G06F3/0601 ,  G06F2003/0697 ,  G06F2201/84

Abstract: An improved shadow directory technique allocates storage space for directories in pairs in a logical volume. One of the spaces in each pair is used for a directory for locating data in the logical volume. The other space is reserved for an updated copy (shadow) of the directory if the directory is ever to be changed or updated. After the shadow directory is stored, it becomes a new directory for locating the data in place of the previous directory. The storage space containing the previous directory is unused, but retained as allocated for the next shadow directory, if needed. Since directory storage spaces are not deallocated, the improved shadow directory technique enables a simplified sequential-allocation storage management in a primarily data-add environment.

Abstract translation: 改进的影子目录技术在逻辑卷中成对分配目录的存储空间。 每对中的一个空格用于在逻辑卷中定位数据的目录。 如果目录有更改或更新，则另一个空间用于目录的更新副本（阴影）。 保存影子目录后，它将成为用于定位数据的新目录，代替上一个目录。 包含以前目录的存储空间是未使用的，但如果需要，保留为下一个影子目录的分配。 由于目录存储空间未被释放，所以改进的影子目录技术可以在主要的数据添加环境中实现简化的顺序分配存储管理。

公开(公告)号：US06412045B1

公开(公告)日：2002-06-25

申请号：US08447594

申请日：1995-05-23

Applicant: Rodney A. DeKoning ,  Donald R. Humlicek ,  Max L. Johnson ,  Curtis W. Rink

Inventor： Rodney A. DeKoning ,  Donald R. Humlicek ,  Max L. Johnson ,  Curtis W. Rink

IPC: G06F1200

CPC classification number: G06F12/0804 ,  G06F12/0866

Abstract: An apparatus and method is disclosed which enables a host computer to adjust the caching strategy used for writing its write request data to storage media during execution of various software applications. The method includes the step of generating a caching-flushing parameter in the host computer. The cache flushing parameter is then transferred from the host computer to a controller which has a cache memory. Thereafter, a quantity of write request data is written from the cache memory to a storage medium in accordance with the cache-flushing parameter.

Abstract translation: 公开了一种装置和方法，其使得主计算机能够在执行各种软件应用期间调整用于将写入请求数据写入存储介质的高速缓存策略。 该方法包括在主计算机中生成缓存刷新参数的步骤。 然后，缓存刷新参数从主机传输到具有高速缓冲存储器的控制器。 此后，根据高速缓冲存储器刷新参数，将一定量的写请求数据从高速缓冲存储器写入存储介质。

公开(公告)号：US5778426A

公开(公告)日：1998-07-07

申请号：US546861

申请日：1995-10-23

Applicant: Rodney A. DeKoning ,  Donald R. Humlicek ,  Max L. Johnson ,  Curtis W. Rink

Inventor： Rodney A. DeKoning ,  Donald R. Humlicek ,  Max L. Johnson ,  Curtis W. Rink

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

CPC classification number: G06F12/0866 ,  G06F11/1076 ,  G06F11/1088 ,  G06F2211/1009 ,  G06F2212/312

Abstract: Methods and associated data structures operable in a RAID subsystem to improve I/O performance. A two level cache data structure and associated methods are implemented with a RAID controller. The lower level cache comprises buffers holding recently utilized blocks of the disk devices. The upper level cache records which blocks are present in the lower level cache for each stripe in the RAID level 5 configuration. The upper level cache serves to reduce the overhead processing required of the RAID controller to determine which blocks are present in the lower level cache. Having more rapid access to this information by lowering the processing overhead enables the present invention to rapidly select between different write techniques to post data and error blocks from low level cache to the disk array. A RMW write technique is used to post data and error checking blocks to disk when insufficient information reside in the lower level cache. A faster Full Write technique (also referred to as Stripe Write) is used to post data and error checking blocks to disk when all required, related blocks are resident in the lower level cache. The Full Write technique reduces the total number of I/O operations required of the disk devices to post the update as compared to the RMW technique. The two level cache of the present invention enables a rapid selection between the RMW and Full Write techniques.

Abstract translation: 在RAID子系统中可操作的方法和相关数据结构可提高I / O性能。 使用RAID控制器实现两级缓存数据结构和相关联的方法。 低级缓存包括保存最近利用的盘装置的块的缓冲器。 高级缓存记录RAID级别5配置中每个条带的下级缓存中存在哪些块。 上级缓存用于减少RAID控制器所需的开销处理，以确定哪些块存在于较低级缓存中。 通过降低处理开销来更快速地访问该信息，本发明能够在不同的写入技术之间快速地选择将数据和错误块从低级缓存发布到磁盘阵列。 当不足的信息驻留在较低级别的缓存中时，使用RMW写入技术将数据和错误检查块发布到磁盘。 当所有必需的相关块驻留在较低级缓存中时，更快的全写技术（也称为条纹写入）用于将数据和错误检查块发布到磁盘。 与RMW技术相比，全写入技术减少了磁盘设备发布更新所需的I / O操作总数。 本发明的两级缓存能够在RMW和全写入技术之间进行快速选择。

公开(公告)号：US07171518B2

公开(公告)日：2007-01-30

申请号：US10817302

申请日：2004-04-02

Applicant: Charles E. Nichols ,  William A. Hetrick ,  Donald R. Humlicek

Inventor： Charles E. Nichols ,  William A. Hetrick ,  Donald R. Humlicek

IPC: G06F12/16

CPC classification number: G06F11/004 ,  G06F11/0727 ,  G06F11/0766 ,  G06F11/1008

Abstract: A method for returning a logical volume which is part of a redundant data storage system to on-line status following a disk failure within the logical volume during the time when another of that volume's disks is unavailable as a result of having its firmware updated, as an example. Data which would otherwise be changed in the logical volume due to host write requests is directed to a logging facility within the data storage system, but outside of the logical volume undergoing upgrade.

Abstract translation: 作为冗余数据存储系统的一部分的逻辑卷返回逻辑卷内的磁盘故障之后的逻辑卷的方法，在该卷的另一个卷的磁盘由于其固件被更新而不可用时，作为其更新的结果，作为 一个例子。 否则由于主机写入请求而在逻辑卷中更改的数据将被引导到数据存储系统内的日志记录工具，但是在正在升级的逻辑卷之外。

公开(公告)号：US06859890B2

公开(公告)日：2005-02-22

申请号：US10135266

申请日：2002-04-30

Applicant: Donald R. Humlicek ,  Charles E. Nichols

Inventor： Donald R. Humlicek ,  Charles E. Nichols

IPC: G06F11/10 ,  G06F11/00

CPC classification number: G06F11/1084

Abstract: A method for reducing data/parity inconsistencies due to a storage controller failure in computer storage systems with dual, independent storage controllers and a number of logical volumes comprising one or more physical disk drive devices includes recognizing a failure of the storage controller; assuming access control of the volume; and thereafter, performing at least one write to the volume, wherein, for a predetermined number of writes (N) to the volume after failure of the storage controller, new parity is calculated for the write using new data and other data (Method 2). The predetermined number of writes (N) is at least equal to or greater than the queue depth of the failed storage controller (i.e., the number of I/O operations that the failed storage controller may service at a given time. The method may be implemented by each storage controller of the computer storage system.

Abstract translation: 一种用于由于具有双独立存储控制器的计算机存储系统中的存储控制器故障以及包括一个或多个物理磁盘驱动器设备的多个逻辑卷而减少数据/奇偶校验不一致的方法包括识别存储控制器的故障; 假设访问控制的卷; 此后，对该卷执行至少一次写入，其中，对于存储控制器故障之后的卷的预定写入次数（N），针对使用新数据和其他数据的写入计算新奇偶校验（方法2） 。 预定写入数（N）至少等于或大于故障存储控制器的队列深度（即，在给定时间故障存储控制器可以服务的I / O操作的数量，该方法可以是 由计算机存储系统的每个存储控制器实现。

公开(公告)号：US06820099B1

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

申请号：US09834823

申请日：2001-04-13

Applicant: Robin Huber ,  Donald R. Humlicek

Inventor： Robin Huber ,  Donald R. Humlicek

IPC: G06F1730

CPC classification number: G06F17/30008 ,  Y10S707/99932 ,  Y10S707/99938 ,  Y10S707/99939 ,  Y10S707/99944 ,  Y10S707/99955

Abstract: In a computerized data storage system, when data is to be updated in a primary, or “base,” logical volume, a snapshot volume is formed from the base volume. The updates are then made to the snapshot volume, preferably while the base volume is still used to satisfy normal I/O (input/output) access requests. After the updating is complete, the snapshot volume is rolled back into the base volume. During the rollback, any remaining original data in the base volume and the updated data in either the base volume or snapshot volume are available for satisfying the normal I/O access requests. Thus, the updating appears to be instantaneous, since the entire updated data is immediately available upon starting the rollback.

Abstract translation: 在计算机化数据存储系统中，当要在主要或“基本”）逻辑卷中更新数据时，从基本卷形成快照卷。 然后更新到快照卷，最好在基本卷仍然用于满足正常的I / O（输入/输出）访问请求时。 更新完成后，快照卷将回滚到基本卷中。 在回滚期间，基本卷中的任何剩余原始数据和基本卷或快照卷中的更新数据都可用于满足正常的I / O访问请求。 因此，更新似乎是瞬时的，因为整个更新的数据在启动回滚时立即可用。

公开(公告)号：US06751750B1

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

申请号：US09872643

申请日：2001-06-01

Applicant: Donald R. Humlicek

Inventor： Donald R. Humlicek

IPC: G06F1100

CPC classification number: G06F11/1471

Abstract: The present invention is directed to a method of recovering a write ahead log after an interruption. In a first aspect of the present invention, a method of writing a log entry of a write ahead log may include initiating a log write to a write ahead log, the write ahead log having a first sector, and a second sector, wherein the first sector is followed by the second sector. A log entry including a sequence number is written to the second sector. Then, the log entry including the sequence number is written to the first sector.

Abstract translation: 本发明涉及一种在中断之后恢复提前记录的方法。 在本发明的第一方面，一种写入提前日志的日志条目的方法可以包括启动对写入提前日志的日志写入，写入提前日志具有第一扇区和第二扇区，其中第一 其次是第二部门。 包括序列号的日志条目被写入第二扇区。 然后，将包括序列号的日志条目写入第一扇区。