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

11. 发明授权

US5293609A Hit-density-based replacement for data cache with prefetching 失效
标题翻译：基于命中密度的替代数据缓存与预取
公开(公告)号：US5293609A
公开(公告)日：1994-03-08
申请号：US688732
申请日：1991-04-19
申请人： Feng-Hsien W. Shih , James F. Macon, Jr. , Shauchi Ong
发明人： Feng-Hsien W. Shih , James F. Macon, Jr. , Shauchi Ong
IPC分类号： G06F12/08 , G06F12/12
CPC分类号： G06F12/123 , G06F12/0862 , G06F12/0866 , G06F12/126
摘要： A least recently used cache replacement system in which the data cache is logically partitioned into two separate sections, demand and prefetch. A cache directory table and a least recently used table are used to maintain the cache. When a new demand data page is added to the cache, a most recently used (MRU) pointer is updated and points to this new page. When a prefetch page is added to the cache, the least recently used pointer of the demand section is updated with its backward pointer pointing to this new page. A cache hit on a demand of prefetch page moves that page to the top of the least recently used table. When a free page is needed in the cache, it is selected from the demand or prefetch sections of the memory based on a comparison of the demand hit density and the prefetch hit density so to maintain a balance between these two hit densities.
摘要翻译：最近最少使用的缓存替换系统，其中数据高速缓存在逻辑上被分割成两个单独的部分，需求和预取。缓存目录表和最近使用的表用于维护缓存。当新的需求数据页被添加到高速缓存时，最近使用的（MRU）指针被更新并且指向这个新页面。当预取页面被添加到高速缓存中时，需求部分的最近最少使用的指针被更新，其后向指针指向该新页面。预取页面需求的缓存命中将该页面移动到最近使用的表格的顶部。当缓存中需要空闲页面时，将根据需求命中密度与预取命中密度的比较从存储器的需求或预取部分中选择一个空白页面，以便保持这两个命中密度之间的平衡。

12. 发明授权

US07493454B2 Method for achieving reliable worm storage using WMRM storage 失效
标题翻译：使用WMRM存储实现可靠的蠕虫存储的方法
公开(公告)号：US07493454B2
公开(公告)日：2009-02-17
申请号：US10977160
申请日：2004-10-29
申请人： Windsor Wee Sun Hsu , Shauchi Ong
发明人： Windsor Wee Sun Hsu , Shauchi Ong
IPC分类号： G06F12/14 , G06F13/00
CPC分类号： G06F3/064 , G06F3/0623 , G06F3/0637 , G06F3/0674 , G06F11/1076 , G11B27/322 , G11B2220/211
摘要： The disclosure provides a method for ensuring that data stored on rewritable storage is immutable. The method includes initializing selected user-addressable blocks of storage to a writable state. In addition, the method includes accepting data to be stored in specified user-addressable blocks. Also, the method includes determining if the specified block(s) is writable. Also, the method includes storing the accepted data to the rewritable storage. Moreover, the method includes setting the state of the specified block(s) to non-writable. Each user-addressable block of storage is mapped to at least one block of rewritable storage and initializing selected user-addressable blocks of storage to a writable state includes storing predetermined bit patterns into the corresponding blocks of rewritable storage such that for each selected user-addressable block of storage, the contents of the corresponding blocks of rewritable storage satisfy a predetermined mathematical relationship.
摘要翻译：本公开提供了一种确保存储在可重写存储器上的数据是不可变的方法。该方法包括将所选择的用户可寻址的存储块初始化为可写状态。此外，该方法包括接受要存储在指定的用户可寻址块中的数据。此外，该方法包括确定指定的块是否是可写的。此外，该方法包括将可接受的数据存储到可重写存储器中。此外，该方法包括将指定块的状态设置为不可写。每个用户可寻址的存储块被映射到至少一个可重写存储块并且将所选择的可用户寻址的存储块初始化为可写状态包括将预定位模式存储到可重写存储器的相应块中，使得对于每个所选择的用户可寻址存储块，相应的可重写存储块的内容满足预定的数学关系。

13. 发明授权

