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

1. 发明授权

US4714992A Communication for version management in a distributed information service 失效
标题翻译：在分布式信息服务中进行版本管理的通信
公开(公告)号：US4714992A
公开(公告)日：1987-12-22
申请号：US801897
申请日：1985-11-26
申请人： Henry M. Gladney , Douglas J. Lorch , Richard L. Mattson
发明人： Henry M. Gladney , Douglas J. Lorch , Richard L. Mattson
IPC分类号： G06F12/00 , G06F17/30 , G06F1/00
CPC分类号： G06F17/30575 , G06F2216/09 , Y10S707/99953 , Y10S707/99957
摘要： In a distributed processing system network in which at least one node operates as a source location having access to data objects of a database, and at least one other node operates as a replica location storing replicas of data objects from the source location, managing obsolescence of the replicas is performed by having the replica locations submitting requests to the source location for ascertaining obsolescence of data objects. The source location, responsive to a request from a requesting replica location, extracts identifiers of a set of obsolete objects and communicates them to the requesting replica location. Upon receiving the identifiers, the requesting location renders inaccessible those data objects corresponding to the identifiers received. The source location then removes those identifiers that have been communicated to the requesting replica location.
摘要翻译：在其中至少一个节点作为具有对数据库的数据对象的访问的源位置的分布式处理系统网络中，并且至少一个其他节点作为存储来自源位置的数据对象的副本的复制位置操作，管理过时通过使副本位置向源位置提交请求以确定数据对象的过时来执行副本。源位置响应于来自请求的副本位置的请求，提取一组过时对象的标识符并将其传送到请求的副本位置。在接收到标识符之后，请求位置呈现与接收到的标识符相对应的那些数据对象不可访问。然后，源位置移除已传送到请求的副本位置的那些标识符。

2. 发明授权

US4714996A Impact calculation for version management in a distributed information service 失效
标题翻译：分布式信息服务版本管理的影响计算
公开(公告)号：US4714996A
公开(公告)日：1987-12-22
申请号：US801896
申请日：1985-11-26
申请人： Henry M. Gladney , Douglas J. Lorch , Richard L. Mattson
发明人： Henry M. Gladney , Douglas J. Lorch , Richard L. Mattson
IPC分类号： G06F12/00 , G06F15/16 , G06F15/177 , G06F17/30 , H04L29/00 , G06F9/00
CPC分类号： G06F17/30575 , H04L29/00 , G06F2216/09 , Y10S707/99954
摘要： In a distributed processing system having a source node accessing data objects from a database and a replica node storing replicas of requested source data objects received from the source location, the impact to replicas caused by a change in a source data object is calculated by assigning a version number to the change. An identifier of the portion of the source database affected by the change is generated, as well as a list of replicas containing objects from the affected portion of the database. For a replica location communicating with the source location, a table of the replicas from the list is then recorded along with the version number for communicating to the replica location.
摘要翻译：在具有从数据库访问数据对象的源节点和存储从源位置接收到的所请求的源数据对象的副本的副本节点的分布式处理系统中，通过分配源数据对象来对源复制数据对象的变化造成的影响进行计算版本号更改。生成受更改影响的源数据库部分的标识符，以及包含受影响部分数据库中的对象的副本列表。对于与源位置通信的副本位置，然后将来自列表的副本的表与用于与副本位置通信的版本号一起记录。

3. 发明授权

US5416915A Method and system for minimizing seek affinity and enhancing write sensitivity in a DASD array 失效
标题翻译：用于最小化寻找亲和度并增强DASD阵列中写入敏感度的方法和系统
公开(公告)号：US5416915A
公开(公告)日：1995-05-16
申请号：US989245
申请日：1992-12-11
申请人： Richard L. Mattson , Jaishankar M. Menon
发明人： Richard L. Mattson , Jaishankar M. Menon
IPC分类号： G06F3/06 , G06F11/10 , G06F11/20 , G06F11/16 , G06F12/06
CPC分类号： G06F11/1076 , G06F11/1008 , G06F3/0601 , G06F2003/0697
摘要： A method and system for minimizing seek affinity and enhancing write sensitivity in a direct access storage device (DASD) array are disclosed. SEEK affinity and WRITE efficiency are preserved in which logical cylinders, as recorded on the DASD array, are managed as individual log structured files (LSF). Tracks or segments of data and parity blocks having the same or different parity group affinity and stored on the same or different DASD cylindrical addresses are written into a directory managed buffer. Blocks having the same parity affinity and written to counterpart cylinders are written out from the buffer to spare space reserved as part of each DASD cylinder. Otherwise, blocks are updated in place in their DASD array location.
摘要翻译：公开了一种在直接访问存储设备（DASD）阵列中最小化搜寻亲和度并提高写入灵敏度的方法和系统。保留SEEK亲和力和写入效率，其中记录在DASD阵列上的逻辑柱面作为单独的日志结构化文件（LSF）进行管理。具有相同或不同的奇偶校验组相似度并存储在相同或不同DASD圆柱形地址上的数据和奇偶校验块的轨迹或奇偶校验块被写入目录管理缓冲器。具有相同奇偶性相似性并写入对应气瓶的块从缓冲器中写出作为每个DASD气缸一部分保留的备用空间。否则，在其DASD数组位置更新块。

