-
公开(公告)号：US10025666B2
公开(公告)日：2018-07-17
申请号：US14823497
申请日：2015-08-11
Applicant: Compellent Technologies
Inventor： Anthony J. Floeder , Derek J. Anderson
Abstract: A method for surveying a data storage subsystem for latent errors before a failing disk drive of the data storage subsystem fails and recovering unreadable data usable to reconstruct data of the failing disk drive. The method includes determining that a disk drive of a plurality of disk drives of the data storage subsystem meets a threshold for being identified as a failing disk drive, and prior to failure of the failing disk drive, surveying at least a portion of the data on the remaining plurality of disk drives to identify data storage areas with latent errors. The identified data storage areas may be reconstructed utilizing, at least in part, data stored on the failing disk drive.
-
公开(公告)号：US09436390B2
公开(公告)日：2016-09-06
申请号：US14715838
申请日：2015-05-19
Applicant: Compellent Technologies
Inventor： Philip E. Soran , John P. Guider , Lawrence E. Aszmann , Michael J. Klemm
CPC classification number: G06F3/065 , G06F3/0608 , G06F3/0611 , G06F3/0619 , G06F3/0631 , G06F3/064 , G06F3/0647 , G06F3/0659 , G06F3/0665 , G06F3/067 , G06F3/0683 , G06F3/0689 , G06F11/108 , G06F11/1435 , G06F11/1461 , G06F11/1471 , G06F11/2089 , G06F12/02 , G06F2201/84
Abstract: A disk drive system and method capable of dynamically allocating data is provided. The disk drive system may include a RAID subsystem having a pool of storage, for example a page pool of storage that maintains a free list of RAIDs, or a matrix of disk storage blocks that maintain a null list of RAIDs, and a disk manager having at least one disk storage system controller. The RAID subsystem and disk manager dynamically allocate data across the pool of storage and a plurality of disk drives based on RAID-to-disk mapping. The RAID subsystem and disk manager determine whether additional disk drives are required, and a notification is sent if the additional disk drives are required. Dynamic data allocation and data progression allow a user to acquire a disk drive later in time when it is needed. Dynamic data allocation also allows efficient data storage of snapshots/point-in-time copies of virtual volume pool of storage, instant data replay and data instant fusion for data backup, recovery etc., remote data storage, and data progression, etc.
-
公开(公告)号：US20160147602A1
公开(公告)日：2016-05-26
申请号：US15012078
申请日：2016-02-01
Applicant: Compellent Technologies
Inventor： Michael J. Klemm , Anthony J. Floeder
CPC classification number: G06F3/0604 , G06F3/061 , G06F3/0614 , G06F3/0616 , G06F3/0619 , G06F3/0631 , G06F3/064 , G06F3/0653 , G06F3/0659 , G06F3/0665 , G06F3/0685 , G06F3/0688 , G06F3/0689 , G06F11/1096
Abstract: A method for handling input/output (I/O) in a data storage system comprising a RAID subsystem storing data according to a RAID level utilizing a parity scheme, where RAID stripes have been configured across a plurality of data storage devices. The method may include monitoring write requests to the RAID subsystem, identifying write requests destined for the same RAID stripe, and bundling the identified write requests for substantially simultaneous execution at the corresponding RAID stripe. Monitoring write requests to the RAID subsystem may include delaying at least some of the write requests to the RAID subsystem so as to build-up a queue of write requests. In some embodiments, identifying write requests and bundling the identified write requests may include identifying and bundling a number of write requests as required to perform a full stripe write to the corresponding RAID stripe.
-
公开(公告)号：US09135096B2
公开(公告)日：2015-09-15
申请号：US13706553
申请日：2012-12-06
Applicant: Compellent Technologies
Inventor： Anthony J. Floeder , Derek J. Anderson
CPC classification number: G06F11/1088 , G06F11/004 , G06F11/008 , G06F11/0703 , G06F11/0727 , G06F11/0751 , G06F11/076 , G06F11/1092 , G06F11/1448 , G06F11/2069 , G06F2211/1088
Abstract: A method for surveying a data storage subsystem for latent errors before a failing disk drive of the data storage subsystem fails and recovering unreadable data usable to reconstruct data of the failing disk drive. The method includes determining that a disk drive of a plurality of disk drives of the data storage subsystem meets a threshold for being identified as a failing disk drive, and prior to failure of the failing disk drive, surveying at least a portion of the data on the remaining plurality of disk drives to identify data storage areas with latent errors. The identified data storage areas may be reconstructed utilizing, at least in part, data stored on the failing disk drive.
Abstract translation: 在数据存储子系统的故障磁盘驱动器发生故障并恢复可用于重构故障磁盘驱动器的数据的不可读数据之前，用于测量潜在错误的数据存储子系统的方法。 该方法包括确定数据存储子系统的多个磁盘驱动器的磁盘驱动器满足阈值以被识别为故障磁盘驱动器，并且在故障磁盘驱动器故障之前，测量至少一部分数据 剩余的多个磁盘驱动器识别具有潜在错误的数据存储区域。 可以使用至少部分地存储在故障磁盘驱动器上的数据来重建识别的数据存储区域。
-
公开(公告)号：US09002792B2
公开(公告)日：2015-04-07
申请号：US13680265
申请日：2012-11-19
Applicant: Compellent Technologies
Inventor： Michael H. Pittelko
IPC: G06F17/30
CPC classification number: G06F17/30174 , G06F11/1448 , G06F11/1451 , G06F17/30097 , G06F17/30371 , G06F17/30575 , G06F2201/82 , H04L67/10
Abstract: A method for confirming replicated data at a data site, including utilizing a hash function, computing a first hash value based on first data at a first data site and utilizing the same hash function, computing a second hash value based on second data at a second data site, wherein the first data had previously been replicated from the first data site to the second data site as the second data. The method also includes comparing the first and second hash values to determine whether the second data is a valid replication of the first data. In additional embodiments, the first data may be modified based on seed data prior to computing the first hash value and the second data may be modified based on the same seed data prior to computing the second hash value. The process can be repeated to increase reliability of the results.
Abstract translation: 一种用于在数据站点确认复制数据的方法，包括利用散列函数，基于第一数据站点处的第一数据计算第一散列值并利用相同的散列函数，在第二数据位置基于第二数据计算第二散列值 数据站点，其中先前已经将第一数据从第一数据站点复制到第二数据站点作为第二数据。 该方法还包括比较第一和第二哈希值以确定第二数据是否是第一数据的有效复制。 在另外的实施例中，可以在计算第一散列值之前基于种子数据修改第一数据，并且可以在计算第二散列值之前基于相同的种子数据修改第二数据。 可以重复该过程以增加结果的可靠性。
-
Patent Agency Ranking
公开(公告)号：US20140237201A1
公开(公告)日：2014-08-21
申请号：US13768482
申请日：2013-02-15
Applicant: COMPELLENT TECHNOLOGIES
Inventor： Jeremy Dean Swift
IPC: G06F3/06
CPC classification number: H04L67/1095 , G06F3/065 , G06F17/30575 , H04L67/1097 , H04L67/2828 , H04L67/32 , H04L67/325 , H04L69/04
Abstract: A method for replicating data between two or more network connected data storage devices, the method including dynamically determining whether to compress data prior to transmitting across the network based, at least in part, on bandwidth throughput between the network connected data storage devices. If it has been determined to compress the data, the method involves compressing the data and transmitting the compressed data over the network. If it has been determined not to compress the data, the method involves transmitting the data, uncompressed, over the network. Dynamically determining whether to compress data may include comparing bandwidth measurements with a predetermined policy defining when compression should be utilized. In some embodiments, the policy may define that compression should be utilized when an estimated time for compressing the data and transmitting the compressed data is less than an estimated time for transmitting the data uncompressed.
Abstract translation: 一种用于在两个或多个网络连接的数据存储设备之间复制数据的方法，所述方法包括至少部分地基于网络连接的数据存储设备之间的带宽吞吐量来动态地确定是否在通过网络传输之前压缩数据。 如果已经确定压缩数据，则该方法包括压缩数据并通过网络发送压缩数据。 如果确定不压缩数据，则该方法涉及通过网络传送未压缩的数据。 动态确定是否压缩数据可以包括将带宽测量与预定的策略进行比较，该预定策略定义何时应当利用压缩。 在一些实施例中，策略可以定义当用于压缩数据和发送压缩数据的估计时间小于用于发送未压缩的数据的估计时间时，应当利用压缩。
-
公开(公告)号：US20140108858A1
公开(公告)日：2014-04-17
申请号：US14052822
申请日：2013-10-14
Applicant: Compellent Technologies
Inventor： Philip E. Soran , John P. Guider , Lawrence E. Aszmann , Michael J. Klemm
IPC: G06F11/10
CPC classification number: G06F3/065 , G06F3/0608 , G06F3/0611 , G06F3/0619 , G06F3/0631 , G06F3/064 , G06F3/0647 , G06F3/0659 , G06F3/0665 , G06F3/067 , G06F3/0683 , G06F3/0689 , G06F11/108 , G06F11/1435 , G06F11/1461 , G06F11/1471 , G06F11/2089 , G06F12/02 , G06F2201/84
Abstract: A disk drive system and method capable of dynamically allocating data is provided. The disk drive system may include a RAID subsystem having a pool of storage, for example a page pool of storage that maintains a free list of RAIDs, or a matrix of disk storage blocks that maintain a null list of RAIDs, and a disk manager having at least one disk storage system controller. The RAID subsystem and disk manager dynamically allocate data across the pool of storage and a plurality of disk drives based on RAID-to-disk mapping. The RAID subsystem and disk manager determine whether additional disk drives are required, and a notification is sent if the additional disk drives are required. Dynamic data allocation and data progression allow a user to acquire a disk drive later in time when it is needed. Dynamic data allocation also allows efficient data storage of snapshots/point-in-time copies of virtual volume pool of storage, instant data replay and data instant fusion for data backup, recovery etc., remote data storage, and data progression, etc.
Abstract translation: 提供了一种能够动态分配数据的磁盘驱动器系统和方法。 磁盘驱动器系统可以包括具有存储池的RAID子系统，例如维护RAID的空闲列表的存储页面池，或维持RAID的空列表的磁盘存储块的矩阵，以及具有 至少一个磁盘存储系统控制器。 RAID子系统和磁盘管理器根据RAID到磁盘映射，在存储池和多个磁盘驱动器之间动态分配数据。 RAID子系统和磁盘管理器确定是否需要其他磁盘驱动器，如果需要其他磁盘驱动器，则会发送通知。 动态数据分配和数据进展允许用户在需要时及时获取磁盘驱动器。 动态数据分配还可以高效地数据存储虚拟卷存储池，即时数据重放和数据即时融合的快照/时间点副本，用于数据备份，恢复等，远程数据存储和数据提取等。
-
8.发明授权公开(公告)号：US09329964B2
公开(公告)日：2016-05-03
申请号：US14310300
申请日：2014-06-20
Applicant: Compellent Technologies
Inventor： Dan Oelke
CPC classification number: H04L63/0807 , G06F3/0611 , G06F3/0619 , G06F3/0665 , G06F3/0689 , G06F11/1446 , G06F11/3034 , G06F11/3048 , G06F11/3419 , G06F11/3433 , G06F11/3452 , G06F11/3485 , G06F12/145 , G06F13/161 , G06F13/1642 , G06F2201/875 , H04L43/0888
Abstract: A method for managing input/output (I/O) traffic in an information handling system. The method may include receiving electronic I/O requests from a network-attached server, determining a queue depth limit, monitoring latency of processed electronic I/O requests, and processing received electronic I/O requests. The number of electronic I/O requests permitted to be processed over a period of time may be based on a mathematical combination of the queue depth limit and a latency of processed electronic I/O requests. The determined queue depth limit may be a fractional value.
Abstract translation: 一种在信息处理系统中管理输入/输出（I / O）流量的方法。 该方法可以包括从连接网络的服务器接收电子I / O请求，确定队列深度限制，监视经处理的电子I / O请求的等待时间，以及处理所接收的电子I / O请求。 允许在一段时间内处理的电子I / O请求的数量可以基于队列深度限制和处理的电子I / O请求的等待时间的数学组合。 确定的队列深度限制可以是小数值。
-
公开(公告)号：US09251049B2
公开(公告)日：2016-02-02
申请号：US14095078
申请日：2013-12-03
Applicant: Compellent Technologies
Inventor： Lawrence E. Aszmann , Michael J. Klemm , Michael H. Pittelko , Mark D. Olson
CPC classification number: G06F12/0223 , G06F3/0608 , G06F3/0644 , G06F3/0665 , G06F3/0671 , G06F3/0676 , G06F17/30138
Abstract: A process of determining explicitly free data space in computer data storage systems with implicitly allocated data space through the use of information provided by a hosting computer system with knowledge of what space allocated is currently being used at the time of a query, is provided. In one embodiment, a File System (“FS”) is asked to identify clusters no longer in use which is then mapped to physical disks as visible to an Operating System (“OS”). The physical disks are mapped to simulated/virtualized volumes presented by a storage subsystem. By using server information regarding the FS, for those pages that are no longer in use, point in time copy (“PITC”) pages are marked for future PITC and will not be coalesced forward, thereby saving significant storage.
Abstract translation: 提供了一种通过使用由主机计算机系统提供的信息来隐含分配数据空间来确定计算机数据存储系统中的明确空闲数据空间的过程，该信息在查询时正在使用当前分配的空间的知识。 在一个实施例中，文件系统（“FS”）被要求识别不再使用的簇，然后映射到操作系统（“OS”）可见的物理磁盘。 物理磁盘映射到由存储子系统呈现的模拟/虚拟化卷。 通过使用有关FS的服务器信息，对于那些不再使用的页面，时间点复制（“PITC”）页面将标记为将来的PITC，并且不会向前合并，从而节省大量存储空间。
-
10.发明申请公开(公告)号：US20150373017A1
公开(公告)日：2015-12-24
申请号：US14310300
申请日：2014-06-20
Applicant: Compellent Technologies
Inventor： Dan Oelke
CPC classification number: H04L63/0807 , G06F3/0611 , G06F3/0619 , G06F3/0665 , G06F3/0689 , G06F11/1446 , G06F11/3034 , G06F11/3048 , G06F11/3419 , G06F11/3433 , G06F11/3452 , G06F11/3485 , G06F12/145 , G06F13/161 , G06F13/1642 , G06F2201/875 , H04L43/0888
Abstract: A method for managing input/output (I/O) traffic in an information handling system. The method may include receiving electronic I/O requests from a network-attached server, determining a queue depth limit, monitoring latency of processed electronic I/O requests, and processing received electronic I/O requests. The number of electronic I/O requests permitted to be processed over a period of time may be based on a mathematical combination of the queue depth limit and a latency of processed electronic I/O requests. The determined queue depth limit may be a fractional value.
Abstract translation: 一种在信息处理系统中管理输入/输出（I / O）流量的方法。 该方法可以包括从连接网络的服务器接收电子I / O请求，确定队列深度限制，监视经处理的电子I / O请求的等待时间，以及处理所接收的电子I / O请求。 允许在一段时间内处理的电子I / O请求的数量可以基于队列深度限制和处理的电子I / O请求的等待时间的数学组合。 确定的队列深度限制可以是小数值。
-
-
-
-
-
-
-
-
-
Search Results
51
records
(took 0.021 seconds)