US07281006B2 System and method for dividing data into predominantly fixed-sized chunks so that duplicate data chunks may be identified 有权
标题翻译：将数据分割成主要是固定大小的块的系统和方法，以便可以识别重复的数据块
公开(公告)号：US07281006B2
公开(公告)日：2007-10-09
申请号：US10693284
申请日：2003-10-23
申请人： Windsor Wee Sun Hsu , Shauchi Ong
发明人： Windsor Wee Sun Hsu , Shauchi Ong
IPC分类号： G06F17/30 , G06F11/00
CPC分类号： G06F17/30985 , Y10S707/99936 , Y10S707/99937 , Y10S707/99942 , Y10S707/99943 , Y10S707/99944 , Y10S707/99945
摘要： A data chunking system divides data into predominantly fixed-sized chunks such that duplicate data may be identified. The data chunking system may be used to reduce the data storage and save network bandwidth by allowing storage or transmission of primarily unique data chunks. The system may also be used to increase reliability in data storage and network transmission, by allowing an error affecting a data chunk to be repaired with an identified duplicate chunk. The data chunking system chunks data by selecting a chunk of fixed size, then moving a window along the data until a match to existing data is found. As the window moves across the data, unique chunks predominantly of fixed size are formed in the data passed over. Several embodiments provide alternate methods of determining whether a selected chunk matches existing data and methods by which the window is moved through the data. To locate duplicate data, the data chunking system remembers data by computing a mathematical function of a data chunk and inserting the computed value into a hash table.
摘要翻译：数据分块系统将数据分成主要固定大小的块，以便可以识别重复数据。数据分块系统可用于通过允许主要唯一数据块的存储或传输来减少数据存储并节省网络带宽。也可以通过允许使用识别的重复块来修复影响数据块的错误来提高数据存储和网络传输的可靠性。数据分块系统通过选择固定大小的块来块数据，然后沿着数据移动窗口直到找到与现有数据的匹配。当窗口移动数据时，在传递的数据中形成主要是固定大小的独特块。几个实施例提供了确定所选择的块是否匹配现有数据的替代方法，以及通过该窗口移动数据的方法。为了定位重复数据，数据分块系统通过计算数据块的数学函数并将计算的值插入散列表来记住数据。

14. 发明申请

US20060218176A1 System, method, and service for organizing data for fast retrieval 审中-公开
标题翻译：组织数据快速检索的系统，方法和服务
公开(公告)号：US20060218176A1
公开(公告)日：2006-09-28
申请号：US11089599
申请日：2005-03-24
申请人： Windsor Sun Hsu , Shauchi Ong , Qingbo Zhu
发明人： Windsor Sun Hsu , Shauchi Ong , Qingbo Zhu
IPC分类号： G06F17/00
CPC分类号： G06F16/2246 , G06F16/137 , G06F16/181 , G06F16/2272
摘要： A data organization system includes an index that offers fast retrieval of records and that protects records from logical modification. The index includes a balanced tree that grows from the root of the tree down to the leaves and requires no re-balancing. Each level in the tree includes a hash table. The hash table in each level in the tree can use a hash function that is different and independent from the hash function used in any other level in the tree. Alternatively, the hash table in each level in the tree can use a universal hash function. Possible locations of a record in the tree are fixed and determined by a hash function of a key of that record.
摘要翻译：数据组织系统包括提供快速检索记录并保护记录免于逻辑修改的索引。该索引包括从树的根部向叶生长的平衡树，不需要重新平衡。树中的每个级别都包含一个哈希表。树中每个级别的哈希表可以使用与树中任何其他级别中使用的哈希函数不同且独立的哈希函数。或者，树中每个级别的哈希表可以使用通用散列函数。树中记录的可能位置是固定的，并由该记录的密钥的散列函数决定。

15. 发明申请

US20060181980A1 SYSTEM AND METHOD FOR ENABLING EFFICIENT SMALL WRITES TO WORM STORAGE 失效
公开(公告)号：US20060181980A1
公开(公告)日：2006-08-17
申请号：US10906352
申请日：2005-02-15
申请人： Windsor Hsu , Lan Huang , Michael Ko , Shauchi Ong
发明人： Windsor Hsu , Lan Huang , Michael Ko , Shauchi Ong
IPC分类号： G11B5/09
CPC分类号： G11B27/3027 , G11B2020/1232 , G11B2020/1292 , G11B2220/218 , G11B2220/2516
摘要： According to the present invention, there is provided a method of providing a WORM storage system, the method including a sector-append capability. The method includes receiving data to be written to a WORM storage system. In addition, the method includes identifying a target sector at which the data is to be written. Also, the method includes determining if the received data can be added to the target sector. Moreover, the method includes adding the received data to the target sector if it is determined that the received data can be added to the target sector.

