专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US06549969B1 Interlock for preventing human error in hot pluggable systems 有权
标题翻译：联锁，以防止热插拔系统中的人为错误
公开(公告)号：US06549969B1
公开(公告)日：2003-04-15
申请号：US09515371
申请日：2000-02-29
申请人： Windsor Wee Sun Hsu , Stephen Paul Morgan , Shauchi Ong , Honesty Cheng Young
发明人： Windsor Wee Sun Hsu , Stephen Paul Morgan , Shauchi Ong , Honesty Cheng Young
IPC分类号： G06F1300
CPC分类号： G11B33/125 , E05B17/22 , E05B47/0012 , E05B2047/0017 , E05B2047/0069 , G06F1/183 , G06F13/4081
摘要： A hot pluggable system includes an interlock between a component fail detect module and a component lock mechanism, such that the component is locked in place when it operates properly and is automatically released to permit a person to remove the component from the system when the component fails. In this way, the risk of human errors in removing the wrong component is reduced.
摘要翻译：热插拔系统包括组件故障检测模块和组件锁定机构之间的互锁，使得组件在其正常工作时被锁定就位，并且当组件发生故障时自动释放以允许人员从系统中移除组件。以这种方式，减少了错误组件中人为错误的风险。

2. 发明授权

US06826668B1 System and method for reorganizing data on a disk drive to improve spatial locality 失效
标题翻译：用于重新组织磁盘驱动器上的数据以提高空间局部性的系统和方法
公开(公告)号：US06826668B1
公开(公告)日：2004-11-30
申请号：US09412902
申请日：1999-10-05
申请人： Windsor Wee Sun Hsu , Shauchi Ong , Honesty Cheng Young
发明人： Windsor Wee Sun Hsu , Shauchi Ong , Honesty Cheng Young
IPC分类号： G06F1200
CPC分类号： G06F3/064 , G06F3/0613 , G06F3/0676 , G11B20/10
摘要： A computer-implemented method for clustering related data pages in close physical proximity to each other on a magnetic disk drive or other storage device. The method includes identifying relationships between the pages, with the relationships being established not simply by time of page access, but rather by user access patterns. The pages are clustered based on the relationships. To undertake the clustering, the pages and references can be represented and analyzed as respective vertices and edges in edge graphs.
摘要翻译：一种计算机实现的方法，用于在磁盘驱动器或其他存储设备上将彼此紧密物理接近的相关数据页进行聚类。该方法包括识别页面之间的关系，其关系不是简单地由页面访问的时间建立，而是由用户访问模式。这些页面根据关系进行聚类。为了进行聚类，页面和引用可以被表示和分析为边缘图中的各个顶点和边。

3. 发明授权

US06950901B2 Method and apparatus for supporting parity protection in a RAID clustered environment 失效
标题翻译：在RAID集群环境中支持奇偶校验保护的方法和装置
公开(公告)号：US06950901B2
公开(公告)日：2005-09-27
申请号：US09755858
申请日：2001-01-05
申请人： Lawrence Yium-Chee Chiu , Windsor Wee Sun Hsu , Honesty Cheng Young
发明人： Lawrence Yium-Chee Chiu , Windsor Wee Sun Hsu , Honesty Cheng Young
IPC分类号： G06F9/00 , G06F12/00 , G06F13/00 , H03M13/00
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命令可以被用来锁定/解锁奇偶校验数据。通过锁定此管理器中的奇偶校验，开销被减少，并且随着节点数量的增加而不增加。

4. 发明授权

US08326891B2 Managing a hierarchy of databases 有权
标题翻译：管理数据库的层次结构
公开(公告)号：US08326891B2
公开(公告)日：2012-12-04
申请号：US12332642
申请日：2008-12-11
申请人： Windsor Wee Sun Hsu , Honesty Cheng Young
发明人： Windsor Wee Sun Hsu , Honesty Cheng Young
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.
摘要翻译：监视数据库给定行的活动配置文件，并根据给定行的活动配置文件确定给定行的目标数据库。识别与给定行相关的任何行，并将给定行和与给定行相关的任何行移动到目标数据库中，同时保留参照完整性。

5. 发明授权

US07143240B2 System and method for providing a cost-adaptive cache 失效
标题翻译：用于提供成本自适应高速缓存的系统和方法
公开(公告)号：US07143240B2
公开(公告)日：2006-11-28
申请号：US10698897
申请日：2003-10-31
申请人： Windsor Wee Sun Hsu , Honesty Cheng Young
发明人： Windsor Wee Sun Hsu , Honesty Cheng Young
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.
摘要翻译：一种成本自适应缓存，包括通过根据替换数据的成本优先缓存数据来动态地最大化缓存系统中的性能的能力。成本自适应高速缓存包括分区真实高速缓存，其中根据其重置成本将数据存储在每个真实高速缓存分区中。此外，成本自适应高速缓存包括分区虚拟高速缓存，以提供关于不符合包含在真实高速缓存中的数据块的信息的目录。幻像缓存中的分区对应于实际高速缓存中的分区。此外，成本自适应缓存通过优先缓存替换成本更高的数据来最大化系统中的性能。在系统的一个实施例中，替换数据块的成本通过获取该数据块所需的先前成本来估计。

6. 发明授权

