会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明授权
    • Random number generator
    • 随机数发生器
    • US07890561B2
    • 2011-02-15
    • US11204402
    • 2005-08-16
    • David William BoerstlerEskinder HailuHarm Peter HofsteeJohn Samuel Liberty
    • David William BoerstlerEskinder HailuHarm Peter HofsteeJohn Samuel Liberty
    • G06F1/02G06F7/58
    • G06F7/588H04L9/001H04L9/0869
    • A random number generator, a method, and a computer program product are provided for producing a random number seed. Each oscillator within an array of oscillators operates at a different frequency. The operating frequencies of each oscillator are not harmonically related, such that no integer multiple exists between the frequencies of any two oscillators. In one embodiment, the outputs of the array of oscillators connect to a multiple input latch. The multiple input latch also receives a sample signal, which is a clock signal. The clock signal samples the outputs of the array of oscillators, and the multiple input latch in conjunction with the random number determination logic (“RNDL”) produces a digital output (0 or 1) for each oscillator within the array. The RNDL uses these digital outputs to create a random number seed.
    • 提供随机数生成器,方法和计算机程序产品用于产生随机数种子。 振荡器阵列内的每个振荡器以不同的频率工作。 每个振荡器的工作频率不是谐波相关的,使得在任何两个振荡器的频率之间不存在整数倍。 在一个实施例中,振荡器阵列的输出连接到多输入锁存器。 多输入锁存器还接收作为时钟信号的采样信号。 时钟信号对振荡器阵列的输出采样,并且多输入锁存器与随机数确定逻辑(“RNDL”)一起为阵列内的每个振荡器产生数字输出(0或1)。 RNDL使用这些数字输出创建一个随机数字种子。
    • 5. 发明授权
    • Hiding memory latency
    • 隐藏内存延迟
    • US07620951B2
    • 2009-11-17
    • US12049293
    • 2008-03-15
    • Daniel Alan BrokenshireHarm Peter HofsteeBarry L MinorMark Richard Nutter
    • Daniel Alan BrokenshireHarm Peter HofsteeBarry L MinorMark Richard Nutter
    • G06F9/46
    • G06F9/322G06F8/41G06F9/3851
    • An approach to hiding memory latency in a multi-thread environment is presented. Branch Indirect and Set Link (BISL) and/or Branch Indirect and Set Link if External Data (BISLED) instructions are placed in thread code during compilation at instances that correspond to a prolonged instruction. A prolonged instruction is an instruction that instigates latency in a computer system, such as a DMA instruction. When a first thread encounters a BISL or a BISLED instruction, the first thread passes control to a second thread while the first thread's prolonged instruction executes. In turn, the computer system masks the latency of the first thread's prolonged instruction. The system can be optimized based on the memory latency by creating more threads and further dividing a register pool amongst the threads to further hide memory latency in operations that are highly memory bound.
    • 介绍了一种在多线程环境中隐藏内存延迟的方法。 分支间接和设置链接(BISL)和/或分支间接和设置链接,如果外部数据(BISLED)指令在对应于延长的指令的实例的编译期间被放置在线程代码中。 延长的指令是指示计算机系统中的延迟,例如DMA指令。 当第一个线程遇到BISL或BISLED指令时,第一个线程在第一个线程的延长指令执行时将控制传递给第二个线程。 反过来,计算机系统掩盖了第一个线程延长的指令的延迟。 可以通过创建更多线程并在线程之间进一步划分寄存器池来进一步隐藏高度内存限制的操作中的内存延迟,从而可以基于内存延迟来优化系统。
    • 8. 发明授权
    • Performance and memory bandwidth utilization for tree searches using tree fragmentation
    • 使用树分片的树搜索的性能和内存带宽利用率
    • US07146371B2
    • 2006-12-05
    • US10313683
    • 2002-12-05
    • Peter HofsteeMarc C. Necker
    • Peter HofsteeMarc C. Necker
    • G06F17/00G06F7/00
    • G06F17/30327G06F17/3033Y10S707/99942Y10S707/99943
    • A data structure and corresponding search methods are disclosed for improving the performance of table lookups. A data structure for the table is employed using a single hash table with hash table entries pointing to tree fragments that are contiguous in main memory and can be efficiently loaded into a local data store or cache. Decision nodes are stored in a contiguous block of memory in a relative position based on the position of the decision node in the tree structure, including blank positions. Leaf nodes are stored in a contiguous block of memory based on the position of the leaf node in the tree structure, concatenating leaf nodes to eliminate blank positions. Leaf nodes of the tree fragments contain indicia of a data record, or indicia of another tree fragment. The data structure and corresponding search algorithm are employed for searches based on a longest prefix match in an internet routing table.
    • 公开了一种用于提高表查找性能的数据结构和相应的搜索方法。 使用具有指向主存储器中连续的树片段的散列表条目的单个哈希表使用该表的数据结构,并且可以有效地将其加载到本地数据存储或高速缓存中。 决策节点基于树结构中的决策节点的位置(包括空白位置)存储在相对位置的连续的存储块中。 叶节点基于树结构中叶节点的位置存储在连续的存储块中,连接叶节点以消除空白位置。 树片的叶节点包含数据记录的标记或另一个树片的标记。 基于互联网路由表中最长前缀匹配的搜索,采用数据结构和相应的搜索算法。