16. 发明授权

US07076622B2 System and method for detecting and sharing common blocks in an object storage system 失效
标题翻译：用于在对象存储系统中检测和共享公共块的系统和方法
公开(公告)号：US07076622B2
公开(公告)日：2006-07-11
申请号：US10674375
申请日：2003-09-30
申请人： Windsor Wee Sun Hsu , Shauchi Ong
发明人： Windsor Wee Sun Hsu , Shauchi Ong
IPC分类号： G06F12/00
CPC分类号： G06F11/008 , G06F11/1096 , G06F11/1662 , G06F11/2097 , G06F17/30097 , H04L67/1097
摘要： A system and method of optimizing storage of common data blocks within a networked storage system comprises receiving a data block to be stored in the networked storage system, analyzing contents of the received data block to determine how many copies of the data block the system is entrusted to store and how many copies of the data block existing within the system, and to identify a location of each copy of the data block within the system, identifying performance and reliability requirements of the system, determining an optimal number of copies of the received data block to store in the system, wherein the determination is made according to a number of copies of the data block the system is entrusted to store together with the identified performance and reliability requirements of the system, and maintaining the optimal number of copies of the received data block within the system.
摘要翻译：一种优化网络存储系统内公共数据块存储的系统和方法包括接收要存储在网络存储系统中的数据块，分析接收到的数据块的内容，以确定系统被委托的数据块的副本数存储和存储系统内存在的数据块的副本，以及识别系统内的数据块的每个副本的位置，识别系统的性能和可靠性要求，确定接收到的数据的最佳拷贝数块存储在系统中，其中根据系统被委托存储的数据块的副本数量与所识别的系统的性能和可靠性要求一起进行确定，并且保持所接收的最佳拷贝数系统内的数据块。

17. 发明授权

US5353410A Method and system for deferred read in lazy-write disk cache systems 失效
标题翻译：延迟读取方法和系统，用于延迟写入磁盘缓存系统
公开(公告)号：US5353410A
公开(公告)日：1994-10-04
申请号：US853219
申请日：1992-03-18
申请人： James F. Macon, Jr. , Shauchi Ong , Feng-Hsien Shih
发明人： James F. Macon, Jr. , Shauchi Ong , Feng-Hsien Shih
IPC分类号： G06F12/08 , G06F13/00
CPC分类号： G06F12/0804 , G06F12/0859 , G06F12/0866
摘要： Lazy Write disk cache systems are often utilized in disk cache designs. In such systems, data to be written to the disk storage system is temporarily placed in cache memory for a preselected period of time until an actual update of the disk occurs. By deferring disk write operations input/output performance efficiency is enhanced. However, in sector-based disk storage systems in which data may only be read from or written to a disk in predetermined fixed amounts an attempted update of data often requires a read of data from the disk storage system to ensure that existing data is not written over during an update. The method and system of the present invention avoids this problem by maintaining a status table for each block of cache memory which includes an identification of each byte within each block of cache memory which will be updated. A required read from the disk storage system is then deferred until an update takes place, or eliminated entirely if all bytes within a cache memory block have been updated.
摘要翻译：懒惰写磁盘缓存系统通常用于磁盘缓存设计。在这样的系统中，要写入磁盘存储系统的数据被暂时放置在高速缓冲存储器中预先选定的时间段，直到盘的实际更新发生。通过推迟磁盘写入操作，输入/输出性能效率得到提升。然而，在基于扇区的磁盘存储系统中，数据只能以预定的固定量读取或写入磁盘，所以尝试更新数据通常需要从磁盘存储系统读取数据，以确保现有的数据不被写入在更新过程中。本发明的方法和系统通过维护每个高速缓冲存储器块的状态表来避免这个问题，该状态表包括将被更新的高速缓冲存储器的每个块内的每个字节的标识。然后延迟从磁盘存储系统读取所需的读取，直到更新发生，或者如果高速缓冲存储器块中的所有字节都被更新，则完全消除。

18. 发明申请

