会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 7. 发明授权
    • Background completion of instruction and associated fetch request in a
multithread processor
    • 在多线程处理器中完成指令和相关的提取请求
    • US6088788A
    • 2000-07-11
    • US773572
    • 1996-12-27
    • John M. BorkenhagenRichard J. EickemeyerSheldon B. LevensteinAndrew H. WottrengDuane A. AverillJames I. Brookhouser
    • John M. BorkenhagenRichard J. EickemeyerSheldon B. LevensteinAndrew H. WottrengDuane A. AverillJames I. Brookhouser
    • G06F9/38G06F9/40G06F15/76
    • G06F9/3851G06F9/3824
    • The data processing system includes a plurality of execution units forming a plurality of processing pipelines. The plurality of processing pipelines process instructions and include a storage pipeline. The data processing system further includes an instruction unit and a storage control unit. The instruction unit outputs instructions to the plurality of execution units, and controls execution of multiple threads by the plurality of execution units. If an instruction for a first thread in the storage pipeline experiences a cache miss and the instruction unit decides to switch threads, the instruction unit begins processing a second thread. The instruction unit also issues a data request to the storage control unit to obtain the missing data. During processing of the second thread, unused slots will appear in the storage pipeline because it is not possible to always dispatch instructions to completely keep the pipelines filled. After the requested data returns from higher level memory, the storage control unit will dispatch the instruction from the first thread having received the cache miss to an unused slot in the storage pipeline. Consequently, this instruction from the first thread will be processed along with the instructions from the second thread.
    • 数据处理系统包括形成多个处理流水线的多个执行单元。 多个处理管线处理指令并且包括存储管线。 数据处理系统还包括指令单元和存储控制单元。 指令单元向多个执行单元输出指令,并且控制多个执行单元执行多个线程。 如果存储管线中的第一线程的指令经历高速缓存未命中并且指令单元决定切换线程,则指令单元开始处理第二线程。 指令单元还向存储控制单元发出数据请求以获得丢失的数据。 在处理第二个线程期间,未使用的插槽将出现在存储管道中,因为不可能总是调度指令以完全保持管道的填充。 在所请求的数据从较高级存储器返回之后,存储控制单元将从接收到高速缓存未命中的第一线程的指令发送到存储流水线中的未使用的时隙。 因此,来自第一个线程的指令将与第二个线程的指令一起处理。
    • 8. 发明授权
    • Method of indicating parallel execution compoundability of scalar
instructions based on analysis of presumed instructions
    • 基于假设指令分析指示标量指令的并行执行复合性的方法
    • US5500942A
    • 1996-03-19
    • US457765
    • 1995-06-01
    • Richard J. EickemeyerStamatis Vassiliadis
    • Richard J. EickemeyerStamatis Vassiliadis
    • G06F9/30G06F9/38
    • G06F9/3808G06F9/30149G06F9/30152G06F9/3816G06F9/3842G06F9/3853
    • This is a method of compounding two or more instructions from an instruction stream without knowing the starting point or length of each individual instruction. All instructions include one OP Code at a predetermined field location which identifies the instruction and its length. Those instructions which qualify need to have appropriate tags to indicate they are candidates for compounding. In System 370 where instructions are either 2, 4 or 6 bytes in length, the field positions for the OP Code are presumed based on an estimated instruction length code. The value of each tag based on a presumed OP Code is recorded, and the instruction length code in the presumed OP Code is used to locate a complete sequence of possible instructions. Once an actual instruction boundary is found, the corresponding correct tag values are used to identify the commencement of a compound instruction, and other incorrectly generated tags are ignored.
    • 这是一种从指令流中复合两个或多个指令而不知道每个单独指令的起始点或长度的方法。 所有指令在预定字段位置包括一个OP代码,用于标识指令及其长度。 那些符合条件的指令需要有适当的标签来表明它们是复合的候选者。 在系统370中,其中指令长度为2,4或6字节,则基于估计的指令长度代码来推定OP代码的字段位置。 记录基于假设的OP代码的每个标签的值,并且使用推定的OP代码中的指令长度代码来定位可能的指令的完整序列。 一旦发现了实际的指令边界,则使用相应的正确标签值来识别复合指令的开始,并忽略其他错误生成的标签。
    • 9. 发明授权
    • Address prediction to avoid address generation interlocks in computer
systems
    • 地址预测,以避免计算机系统中的地址生成互锁
    • US5442767A
    • 1995-08-15
    • US965466
    • 1992-10-23
    • Richard J. EickemeyerStamatis Vassiliadis
    • Richard J. EickemeyerStamatis Vassiliadis
    • G06F9/32G06F9/345G06F9/38G06F12/00
    • G06F9/325G06F9/345G06F9/383G06F9/3832
    • A computer system predicts an address required to execute a current iteration of a program instruction based on addresses required to execute previous iterations of the same program instruction. The system stores an address required to execute the previous iteration of the program instruction, and determines differences between addresses required to execute successive iterations of the program instruction prior to the current iteration. The system also determines and stores a current value of a delta, and predicts the address required to execute the current iteration of the program instruction based on the address required to execute the previous iteration of the program instruction plus the current value of the delta. The system sets the delta at one time equal to a difference between two addresses required to execute two successive iterations of the program instruction and updates delta when two actual differences between three addresses required to execute three successive iterations of the program instruction are equal to each other and different than delta. Thus, the system predicts constantly spaced addresses unless two successive addresses have a different spacing than the previous address. This is particularly advantageous when the program instruction adds data stored as elements of rows of one or more matrices. While the prediction will be incorrect for the first element in each row (and the first two elements in the first row) of each matrix, the prediction will be correct for all other elements in the rows, even if the inter-element spacings in rows of the different matrices are different than each other. For each of some predictions for successive iterations of the program instruction, the system negates the current value of the delta, whereby the predictions alternate between two addresses for multiple iterations of the program instruction.
    • 计算机系统基于执行相同程序指令的先前迭代所需的地址来预测执行程序指令的当前迭代所需的地址。 系统存储执行程序指令的先前迭代所需的地址,并且确定在当前迭代之前执行程序指令的连续迭代所需的地址之间的差异。 该系统还确定并存储增量的当前值,并且基于执行程序指令的先前迭代加上增量的当前值所需的地址来预测执行程序指令的当前迭代所需的地址。 该系统一次将增量设置为等于执行程序指令的两个连续迭代所需的两个地址之间的差异,并且当执行程序指令的三个连续迭代所需的三个地址之间的两个实际差异彼此相等时更新增量 并不同于三角洲。 因此,系统预测不间断的地址,除非两个连续的地址具有与先前地址不同的间隔。 当程序指令添加存储为一个或多个矩阵的行的元素的数据时,这是特别有利的。 虽然对于每个矩阵的每行(和第一行中的前两个元素)的第一个元素的预测将是不正确的,但是对于行中的所有其他元素,预测将是正确的,即使行中的元素间隔 的不同矩阵彼此不同。 对于程序指令的连续迭代的一些预测中的每一个,系统否定增量的当前值,由此预测在程序指令的多次迭代的两个地址之间交替。