4. 发明授权

US5258984A Method and means for distributed sparing in DASD arrays 失效
标题翻译： DASD阵列中分布式备用的方法和方法
公开(公告)号：US5258984A
公开(公告)日：1993-11-02
申请号：US714969
申请日：1991-06-13
申请人： Jaishankar M. Menon , Richard L. Mattson , Spencer W. Ng
发明人： Jaishankar M. Menon , Richard L. Mattson , Spencer W. Ng
IPC分类号： G06F12/16 , G06F3/06 , G06F11/10 , G06F11/20 , G11C29/00
CPC分类号： G06F11/2094 , G06F11/1076 , G06F11/1662 , G11C29/88 , G06F2211/1028
摘要： A method and means in which data and parity blocks forming parity groups together with spare blocks are distributed over array block locations according to at least one combinatorial design, each group having N data and P parity blocks. The combinatorial designs yield uniform or balanced loading thereby minimizing the number of accesses to reconstruct missing data and parity blocks and their copyback into spare block locations, and, minimize the number of accesses to the reconstructed data referenced subsequent to its copyback. Distributions of the spare block capacity of one or two DASDs are shown over single and multiple arrays and shared among multiple arrays. Parity block distribution although ancillary to spare distribution enhances throughput and reduces the number of accesses for rebuild etc.

5. 发明授权

US5551003A System for managing log structured array (LSA) of DASDS by managing segment space availability and reclaiming regions of segments using garbage collection procedure 失效
标题翻译：通过管理段空间可用性和使用垃圾收集程序回收段的区域来管理DASDS的日志结构化阵列（LSA）的系统
公开(公告)号：US5551003A
公开(公告)日：1996-08-27
申请号：US196047
申请日：1994-02-14
申请人： Richard L. Mattson , Jaishankar M. Menon
发明人： Richard L. Mattson , Jaishankar M. Menon
IPC分类号： G06F3/06 , G06F11/10 , G06F11/20 , G06F13/24
CPC分类号： G06F11/1076 , G06F11/1008 , G06F3/0601 , G06F2003/0697
摘要： Seek affinity is preserved in a segment oriented, cached, log structured array (LSA) of DASDs responsive to accesses dominated by sequential read and random writes of logical tracks stored in the segments. This is achieved by collecting all the write modified read active tracks and clean read active tracks either destaged from the cache or garbage collected from the LSA and rewriting them out to the LSA as segments into regions of contiguous segments of read active tracks. Also, all write modified read inactive tracks and clean read inactive tracks either destaged from cache or garbage collected from the LSA are collected and rewritten out to the LSA as segments into regions of contiguous segments of read inactive tracks. Garbage collection is initiated when the detected free space in a region falls below a threshold and continues until the collected segments exceed a second threshold. Alternatively, write age of logical tracks may be used instead of read activity so as to cluster LSA DASDs into a region of segments formed from old write active logical tracks and a region of current write active logical tracks.
摘要翻译：寻求关联性保留在DASD的面向扇区，缓存的对数结构化阵列（LSA）中，响应于通过存储在段中的逻辑轨道的顺序读取和随机写入而主导的访问。这是通过收集所有写入修改的读活动轨道和清除从缓存收集的高速缓存或垃圾回收的读活动轨迹，并将其作为段重新写入LSA作为读活动轨道的连续段的区域。此外，从LSA收集的高速缓存或垃圾邮件中的所有写入修改的读取非活动轨道和清除读取的非活动轨迹被收集并重写为LSA作为段读取非活动轨道的连续段的区域。当区域中检测到的可用空间下降到阈值以下并持续直到所收集的段超过第二阈值时，起始收集垃圾。或者，可以使用逻辑轨道的写入时间而不是读取活动，以便将LSA DASD聚类到由旧的写入活动逻辑磁道和当前写入活动逻辑磁道的区域形成的段的区域中。

