会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Method, system, and computer program product for implementing a dual-addressable cache
    • 用于实现双重寻址缓存的方法,系统和计算机程序产品
    • US07930514B2
    • 2011-04-19
    • US11054298
    • 2005-02-09
    • Norbert HagspielErwin PfefferBruce A. Wagar
    • Norbert HagspielErwin PfefferBruce A. Wagar
    • G06F12/00
    • G06F12/0864
    • A method, system, and computer program product for implementing a dual-addressable cache is provided. The method includes adding fields for indirect indices to each congruence class provided in a cache directory. The cache directory is indexed by primary addresses. In response to a request for a primary address based upon a known secondary address corresponding to the primary address, the method also includes generating an index for the secondary address, and inserting or updating one of the indirect indices into one of the fields for a congruence class relating to the secondary address. The indirect index is assigned a value of a virtual index corresponding to the primary address. The method further includes searching congruence classes of each of the indirect indices for the secondary address.
    • 提供了一种用于实现双重寻址缓存的方法,系统和计算机程序产品。 该方法包括为缓存目录中提供的每个同余类添加间接索引的字段。 缓存目录由主地址索引。 响应于基于对应于主地址的已知辅助地址的主地址的请求,该方法还包括生成辅助地址的索引,以及将间接索引中的一个插入或更新到一个字段中以用于一致 与次要地址相关的课程。 为间接索引分配与主地址相对应的虚拟索引的值。 该方法还包括搜索辅助地址的每个间接索引的同余类。
    • 2. 发明授权
    • System for MSD radix sort bin storage management
    • 用于MSD基数分拣存储管理的系统
    • US5440734A
    • 1995-08-08
    • US121812
    • 1993-09-14
    • Bruce A. Wagar
    • Bruce A. Wagar
    • G06F7/24G06F7/06G06F7/22
    • G06F7/24Y10S707/99937
    • A system and process for enhancing internal radix sorting bin storage efficiency by using linked blocks of contiguous storage space while controlling the number of partially-filled blocks required. The improved internal radix sorting procedure makes it possible to sort large computer files very efficiently without the risk of overflowing allocated storage space. A Most Significant Byte (MSD) radix sorting procedure avoids the collection step required in the LSD radix sorting procedure. The distribution pass is halted whenever a bin is found to contain less than a predetermined threshold number of records and the bin is then sorted immediately using a simple comparison-based sort. At each distribution rank, the system selects and sorts the smallest bins first, thereby quickly releasing storage blocks that may be required during the distribution sort passes for the larger bins. In this radix sorting procedure, the total number of linked storage blocks of size B can never exceed (R/B)+(1-1/B)A, where R is the total number of records to be sorted and A=(M-1) log.sub.M (R/T)+min (T,M)+1, where M=key field digit radix and T=bin size threshold for switching to comparison-based sort completion.
    • 一种用于通过使用连续的存储空间的链接块来控制所需的部分填充块的数量来增强内部基数分类箱存储效率的系统和过程。 改进的内部分类排序过程使得可以非常有效地排序大型计算机文件,而不会溢出分配的存储空间的风险。 最高有效字节(MSD)基数排序过程避免了LSD基数排序过程中所需的收集步骤。 每当发现一个垃圾箱含有小于一个预定的阈值数量的记录时,分配通过就被停止,然后使用简单的基于比较的排序立即对仓进行排序。 在每个分配等级中,系统首先选择和排序最小的分区,从而快速释放在分配排序过程中为较大的分区可能需要的存储块。 在这个基数排序过程中,大小为B的链接存储块的总数永远不会超过(R / B)+(1-1 / B)A,其中R是要排序的记录的总数,A =(M -1)logM(R / T)+ min(T,M)+1,其中M =密钥字段数字基数,T =用于切换到基于比较的排序完成的bin大小阈值。
    • 6. 发明授权
    • Method and apparatus for implementing a combined data/coherency cache
    • 用于实现组合数据/一致性高速缓存的方法和装置
    • US08131936B2
    • 2012-03-06
    • US11056809
    • 2005-02-11
    • Keith N. LangstonPak-kin MakBruce A. Wagar
    • Keith N. LangstonPak-kin MakBruce A. Wagar
    • G06F12/00
    • G06F12/0811G06F12/082G06F12/084G06F12/0864
    • A method and apparatus for implementing a combined data/coherency cache for a shared memory multi-processor. The combined data/coherency cache includes a system cache with a number of entries. The method includes building a system cache directory with a number of entries equal to the number of entries of the system cache. The building includes designating a number of sub-entries for each entry which is determined by a number of sub-entries operable for performing system cache coherency functions. The building also includes providing a sub-entry logic designator for each entry, and mapping one of the sub-entries for each entry to the system cache via the sub-entry logic designator.
    • 一种用于实现用于共享存储器多处理器的组合数据/一致性高速缓存的方法和装置。 组合的数据/一致性缓存包括具有多个条目的系统高速缓存。 该方法包括构建具有等于系统高速缓存的条目数的条目数目的系统缓存目录。 该建筑物包括指定由可操作用于执行系统高速缓存一致性功能的多个子条目确定的每个条目的多个子条目。 该建筑还包括为每个条目提供子条目逻辑指示符,并通过子条目逻辑指示符将每个条目的子条目之一映射到系统高速缓存。
    • 7. 发明授权
    • Distribution-based replacement selection sorting system
    • 基于分销的替代选择分拣系统
    • US5487164A
    • 1996-01-23
    • US121328
    • 1993-09-14
    • Richard KirchhoferBruce A. Wagar
    • Richard KirchhoferBruce A. Wagar
    • G06F7/24G06F7/36
    • G06F7/24G06F2207/224Y10S707/99937
    • An external data record sorting system that adaptively combines elements of both the distribution-based and the comparison-based sort procedures. The internal distribution-based sorting procedure generates sorted record strings that are twice as long on average as the available internal memory storage space. This MSB radix distribution procedure is adaptively optimized to data file characteristics by a predetermined threshold test that halts the distribution pass for a bin containing fewer records than a predetermined threshold number, which are then immediately sorted using a simpler comparison-based sorting procedure. This system also overlaps the input file reads and secondary storage writes between distribution sequences, thereby minimizing the non-overlapping portions of input/output operations and internal processing operations. As sorted records are written to secondary storage and new records are moved from the input file, the new records may be added to the current distributive sort tree, thereby minimizing the total number of strings created. Because new records are moved in from the input file concurrently with the removal of sorted records to the output area, the average output string can be twice the size of internal storage. By minimizing the number of strings that are later merged to complete the sort, overall external sorting procedure time is minimized.
    • 外部数据记录分类系统,其自适应地组合基于分布和基于比较的分类过程的元素。 内部基于分发的排序过程生成平均为可用内部存储器存储空间的两倍长的排序记录字符串。 这个MSB基数分布过程通过预定的阈值测试自适应地优化数据文件特性,该预定阈值测试使包含比预定阈值数目更少的记录的分组的分配通过停止,然后使用更简单的基于比较的分类过程立即排序。 该系统还与分配序列之间的输入文件读取和次要存储写入重叠,从而最小化输入/输出操作和内部处理操作的非重叠部分。 当排序的记录被写入辅助存储器并且新的记录从输入文件移动时,新的记录可以被添加到当前的分发排序树中,从而最小化所创建的字符串的总数。 由于新记录从输入文件中同时移入排序的记录到输出区域,所以平均输出字符串可以是内部存储大小的两倍。 通过最小化稍后合并以完成排序的字符串的数量,整体外部排序过程时间最小化。