-
1.发明授权Method and apparatus for supporting parity protection in a RAID clustered environment 失效在RAID集群环境中支持奇偶校验保护的方法和装置公开(公告)号：US06950901B2
公开(公告)日：2005-09-27
申请号：US09755858
申请日：2001-01-05
CPC分类号： G06F11/1076 , G06F2211/1028 , H03M13/19
摘要： The present invention discloses a method, apparatus, and article of manufacture for implementing a locking structure for supporting parity protection in a RAID clustered environment. When updating parity, the parity is locked so that other nodes cannot access or modify the parity. Accordingly, the parity is locked, read, generated, written, and unlocked by a node. An enhanced protocal may combine the lock and read functions and the write and unlock functions. Further, the SCSI RESERVE and RELEASE commands may be utlized to lock/unlock the parity data. By locking the parity in this maner, overhead is mininized and does not increase as the number of nodes increases.
摘要翻译： 本发明公开了一种用于实现用于在RAID集群环境中支持奇偶校验保护的锁定结构的方法，装置和制品。 当更新奇偶校验时，奇偶校验被锁定，使得其他节点不能访问或修改奇偶校验。 因此，奇偶校验被节点锁定，读取，生成，写入和解锁。 增强的协议可以组合锁定和读取功能以及写入和解锁功能。 此外，SCSI RESERVE和RELEASE命令可以被用来锁定/解锁奇偶校验数据。 通过锁定此管理器中的奇偶校验，开销被减少，并且随着节点数量的增加而不增加。
-
公开(公告)号：US06996674B2
公开(公告)日：2006-02-07
申请号：US09851452
申请日：2001-05-07
IPC分类号： G06F12/00
CPC分类号： G06F11/2089 , G06F11/2005 , G06F11/2007 , G06F11/2017 , G06F11/2097 , G06F12/0815 , G06F12/0866 , H04L67/2814 , H04L67/2852 , H04L67/2861 , H04L69/329
摘要： A method, apparatus, and article of manufacture provide the ability to maintain cache in a clustered environment. The cache is maintained in both a primary and secondary node. When data is requested, a symbolic list in a cache directory is examined to determine which node's cache contains the requested data. If the symbolic list indicates data is not currently in cache of any node, any node may be used as the secondary node. However, if an original primary node maintains the data in cache, the original primary node is selected as the secondary node. Once a new write I/O operation is performed, the symbolic list is updated to provide. To install a new node, after applying for cluster admission, symbolic information and a modified track list is requested. The modified track list is merged with new symbolic entries and the new node then broadcasts its availability to the cluster.
摘要翻译： 方法，装置和制品提供了在集群环境中维护高速缓存的能力。 缓存在主节点和辅助节点之间维护。 当请求数据时，检查缓存目录中的符号列表以确定哪个节点的高速缓存包含所请求的数据。 如果符号列表指示数据当前不在任何节点的缓存中，则任何节点都可以用作辅助节点。 但是，如果原始主节点维护高速缓存中的数据，则选择原始主节点作为辅助节点。 一旦执行新的写入I / O操作，则更新符号列表以提供。 要安装新节点，在申请集群许可之后，请求符号信息和修改的磁道列表。 修改的轨道列表与新的符号条目合并，然后新节点向群集广播其可用性。
-
公开(公告)号：US08326891B2
公开(公告)日：2012-12-04
申请号：US12332642
申请日：2008-12-11
IPC分类号： G06F17/30
CPC分类号： G06F17/30563 , Y10S707/99931 , Y10S707/99942
摘要： Monitoring an activity profile for a given row of a database and determining a target database for a given row based on the activity profile of the given row. Identifying any row related to the given row and moving the given row and any row related to the given row into the target database while preserving referential integrity.
摘要翻译： 监视数据库给定行的活动配置文件，并根据给定行的活动配置文件确定给定行的目标数据库。 识别与给定行相关的任何行，并将给定行和与给定行相关的任何行移动到目标数据库中，同时保留参照完整性。
-
公开(公告)号：US07143240B2
公开(公告)日：2006-11-28
申请号：US10698897
申请日：2003-10-31
IPC分类号： G06F12/12
CPC分类号： G06F12/0888 , G06F12/0848 , G06F12/0871 , G06F12/121
摘要： A cost-adaptive cache including the ability to dynamically maximize performance in a caching system by preferentially caching data according to the cost of replacing data. The cost adaptive cache includes a partitioned real cache, wherein data is stored in each of the real cache partitions according to its replacement cost. Also, the cost-adaptive cache includes a partitioned phantom cache to provide a directory of information pertaining to blocks of data which do not qualify for inclusion in the real cache. The partitions in the phantom cache correspond to the partitions in the real cache. Moreover, the cost-adaptive cache maximizes performance in a system by preferentially caching data that is more costly to replace. In one embodiment of the system, the cost of replacing a block of data is estimated by the previous cost incurred to fetch that block of data.
摘要翻译： 一种成本自适应缓存，包括通过根据替换数据的成本优先缓存数据来动态地最大化缓存系统中的性能的能力。 成本自适应高速缓存包括分区真实高速缓存，其中根据其重置成本将数据存储在每个真实高速缓存分区中。 此外，成本自适应高速缓存包括分区虚拟高速缓存，以提供关于不符合包含在真实高速缓存中的数据块的信息的目录。 幻像缓存中的分区对应于实际高速缓存中的分区。 此外，成本自适应缓存通过优先缓存替换成本更高的数据来最大化系统中的性能。 在系统的一个实施例中，替换数据块的成本通过获取该数据块所需的先前成本来估计。
-
5.发明授权Storage system and method for reorganizing data to improve prefetch effectiveness and reduce seek distance 失效用于重组数据的存储系统和方法，以提高预取有效性并减少查找距离公开(公告)号：US06963959B2
公开(公告)日：2005-11-08
申请号：US10286485
申请日：2002-10-31
CPC分类号： G06F3/0613 , G06F3/064 , G06F3/0676 , G06F12/0862
摘要： A data storage system and method for reorganizing data to improve the effectiveness of data prefetching and reduce the data seek distance. A data reorganization region is allocated in which data is reorganized to service future requests for data. Sequences of data units that have been repeatedly requested are determined from a request stream, preferably using a graph where each vertex of the graph represents a requested data unit and each edge represents that a destination unit is requested shortly after a source unit the frequency of this occurrence. The most frequently requested data units are also determined from the request stream. The determined data is copied into the reorganization region and reorganized according to the determined sequences and most frequently requested units. The reorganized data might then be used to service future requests for data.
摘要翻译： 一种用于重组数据的数据存储系统和方法，以提高数据预取的有效性并减少数据寻找距离。 分配数据重组区域，其中重新组织数据以服务将来的数据请求。 已经重复请求的数据单元的序列是根据请求流确定的，优选地使用图形的每个顶点表示所请求的数据单元，并且每个边缘表示在源单元之后不久请求目标单元的频率 发生。 最常请求的数据单元也根据请求流确定。 确定的数据被复制到重组区域中，并根据所确定的序列和最常请求的单元进行重新组织。 然后可以将重组的数据用于为将来的数据请求提供服务。
-
6.发明授权Method and apparatus to prefetch sequential pages in a multi-stream environment 有权在多流环境中预取顺序页面的方法和装置公开(公告)号：US06567894B1
公开(公告)日：2003-05-20
申请号：US09456539
申请日：1999-12-08
IPC分类号： G06F1200
CPC分类号： G06F12/0862 , G06F2212/6026
摘要： The present invention is system and method for determining information that is to be prefetched in a multi-stream environment which can detect sequential streams from among the aggregate reference stream and yet requires relatively little memory to operate, which is uniquely adapted for use in a multi-stream environment, in which multiple data accessing streams are performing sequential accesses to information independently of each other. A reference address referencing stored information is received. A matching run is found. A count corresponding to the run is updated. If the count exceeds a predetermined threshold, an amount of information to prefetch is determined. If a predetermined fraction of the determined amount of information to prefetch must still be retrieved, the determined amount of information is retrieved. A matching run may be found by searching a stack comprising a plurality of entries to find an entry corresponding to the reference address. Each of the plurality of entries may be associated with a maximum accessed address, a forward range, and a backward range, and the searching step may comprise searching the plurality of stack entries in one direction starting at an end of the stack and determining whether the reference address is between (maximum accessed address−backward range) and (maximum accessed address+forward range) for each stack entry until a matching stack entry is found.
摘要翻译： 本发明是用于确定在多流环境中预取的信息的系统和方法，其可以从聚合参考流中检测顺序流，并且需要相对较少的操作内存，其被独特地适用于多 流环境，其中多个数据访问流对彼此独立的信息执行顺序访问。 接收参考存储信息的参考地址。 找到匹配的运行。 对应于运行的计数更新。 如果计数超过预定阈值，则确定预取信息量。 如果仍然需要检索到预取信息的确定量的预定分数，则检索所确定的信息量。 可以通过搜索包括多个条目的堆栈来找到与参考地址相对应的条目来找到匹配运行。 多个条目中的每一个可以与最大访问地址，前向范围和后向范围相关联，并且搜索步骤可以包括从堆栈的末尾开始的一个方向中搜索多个堆栈条目，并且确定是否 引用地址在每个堆栈条目之间（最大访问地址 - 后向范围）和（最大访问地址+转发范围）之间，直到找到匹配的堆栈条目。
-
7.发明授权Storage system and method for reorganizing data to improve prefetch effectiveness and reduce seek distance 失效用于重组数据的存储系统和方法，以提高预取有效性并减少查找距离公开(公告)号：US07076619B2
公开(公告)日：2006-07-11
申请号：US11237153
申请日：2005-09-27
IPC分类号： G06F12/00
CPC分类号： G06F3/0613 , G06F3/064 , G06F3/0676 , G06F12/0862
摘要： A method for reorganizing data in a storage device for improved performance is provided where the device stores data as data units each associated with a sequential address. The method for reorganizing data includes allocating a reorganization region capable of storing N units and grouping the data units into a plurality of extents each having a generally large number of units. The method further includes sorting the extents based on the frequency of request of the units in the extents and copying N most frequently requested units from the sorted extents into the reorganization region while preserving the order of the sorted extents and the order of the sequential addresses of the units in each extent. The method also includes servicing requests for data using data in the reorganization region.
摘要翻译： 提供了一种用于重组存储设备中的数据以提高性能的方法，其中设备将数据存储为每个与顺序地址相关联的数据单元。 重新组织数据的方法包括：分配能够存储N个单元的重组区域，并将数据单元分组成多个区段，每个区段具有大体上大量的单元。 该方法还包括根据区段中单元请求的频率对扩展区进行排序，并将N个最常请求的单元从排序的区段复制到重组区域中，同时保留排序区段的顺序和顺序地址的顺序 单位在每个范围。 该方法还包括使用重组区域中的数据来处理对数据的请求。
-
公开(公告)号：US06513093B1
公开(公告)日：2003-01-28
申请号：US09372297
申请日：1999-08-11
申请人： Ying Chen , Edward Gustav Chron , Windsor Wee Sun Hsu , Stephen Paul Morgan , Honesty Cheng Young
发明人： Ying Chen , Edward Gustav Chron , Windsor Wee Sun Hsu , Stephen Paul Morgan , Honesty Cheng Young
IPC分类号： G06F1200
CPC分类号： G06F3/0689 , G06F3/0617 , G06F3/0631 , G06F3/0638 , G06F11/1471 , G06F2211/103
摘要： A system for ensuring high reliability in a block service disk array system while promoting high performance by logically writing all changes to strides on the array while physically writing ahead to a log only a subset of the changes. Specifically, for changes of only a strip or so, the changes are written to a log, along with a commit record, and then written to disk, later deleting the changes from the log. In contrast, for relatively larger changes, i.e., for an entire (or nearly entire) stride, the old stride is not overwritten by the new, but rather is written to a new location on the disk, with the new and old locations and a commit record (but not the new stride itself) being logged and with the entries for the locations in the stride mapping table swapped with each other. In an alternate embodiment, blocks can be written to temporary locations in a RAID-1 area and lazily moved to home locations in a RAID-5 area of an array of disks.
摘要翻译： 一种用于确保块服务磁盘阵列系统的高可靠性的系统，同时通过逻辑地将所有更改写入阵列上的大步，同时在向日志中仅提前一个日志的同时提升高性能，只有一个子集的更改。 具体来说，只对一个条带进行更改，这些更改将与提交记录一起写入日志，然后写入磁盘，稍后从日志中删除更改。 相比之下，对于相对较大的变化，即对于整个（或几乎整个）步幅，旧的步幅不会被新的覆盖，而是被写入磁盘上的新位置，新旧位置和 提交记录（但不是新的步幅本身）被记录，并且步长映射表中的位置的条目彼此交换。 在替代实施例中，可以将块写入RAID-1区域中的临时位置，并且懒惰地移动到磁盘阵列的RAID-5区域中的本地位置。
-
9.发明授权System and method for efficiently supporting multiple native network protocol implementations in a single system 失效用于在单个系统中有效支持多个本地网络协议实现的系统和方法公开(公告)号：US07797392B2
公开(公告)日：2010-09-14
申请号：US10304660
申请日：2002-11-26
IPC分类号： G06F15/167
CPC分类号： H04L67/1008 , H04L67/1002 , H04L67/1012 , H04L67/1019 , H04L67/1097 , H04L67/327 , H04L69/329 , H04L2029/06054
摘要： An intelligent router routes a user request to a storage server that is capable of handling that request natively, without emulation. The request is routed automatically, without any instruction or interaction on the part of the user. The intelligent router includes a storage tank-like computing environment and a set of intelligent routers. The set of intelligent routers appears as a single entity to users by presenting a single network IP address. When the intelligent router receives a request, it examines the protocol type and routes the request to one of the appropriate storage tank clients. The intelligent router does not change the contents of the request message, and thus the storage tank system do not become aware of the existence of the intelligent router. Consequently, any return messages do not need to go through the intelligent router, unless desired.
摘要翻译： 智能路由器将用户请求路由到能够本地处理该请求的存储服务器，而不进行仿真。 请求将自动路由，不需要用户的任何指令或交互。 智能路由器包括一个存储槽状计算环境和一组智能路由器。 该智能路由器通过呈现单个网络IP地址，向用户显示单个实体。 当智能路由器接收到请求时，会检查协议类型，并将请求路由到相应的存储槽客户端之一。 智能路由器不会更改请求消息的内容，因此存储系统不会意识到智能路由器的存在。 因此，除非需要，任何返回消息都不需要经过智能路由器。
-
公开(公告)号：US07487171B2
公开(公告)日：2009-02-03
申请号：US11323407
申请日：2005-12-30
IPC分类号： G06F17/30
CPC分类号： G06F17/30563 , Y10S707/99931 , Y10S707/99942
摘要： A method for managing data is provided which includes monitoring an activity profile for a given row of a database and determining a target database for a given row based on the activity profile of the given row. The method further includes identifying any row related to the given row and moving the given row and any row related to the given row into the target database while preserving referential integrity.
摘要翻译： 提供了一种用于管理数据的方法，其包括监视数据库的给定行的活动简档，并且基于给定行的活动简档确定给定行的目标数据库。 该方法还包括识别与给定行相关的任何行，并将给定行和与给定行相关的任何行移动到目标数据库中，同时保留参照完整性。
-
-
-
-
-
-
-
-
-
搜索结果
59 条记录 (耗时 0.022 秒)
