会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Fast lane prefetching
    • 快速车道预取
    • US06681295B1
    • 2004-01-20
    • US09652451
    • 2000-08-31
    • Stephen C. RootRichard E. KesslerDavid H. AsherBrian Lilly
    • Stephen C. RootRichard E. KesslerDavid H. AsherBrian Lilly
    • G06F1200
    • G06F9/30047G06F9/383G06F9/3832G06F9/3836G06F9/384G06F9/3855G06F9/3857G06F9/3859G06F12/0862G06F12/0864G06F2212/6028
    • A computer system has a set-associative, multi-way cache system, in which at least one way is designated as a fast lane, and remaining way(s) are designated slow lanes. Any data that needs to be loaded into cache, but is not likely to be needed again in the future, preferably is loaded into the fast lane. Data loaded into the fast lane is earmarked for immediate replacement. Data loaded into the slow lanes preferably is data that may not needed again in the near future. Slow data is kept in cache to permit it to be reused if necessary. The high-performance mechanism of data access in a modem microprocessor is with a prefetch; data is moved, with a special prefetch instruction, into cache prior to its intended use. The prefetch instruction requires less machine resources, than carrying out the same intent with an ordinary load instruction. So, the slow-lane, fast-lane decision is accomplished by having a multiplicity of prefetch instructions. By loading “not likely to be needed again” data into the fast lane, and designating such data for immediate replacement, data in other cache blocks, in the other ways, may not be evicted, and overall system performance is increased.
    • 计算机系统具有集合关联的多路缓存系统,其中至少一种方式被指定为快速通道,并且剩余方式被指定为慢车道。 任何需要加载到缓存中但不太可能再次需要的数据最好被加载到快速通道中。 加载到快速通道的数据被指定用于立即更换。 加载到慢车道中的数据优选地是在不久的将来可能不再需要的数据。 慢数据保存在缓存中,以便在必要时重新使用它。 调制解调器微处理器中数据访问的高性能机制具有预取功能; 在预期使用之前,将数据用特殊的预取指令移动到缓存中。 预取指令比普通加载指令执行相同的意图要求较少的机器资源。 因此,通过具有多个预取指令来实现慢通道,快速通道决定。 通过将“不太可能需要再次”的数据加载到快速通道中,并且指定这样的数据以立即替换,以其他方式在其他高速缓存块中的数据可能不被驱逐,并且整体系统性能增加。
    • 3. 发明授权
    • High speed parallel multiplier circuit
    • 高速并行乘法电路
    • US5146421A
    • 1992-09-08
    • US373083
    • 1989-06-28
    • Matthew J. AdilettaStephen C. Root
    • Matthew J. AdilettaStephen C. Root
    • G06F7/53G06F7/508G06F7/52
    • G06F7/5318
    • The binary multiplier circuit for obtaining a product of an M-bit multiplier and an N-bit multiplicand includes a multiplier circuit which produces a matrix of original summand bits having M rows and M+N columns and a matrix reduction circuit. In the matrix reduction circuit, for every column of the matrix having three or more original summand bits, groups of three bits are input into full adder circuits which output a sum bit for that column and a carry bit for the column in the next most significant bit position. For every column having three or fewer original summand bits, and having the least significant column position that is not yet reduced to two or fewer bits, groups of two bits are input into a half adder circuit which outputs a sum bit for that column and carry bit for a column in the next most significant bit position. Iterative reductions are performed for each column by using full adder circuits for every group of three bits in a column and by using a half adder circuit for any remaining group of two bits in a column. The reduction continues until each column of the matrix is reduced to two or fewer bits. The remaining two rows of bits can be input to a two-stage carry-propagating adder circuit to output a sum equal to the product.
    • 用于获得M位乘法器和N位被乘数乘积的二进制乘法器电路包括产生具有M行和M + N列的原始加法器位矩阵和矩阵减法电路的乘法器电路。 在矩阵简化电路中,对于具有三个或更多个原始加法器位的矩阵的每一列,三个位组被输入到全加法器电路中,该加法器电路输出该列的和位和该列的进位位在下一个最高有效位 位位置。 对于具有三个或更少的原始加和位的列,并且具有尚未减少到两个或更少位的最低有效列位置,两位组被输入到半加法器电路中,该半加法器电路输出该列的和位并携带 位在下一个最高有效位位置的列。 对于每列,通过对列中的每一组三位使用全加器电路,并通过使用半加法器电路对列中的两位的任何剩余组执行迭代减少。 减少继续,直到矩阵的每一列减少到两个或更少位。 剩余的两行位可以输入到两级进位传播加法器电路,以输出等于乘积的和。
    • 4. 发明授权
    • System and method of measuring low impedances
    • 测量低阻抗的系统和方法
    • US06911827B2
    • 2005-06-28
    • US10274611
    • 2002-10-21
    • Isaac KantorovichChristopher L. HoughtonStephen C. RootJames J. St. Laurent
    • Isaac KantorovichChristopher L. HoughtonStephen C. RootJames J. St. Laurent
    • G01R27/02G01R27/08G01R27/20G01R31/30G06F11/24G01R27/28G01R23/16
    • G06F11/24G01R27/205G01R31/3004G01R31/3008
    • A method comprises generating first and second current levels and measuring the first and second current levels. The method further comprises alternately generating the first and second current levels repeatedly to generate a periodic current waveform, and measuring the voltage at at least one port in a system a plurality of times to obtain a plurality of sets of voltage measurements. The plurality of sets of voltage measurements are averaged. The method further comprises alternately generating the first and second current levels repeatedly at a predetermined number of different clock frequencies, determining a Fourier component of the averaged voltage measurements to determine clock frequency-dependent noises, removing the clock frequency-dependent noises to generate a filtered average voltage, and determining an impedance by dividing a Fourier component of the filtered average voltage by a Fourier component of the periodic current waveform having alternating first and second current levels.
    • 一种方法包括产生第一和第二电流电平并测量第一和第二电流电平。 该方法还包括重复地交替地产生第一和第二电流电平以产生周期性电流波形,并且多次测量系统中至少一个端口处的电压以获得多组电压测量值。 对多组电压测量进行平均。 该方法还包括以预定数量的不同时钟频率重复地交替产生第一和第二电流电平,确定平均电压测量的傅立叶分量以确定时钟频率相关噪声,去除时钟频率相关噪声以产生滤波 平均电压,并且通过将滤波的平均电压的傅立叶分量除以具有交替的第一和第二电流水平的周期性电流波形的傅立叶分量来确定阻抗。
    • 6. 发明授权
    • High speed parallel multiplier circuit
    • 高速并联电路
    • US5159568A
    • 1992-10-27
    • US124926
    • 1987-11-24
    • Matthew J. AdilettaStephen C. Root
    • Matthew J. AdilettaStephen C. Root
    • G06F7/53G06F7/506G06F7/508G06F7/52
    • G06F7/5318
    • The binary multiplier circuit for obtaining a product of a M-bit multiplier and a N-bit multiplicand includes a multiplier circuit which produces a matrix of original summand bits having M rows and M+N columns and a matrix reduction circuit. In the matrix reduction circuit, for every column of the matrix having three or more original summand bits, groups of three bits are input into full adder circuits which output a sum bit for that column and a carry bit for the column in the next most significant bit position. For every column having three or fewer original summand bits, and having the least significant column position that is not yet reduced to two or fewer bits, groups of two bits are input into a half adder circuit which outputs a sum bit for that column and carry bit for a column in the next most significant bit position. Iterative reductions are performed for each column by using full adder circuits for every group of three bits in a column and by using a half adder circuit for any remaining group of two bits in a column. The reduction continues until each column of the matrix is reduced to two or fewer bits. The remaining two rows of bits can be input to a carry-propagating adder circuit to output a sum equal to the product.
    • 7. 发明授权
    • Method for providing a pipeline interpreter for a variable length