6. 发明授权

US4463424A Method for dynamically allocating LRU/MRU managed memory among concurrent sequential processes 失效
标题翻译：在并发顺序过程中动态分配LRU / MRU托管内存的方法
公开(公告)号：US4463424A
公开(公告)日：1984-07-31
申请号：US544331
申请日：1983-10-21
申请人： Richard L. Mattson , Juan A. Rodriguez-Rosell
发明人： Richard L. Mattson , Juan A. Rodriguez-Rosell
IPC分类号： G06F12/08 , G06F12/12 , G06F13/00
CPC分类号： G06F12/123 , G06F12/0842
摘要： Short traces of consecutive CPU references to storage are accumulated and processed to ascertain hit ratio as a function of cache size. From this determination, an allocation of cache can be made. Because this determination requires minimal processing time, LRU-referenceable memory space among concurrently executing sequential processes is used dynamically by a CPU cache manager.
摘要翻译：累积并处理连续CPU对存储器引用的短暂跟踪，以确定作为高速缓存大小的函数的命中率。从该确定可以进行高速缓存的分配。由于该确定需要最少的处理时间，因此CPU缓存管理器可动态地使用并发执行顺序进程中的LRU可参考的存储器空间。

7. 发明授权

US5542066A Destaging modified data blocks from cache memory 失效
标题翻译：从缓存中破坏修改后的数据块
公开(公告)号：US5542066A
公开(公告)日：1996-07-30
申请号：US172527
申请日：1993-12-23
申请人： Richard L. Mattson , Jaishankar M. Menon
发明人： Richard L. Mattson , Jaishankar M. Menon
IPC分类号： G06F11/10 , G06F11/34 , G06F12/08 , G11C29/00 , G06F12/00
CPC分类号： G06F12/0804 , G06F11/1008 , G06F11/3409 , G06F11/3485 , G06F12/0866 , G11C29/74
摘要： A controller for a disk array with parity and sparing includes a non-volatile cache memory and optimizes the destaging process for blocks from the cache memory to both maximize the cache hit ratio and minimize disk utilization. The invention provides a method for organizing the disk array into segments and dividing the cache memory into groups in order of least recently used memory locations and then determining metrics that permit the disk array controller to identify the cache memory locations having the most dirty blocks by segment and group and to identify the utilization rates of the disks. These characteristics are considered to determine when, what, and how to destage. For example, in terms of maximizing the cache hit ratio, when the percentage of dirty blocks in a particular group of the cache memory locations reaches a predetermined level, destaging is begun. The destaging operation continues until the percentage of dirty blocks decreases to a predetermined level. In terms of minimizing disk utilization, all of the dirty blocks in a segment having the most dirty blocks in a group are destaged.
摘要翻译：用于具有奇偶校验和备用的磁盘阵列的控制器包括非易失性高速缓存存储器，并且优化来自高速缓冲存储器的块的降级处理以最大化高速缓存命中率并最小化磁盘利用率。本发明提供了一种用于将磁盘阵列组织成段并将高速缓存存储器按照最近最少使用的存储器位置的顺序划分成组的方法，然后确定允许磁盘阵列控制器通过片段识别具有最脏块的高速缓冲存储器位置的度量并分组并确定磁盘的使用率。这些特征被认为是决定什么时候，什么以及如何去世的。例如，就最大化高速缓存命中率而言，当高速缓冲存储器位置的特定组中的脏块的百分比达到预定水平时，开始着陆。破坏操作继续，直到脏块的百分比减小到预定水平。在最小化磁盘利用率的情况下，具有组中最脏的块的段中的所有脏块都将被排除。

8. 发明授权