US06963959B2 Storage system and method for reorganizing data to improve prefetch effectiveness and reduce seek distance 失效
标题翻译：用于重组数据的存储系统和方法，以提高预取有效性并减少查找距离
公开(公告)号：US06963959B2
公开(公告)日：2005-11-08
申请号：US10286485
申请日：2002-10-31
申请人： Windsor Wee Sun Hsu , Honesty Cheng Young
发明人： Windsor Wee Sun Hsu , Honesty Cheng Young
IPC分类号： G06F3/06 , G06F12/08 , G06F12/00
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.
摘要翻译：一种用于重组数据的数据存储系统和方法，以提高数据预取的有效性并减少数据寻找距离。分配数据重组区域，其中重新组织数据以服务将来的数据请求。已经重复请求的数据单元的序列是根据请求流确定的，优选地使用图形的每个顶点表示所请求的数据单元，并且每个边缘表示在源单元之后不久请求目标单元的频率发生。最常请求的数据单元也根据请求流确定。确定的数据被复制到重组区域中，并根据所确定的序列和最常请求的单元进行重新组织。然后可以将重组的数据用于为将来的数据请求提供服务。

7. 发明授权

US06567894B1 Method and apparatus to prefetch sequential pages in a multi-stream environment 有权
标题翻译：在多流环境中预取顺序页面的方法和装置
公开(公告)号：US06567894B1
公开(公告)日：2003-05-20
申请号：US09456539
申请日：1999-12-08
申请人： Windsor Wee Sun Hsu , Honesty Cheng Young
发明人： Windsor Wee Sun Hsu , Honesty Cheng Young
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.
摘要翻译：本发明是用于确定在多流环境中预取的信息的系统和方法，其可以从聚合参考流中检测顺序流，并且需要相对较少的操作内存，其被独特地适用于多流环境，其中多个数据访问流对彼此独立的信息执行顺序访问。接收参考存储信息的参考地址。找到匹配的运行。对应于运行的计数更新。如果计数超过预定阈值，则确定预取信息量。如果仍然需要检索到预取信息的确定量的预定分数，则检索所确定的信息量。可以通过搜索包括多个条目的堆栈来找到与参考地址相对应的条目来找到匹配运行。多个条目中的每一个可以与最大访问地址，前向范围和后向范围相关联，并且搜索步骤可以包括从堆栈的末尾开始的一个方向中搜索多个堆栈条目，并且确定是否引用地址在每个堆栈条目之间（最大访问地址 - 后向范围）和（最大访问地址+转发范围）之间，直到找到匹配的堆栈条目。

8. 发明授权

US07797392B2 System and method for efficiently supporting multiple native network protocol implementations in a single system 失效
标题翻译：用于在单个系统中有效支持多个本地网络协议实现的系统和方法
公开(公告)号：US07797392B2
公开(公告)日：2010-09-14
申请号：US10304660
申请日：2002-11-26
申请人： Windsor Wee Sun Hsu , Jaishankar Moothedath Menon , Honesty Cheng Young
发明人： Windsor Wee Sun Hsu , Jaishankar Moothedath Menon , Honesty Cheng Young
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地址，向用户显示单个实体。当智能路由器接收到请求时，会检查协议类型，并将请求路由到相应的存储槽客户端之一。智能路由器不会更改请求消息的内容，因此存储系统不会意识到智能路由器的存在。因此，除非需要，任何返回消息都不需要经过智能路由器。

9. 发明授权

US07487171B2 System and method for managing a hierarchy of databases 失效
标题翻译：用于管理数据库层次的系统和方法
公开(公告)号：US07487171B2
公开(公告)日：2009-02-03
申请号：US11323407
申请日：2005-12-30
申请人： Windsor Wee Sun Hsu , Honesty Cheng Young
发明人： Windsor Wee Sun Hsu , Honesty Cheng Young
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.
摘要翻译：提供了一种用于管理数据的方法，其包括监视数据库的给定行的活动简档，并且基于给定行的活动简档确定给定行的目标数据库。该方法还包括识别与给定行相关的任何行，并将给定行和与给定行相关的任何行移动到目标数据库中，同时保留参照完整性。

10. 发明授权

US06282613B1 Very efficient technique for dynamically tracking locality of a reference 失效
标题翻译：非常有效的技术来动态跟踪参考的位置
公开(公告)号：US06282613B1
公开(公告)日：2001-08-28
申请号：US09303520
申请日：1999-04-30
申请人： Windsor Wee Sun Hsu , Honesty Cheng Young
发明人： Windsor Wee Sun Hsu , Honesty Cheng Young
IPC分类号： G06F1208
CPC分类号： G06F12/0802 , G06F11/3452 , G06F11/3457 , G06F12/0866 , G06F2201/885
摘要： A cache management system determines stack distance by determining the stack reuse distance, less the number of duplicate pages in the system trace. The stack reuse distance is defined as the number of references between the first reference to a datum and the next reference to the same datum. The stack reuse distance can be easily calculated by maintaining a count of data references in a stream. The system also recognizes that the number of duplicate pages in a cache can be approximated in a probabilistic manner, thereby improving the efficiency of the cache analysis. Stack distance can be approximated during normal system operation and stack analysis can be performed in a dynamic manner for optimal cache tuning in response to data reference workloads. Thus, the cache miss ratio curve is generated either from a system trace in an off-line mode, or in real time during normal system operation.
摘要翻译：缓存管理系统通过确定堆栈重用距离来确定堆栈距离，减少系统跟踪中重复页面的数量。堆栈重用距离定义为第一次引用基准和下一次引用相同基准之间的引用次数。可以通过维持流中数据引用的计数来轻松计算堆栈重用距离。该系统还认识到可以以概率的方式近似高速缓存中的重复页面数量，从而提高高速缓存分析的效率。堆栈距离可以在正常系统操作期间近似，并且可以以动态方式执行堆栈分析，以便响应于数据参考工作负载进行最佳高速缓存调整。因此，高速缓存未命中比曲线可以从离线模式的系统跟踪或在正常系统操作期间实时生成。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式