instruction set
    • 提供可变长度指令集的流水线解释器的方法
    • US5802373A
    • 1998-09-01
    • US592982
    • 1996-01-29
    • John S. YatesStephen C. Root
    • John S. YatesStephen C. Root
    • G06F9/455G06F9/45
    • G06F9/45504
    • A computer system for executing a binary image conversion system which converts instructions from a instruction set of a first, non native computer system to a second, different, native computer system, includes an run-time system which in response to a non-native image of an application program written for a non-native instruction set provides an native instruction or a native instruction routine. The run-time system collects profile data in response to execution of the native instructions to determine execution characteristics of the non-native instruction. Thereafter, the non-native instructions and the profile statistics are fed to a binary translator operating in a background mode and which is responsive to the profile data generated by the run-time system to form a translated native image. The run-time system and the binary translator are under the control of a server process. The non-native image is executed in two different enviroments with first portion executed as an interpreted image and remaining portions as a translated image. The run-time system includes an interpreter which is capable of handling condition codes corresponding to the non-native architecute. A technique is also provided to jacket calls between the two execution enviroments and to support object based services. Preferred techniques are also provide to determine interprocedural translation units. Further, intermixed translation/optimization techniques are discussed.
    • 一种用于执行二进制图像转换系统的计算机系统,其将来自第一非本机计算机系统的指令集的指令转换为第二,不同的本地计算机系统,包括运行时系统,其响应于非本地图像 为非本地指令集编写的应用程序提供本机指令或本地指令例程。 运行时系统响应于本地指令的执行而收集简档数据,以确定非本地指令的执行特性。 此后,非本地指令和简档统计信息被馈送到在后台模式下操作的二进制翻译器,并且响应于由运行时系统生成的简档数据以形成翻译的本机图像。 运行时系统和二进制翻译器都在服务器进程的控制之下。 非原始图像在两个不同的环境中执行,第一部分被执行作为解释图像,剩余部分作为翻译图像。 运行时系统包括能够处理与非本机结构对应的条件代码的解释器。 还提供了一种技术,用于在两个执行环境之间夹紧呼叫并支持基于对象的服务。 还提供优选的技术来确定过程间平移单位。 此外,讨论了混合翻译/优化技术。