US5434992A Method and means for dynamically partitioning cache into a global and data type subcache hierarchy from a real time reference trace 失效
标题翻译：将缓存从实时参考跟踪中动态地划分为全局数据类型和子数据类型层次结构的方法和方法
公开(公告)号：US5434992A
公开(公告)日：1995-07-18
申请号：US940560
申请日：1992-09-04
申请人： Richard L. Mattson
发明人： Richard L. Mattson
IPC分类号： G06F12/08 , G06F12/12 , G06F12/00 , G06F13/00
CPC分类号： G06F12/0866 , G06F12/0848 , G06F12/123 , G06F12/128 , G06F2212/311 , G06F2212/312
摘要： A method and means is disclosed for dynamically partitioning an LRU cache partitioned into a global cache storing referenced objects of k different data types and k local caches storing objects of a single type. Referenced objects are stored in the MRU position of the global cache and overflow is managed by destaging the LRU object from the global to the local cache having the same data type. Dynamic partitioning is accomplished by recursively creating and maintaining from a trace of objects an LRU list of referenced objects and associated data structures for each subcache, creating and maintaining a multi-planar array of partition distribution data from the lists and the trace as a collection of all possible of maximum and minimum subcache sizing, optimally resizing the subcache partitions by applying a dynamic programming heuristic to the multiplanar array, and readjusting the partitions accordingly.
摘要翻译：公开了一种用于动态地划分划分为存储k个不同数据类型的参考对象的全局高速缓存的LRU高速缓存和存储单个类型的对象的k个本地高速缓存的方法和装置。被引用的对象存储在全局高速缓存的MRU位置中，并且通过将LRU对象从全局变为具有相同数据类型的本地高速缓存来管理溢出。通过递归地创建和维护来自对象的跟踪的动态分区，每个子程序的引用对象的LRU列表和相关联的数据结构，从列表和跟踪中创建和维护分区分布数据的多平面数组，作为集合所有可能的最大和最小次级大小调整，通过对多平面阵列应用动态编程启发式，并相应地重新调整分区，最佳地调整子程序分区的大小。

9. 发明授权

US5271012A Method and means for encoding and rebuilding data contents of up to two unavailable DASDs in an array of DASDs 失效
标题翻译：用于在DASD阵列中编码和重建多达两个不可用DASD的数据内容的方法和手段
公开(公告)号：US5271012A
公开(公告)日：1993-12-14
申请号：US653596
申请日：1991-02-11
申请人： Miguel M. Blaum , Hsieh T. Hao , Richard L. Mattson , Jaishankar M. Menon
发明人： Miguel M. Blaum , Hsieh T. Hao , Richard L. Mattson , Jaishankar M. Menon
IPC分类号： G06F3/06 , G06F11/10 , G06F11/16 , G06F11/20 , G06F12/16 , G11B20/18 , G11C29/00 , H03M13/11
CPC分类号： G11C29/88 , G06F11/1092 , G11B20/1833 , H03M13/11 , G06F11/1012
摘要： A method and means for encoding data written onto an array of M synchronous DASDs and for rebuilding onto spare DASD array capacity when up to two array DASD fail. Data is mapped into the DASD array using an (M-1)*M data array as the storage model where M is a prime number. Pairs of simple parities are recursively encoded over data in respective diagonal major and intersecting row major order array directions. The encoding traverse covering a topologically cylindrical path. Rebuilding data upon unavailability of no more than two DASDs merely requires accessing the data array and repeating the encoding step where the diagonals are oppositely sloped and writing the rebuilt array back to onto M DASDs inclusive of the spare capacity.

10. 发明授权

US5265098A Method and means for managing DASD array accesses when operating in degraded mode 失效
标题翻译：在降级模式下运行时管理DASD阵列访问的方法和装置
公开(公告)号：US5265098A
公开(公告)日：1993-11-23
申请号：US562188
申请日：1990-08-03
申请人： Richard L. Mattson , Spencer Ng
发明人： Richard L. Mattson , Spencer Ng
IPC分类号： G06F3/06 , G06F11/10 , G06F11/20 , G06F12/00 , G11B20/10 , G11B20/18 , G06F11/00
CPC分类号： G06F11/1076 , G06F11/1008 , G11B20/10 , G11B20/1833
摘要： A method and apparatus are disclosed which minimize the additional read and write loading for each remaining DASD in a DASD array occasioned by a single point of failure where subsets of DASDs may accessed asynchronously (RAID 4 or RAID 5). In this method, parity groups are written across the array in a pattern forming a balanced incomplete block design or the equivalent. In the event of failure of a DASD in the array, then any additional loading resulting from the failure is uniformly spread among the remaining DASDs.

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式