US20090320146A1 SYSTEM AND METHOD FOR SECURING DATA WITHIN A STORAGE SYSTEM 有权
标题翻译：用于在存储系统中保护数据的系统和方法
公开(公告)号：US20090320146A1
公开(公告)日：2009-12-24
申请号：US12130970
申请日：2008-05-30
申请人： Windsor Wee Sun Hsu , Shauchi Ong
发明人： Windsor Wee Sun Hsu , Shauchi Ong
IPC分类号： G08B13/00 , G06F12/14
CPC分类号： G06F11/004 , G06F3/0623 , G06F3/0637 , G06F3/0674
摘要： According to the present invention, there is provided a system for securing data with a storage system. The system includes at least one storage device. In addition, the system includes a security mechanism for recognizing an attempt to insert or remove the storage device. Moreover, the system includes a management unit to control the insertion and removal of the storage device.
摘要翻译：根据本发明，提供了一种用于利用存储系统来保护数据的系统。该系统包括至少一个存储设备。此外，该系统包括用于识别插入或移除存储设备的尝试的安全机制。此外，该系统包括用于控制存储设备的插入和移除的管理单元。

19. 发明授权

US07512044B2 System and method for enabling efficient small writes to WORM storage 失效
标题翻译：用于实现WORM存储的高效小写的系统和方法
公开(公告)号：US07512044B2
公开(公告)日：2009-03-31
申请号：US10906352
申请日：2005-02-15
申请人： Windsor Wee Sun Hsu , Lan Huang , Michael Anthony Ko , Shauchi Ong
发明人： Windsor Wee Sun Hsu , Lan Huang , Michael Anthony Ko , Shauchi Ong
IPC分类号： G11B27/36
CPC分类号： G11B27/3027 , G11B2020/1232 , G11B2020/1292 , G11B2220/218 , G11B2220/2516
摘要： According to the present invention, there is provided a method of providing a WORM storage system, the method including a sector-append capability. The method includes receiving data to be written to a WORM storage system. In addition, the method includes identifying a target sector at which the data is to be written. Also, the method includes determining if the received data can be added to the target sector. Moreover, the method includes adding the received data to the target sector if it is determined that the received data can be added to the target sector.
摘要翻译：根据本发明，提供了一种提供WORM存储系统的方法，该方法包括扇区附加能力。该方法包括接收要写入WORM存储系统的数据。此外，该方法包括识别要写入数据的目标扇区。此外，该方法包括确定所接收的数据是否可以被添加到目标扇区。此外，如果确定可以将接收的数据添加到目标扇区，则该方法包括将接收到的数据添加到目标扇区。

20. 发明授权

US07293035B2 System and method for performing compression/encryption on data such that the number of duplicate blocks in the transformed data is increased 失效
标题翻译：对数据执行压缩/加密的系统和方法使得变换数据中的重复块的数量增加
公开(公告)号：US07293035B2
公开(公告)日：2007-11-06
申请号：US10880843
申请日：2004-06-30
申请人： Windsor Wee Sun Hsu , Shauchi Ong
发明人： Windsor Wee Sun Hsu , Shauchi Ong
IPC分类号： G06F17/30
CPC分类号： H03M7/3084 , Y10S707/99942
摘要： Desired transformations such as compression, encryption and/or encoding are applied to data such that the number of duplicate chunks in the transformed data is increased and the chunks are predominantly of a predetermined size. Additionally, the unique and duplicate chunks of transformed data are identified. A variable-sized window is passed over the set of data to generate a working chunk of transformed data that is of the predetermined size. When the working chunk is a duplicate chunk of data, a next group of untransformed data is selected from the set of data, transformed and then evaluated. When the working chunk is not a duplicate chunk of data, a next group of data is selected by sliding the window over the set of data to generate another working chunk that is evaluated.
摘要翻译：期望的变换例如压缩，加密和/或编码被应用于数据，使得变换数据中的重复块的数量增加，并且块主要是预定大小。另外，识别出转换数据的独特和重复的块。可变大小的窗口在该组数据上传递以生成具有预定大小的变换数据的工作块。当工作块是重复的数据块时，从数据集中选择下一组未转换的数据，进行变换，然后进行评估。当工作块不是重复的数据块时，通过在该组数据上滑动窗口来生成另一个被评估的工作块来选择下一组数据。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式