会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • 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使用这些数字输出创建一个随机数字种子。
    • 3. 发明授权
    • Oscillator array with row and column control
    • 具有行和列控制的振荡器阵列
    • US07233212B2
    • 2007-06-19
    • US11095895
    • 2005-03-31
    • David William BoerstlerEskinder HailuHarm Peter HofsteeJohn Samuel Liberty
    • David William BoerstlerEskinder HailuHarm Peter HofsteeJohn Samuel Liberty
    • H03B29/00H03K3/03
    • G06F7/588H03K3/0315H03K3/84
    • A circuit topology which can be used to create an array of individually tuned oscillators operating at different frequencies determined by common control inputs and an easily managed variation in design dimensions of several components is provided. An array of oscillators are provided arranged in columns and rows. Each oscillator in a column is unique from the other oscillators in the column based on number of stages in the oscillator and fanout so that each oscillator will operate at a unique frequency. Oscillators of different columns within the array may differ by a common setting of the selects to these oscillators and the physical ordering of the oscillators in the column to further reduce the possibility of injection locking. A base delay cell provides selects to each column of oscillators such that each column may be programmed to operate at a different frequency from its neighbors.
    • 提供了一种电路拓扑结构,可用于创建由通用控制输入确定的不同频率运行的单独调谐的振荡器阵列,以及易于管理的多个组件的设计尺寸变化。 提供了一列列和列排列的振荡器阵列。 列中的每个振荡器都基于列中的其他振荡器是独特的,基于振荡器和扇出的级数,使得每个振荡器将以唯一的频率工作。 阵列中不同列的振荡器可能会通过对这些振荡器的选择的共同设置以及列中的振荡器的物理顺序而不同,以进一步降低注入锁定的可能性。 基本延迟单元为每列振荡器提供选择,使得每列可被编程为以与其邻居不同的频率工作。
    • 4. 发明授权
    • Symmetric multiprocessor coherence mechanism
    • 对称多处理器一致性机制
    • US06760819B2
    • 2004-07-06
    • US09895888
    • 2001-06-29
    • Sang Hoo DhongHarm Peter HofsteeCharles Ray JohnsJohn Samuel LibertyThuong Quang Truong
    • Sang Hoo DhongHarm Peter HofsteeCharles Ray JohnsJohn Samuel LibertyThuong Quang Truong
    • G06F1208
    • G06F12/0822G06F12/0811G06F12/084
    • A processor-cache operational scheme and topology within a multi-processor data processing system having a shared lower level cache (or memory) by which the number of coherency busses is reduced and more efficient snoop resolution and coherency operations with the processor caches are provided. A copy of the internal (L1) cache directory is provided within the lower level (L2) cache or memory. The snoop operations and coherency maintenance operations of the L1 directory are completed by comparing the snoop addresses with the address tags of the copy of the L1 directory in the L2 cache. Updates to the coherency states of the copy of the L1 directory are mirrored in the L1 directory and L1 cache. This eliminates the need for the individual coherency buses of each processor that is coupled to the L2 cache and speeds up coherency operations because the snoops do not have to be transmitted to the L1 caches.
    • 提供具有共享低级高速缓存(或存储器)的多处理器数据处理系统中的处理器 - 高速缓存操作方案和拓扑,通过该共享低级高速缓存(或存储器)减少一致性总线的数量并且提供与处理器高速缓存更有效的窥探分辨率和一致性操作。 在低级(L2)高速缓存或内存中提供内部(L1)缓存目录的副本。 通过将侦听地址与L2缓存中L1目录的副本的地址标签进行比较,完成L1目录的侦听操作和一致性维护操作。 对L1目录的副本的一致性状态的更新被镜像在L1目录和L1缓存中。 这消除了对耦合到L2高速缓存的每个处理器的各个一致性总线的需要,并且加速一致性操作,因为该探测不必被传送到L1高速缓存。
    • 7. 发明授权
    • Lowered PU power usage method and apparatus
    • 降低PU功率使用方法和装置
    • US07197655B2
    • 2007-03-27
    • US10606581
    • 2003-06-26
    • Brian King FlachsJohn Samuel LibertyHarm Peter Hofstee
    • Brian King FlachsJohn Samuel LibertyHarm Peter Hofstee
    • G06F1/00
    • G06F1/3209
    • Disclosed is an apparatus which places computer program instructions into instruction channels in accordance with predefined criteria such that at least some external event instructions are placed in a special “blocking channel.” The number of instructions, in a channel, is monitored in channel specific counters. When a computer processor is awaiting a response from an external entity event (in other words, is blocked from proceeding with the operation the PU is attempting), as signified by the blocking counter being at a predetermined value, the entire PU or at least processor auxiliary components that would be idle, such as math logic, while awaiting an external event response, are deactivated to save power until an awaited external event response is received.
    • 公开了一种根据预定准则将计算机程序指令置于指令通道中的装置,使得至少一些外部事件指令被放置在特殊的“阻塞通道”中。 在通道特定计数器中监视通道中的指令数。 当计算机处理器正在等待来自外部实体事件的响应(换句话说,阻止PU正在尝试的操作),如由阻塞计数器所指示的,处于预定值,整个PU或至少处理器 在等待外部事件响应的情况下,诸如数学逻辑的辅助组件被停用以节省电力,直到接收到等待的外部事件响应。
    • 8. 发明授权
    • Ring-topology based multiprocessor data access bus
    • 基于环形拓扑的多处理器数据访问总线
    • US07043579B2
    • 2006-05-09
    • US10313741
    • 2002-12-05
    • Sang Hoo DhongHarm Peter HofsteeJohn Samuel LibertyPeichun Peter Liu
    • Sang Hoo DhongHarm Peter HofsteeJohn Samuel LibertyPeichun Peter Liu
    • G06F13/00
    • G06F13/4243
    • The present invention provides a data access ring. The data access ring has a plurality of attached processor units (APUs) and a local store associated with each APU. The data access ring has a data command ring, coupled to the plurality of APUs. The data command ring is employable to carry indicia of a selection of one of the plurality of APUs to the APUs. The data access ring also has a data address ring, coupled to the plurality of APUs. The data address ring is further employable to carry indicia of a memory location to the selected APU a predetermined number of clock cycles after the data command ring carries the indicia of the selection of one of the plurality of APUs. The data access ring also has a data transfer ring, coupled to the plurality of APUs. The data transfer ring is employable to transfer data to or from the memory location associated with the APU a predetermined number of clock cycles after the data address ring carries the indicia of the memory location to the selected APU.
    • 本发明提供一种数据访问环。 数据访问环具有多个附接的处理器单元(APU)和与每个APU相关联的本地存储器。 数据访问环具有耦合到多个APU的数据命令环。 数据命令环可用于将多个APU中的一个APU的选择的标记携带到APU。 数据访问环还具有耦合到多个APU的数据地址环。 数据地址环还可用于在数据命令环携带多个APU中的一个APU的选择的标记之后,将所选择的APU的存储位置的标记携带预定数量的时钟周期。 数据访问环还具有耦合到多个APU的数据传送环。 在数据地址环将存储器位置的标记传送到所选择的APU之后,数据传送环可用于将数据传送到与APU相关联的存储器位置的数据到预定数量的时钟周期。
    • 10. 发明授权
    • Block rendering method for a graphics subsystem
    • 图形子系统的块渲染方法
    • US06421053B1
    • 2002-07-16
    • US09316097
    • 1999-05-24
    • Charles Ray JohnsJohn Samuel LibertyBrad William MichaelJohn Fred Spannaus
    • Charles Ray JohnsJohn Samuel LibertyBrad William MichaelJohn Fred Spannaus
    • G06T1120
    • G06T15/80
    • Primitives are divided into span groups of 2N spans, and then processed in M×N blocks of pixels, with the pixel blocks preferably being as close to square as possible and therefore optimized for small spans and texture mapping. Each span group is rendered block-by-block in a serpentine manner from an initial or entry block, first in a direction away from the long edge of the primitive and then in a direction towards the long edge. The interpolators include a one-deep stack onto which pixel and texel information for the initial or entry block are pushed before rendering any other blocks within the span group. Blocks or pairs of blocks within different span subgroups of the span group are then alternately rendered, such that rendering zig-zags between the span subgroups as it proceeds to the end of the span group. Once the first end of a span group is reached, the values for the initial or entry block are popped from the stack and rendering resumes from the initial or entry block in the opposite direction, but in the same serpentine or zig-zag manner, until the other end of the span group is reached. The next span group, if any, is rendered starting with a block adjacent to the last block rendered in the previous span group. Memory bandwidth utilization between the pixel and texel cache and the frame buffer is thus improved, together with texel reuse during texture mapping, to reduce the total number of pixel and texel fetches required to render the primitive.
    • 原子被分成2N个跨度的跨度组,然后在M×N个像素块中进行处理,其中像素块优选尽可能接近正方形,因此针对小跨度和纹理映射进行优化。 每个跨度组以蛇形方式从初始或进入块逐块渲染,首先在远离原始长边的方向上,然后朝向长边的方向。 插值器包括一个深层堆叠,在渲染跨度组内的任何其他块之前,将初始或进入块的像素和纹素信息推送到其上。 然后交替地渲染跨度组的不同跨度子组内的块或块对,使得当它进行到跨度组的末尾时,在跨越子组之间渲染之字形。 一旦达到跨度组的第一个结束,初始或进入块的值从堆栈中弹出,并且渲染从初始或进入块以相反方向恢复,但是以相同的蛇形或锯齿形方式恢复,直到 到达跨度组的另一端。 下一个范围组(如果有的话)从与前一个范围组中呈现的最后一个块相邻的块开始绘制。 因此,像素和纹素高速缓存和帧缓冲器之间的存储器带宽利用率在纹理映射期间与纹素复用一起得到改善,以减少呈现原始图像所需的像素和纹素提取的总数。