会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 85. 发明授权
    • Method and apparatus for implementing single/dual packed multi-way addition instructions having accumulation options
    • 用于实现具有累积选项的单/双包装多路加法指令的方法和装置
    • US06976049B2
    • 2005-12-13
    • US10107257
    • 2002-03-28
    • Gad Sheaffer
    • Gad Sheaffer
    • G06F7/50G06F7/509G06F9/30G06F9/302G06F9/32G06F9/38G06F15/00
    • G06F9/30094G06F7/509G06F9/3001G06F9/30036G06F9/30145G06F9/3875G06F9/3885
    • The present invention relates to a method and system for providing a single accumulatable packed multi-way addition instruction having the functionality of multiple instructions without causing any timing problems in the execute stage. Specifically, the accumulatable packed multi-way combination instruction may be associated with at least one destination and a plurality of operands and set a polarity of each of a plurality of source operands derived from the plurality of operands, if requested by the instruction. The instruction also may add selected pairs of the plurality of source operands in predetermined orders to obtain at least one result and, if requested by the instruction, accumulating the plurality of results to obtain at least one accumulated result; output at least one predetermined pair of the at least one result and the at least one accumulated result; and accumulate condition codes for each of the at least one result and the at least one accumulated result, if requested by the instruction.
    • 本发明涉及一种用于提供具有多个指令的功能的单个可累积的打包多路加法指令的方法和系统,而不会在执行阶段中引起任何定时问题。 具体地,如果该指令请求,则可累加的打包多路组合指令可以与至少一个目的地和多个操作数相关联,并且设置从多个操作数导出的多个源操作数中的每一个的操作数的极性。 指令还可以按预定顺序添加多个源操作数的选定对,以获得至少一个结果,并且如果该指令请求,则累积多个结果以获得至少一个累积结果; 输出所述至少一个结果和所述至少一个累积结果中的至少一个预定对; 以及如果所述指令请求,则对于所述至少一个结果中的每一个和所述至少一个累加结果累加条件代码。
    • 90. 发明授权
    • Live lock free priority scheme for memory transactions in transactional memory
    • 事务内存中的内存事务的实时锁定优先级方案
    • US08209689B2
    • 2012-06-26
    • US11854175
    • 2007-09-12
    • Shlomo RaikinShay GueronGad Sheaffer
    • Shlomo RaikinShay GueronGad Sheaffer
    • G06F9/52G06F13/14G06F12/00G06F7/00G06F13/00
    • G06F9/524G06F9/466
    • A method and apparatus for avoiding live-lock during transaction execution is herein described. Counting logic is utilized to track successfully committed transactions for each processing element. When a data conflict is detected between transactions on multiple processing elements, priority is provided to the processing element with the lower counting logic value. Furthermore, if the values are the same, then the processing element with the lower identification value is given priority, i.e. allowed to continue while the other transaction is aborted. To avoid live-lock between processing elements that both have predetermined counting logic values, such as maximum counting values, when one processing element reaches the predetermined counting value all counters are reset. In addition, a failure at maximum value (FMV) counter may be provided to count a number of aborts of a transaction when counting logic is at a maximum value. When the FMV counter is at a predetermined number of aborts the counting logic is reset to avoid live lock.
    • 这里描述了用于在事务执行期间避免实时锁定的方法和装置。 计数逻辑用于跟踪每个处理元素的成功提交事务。 当在多个处理元件之间的事务之间检测到数据冲突时,以较低的计数逻辑值提供给处理元件的优先级。 此外,如果值相同,则具有较低识别值的处理元件被赋予优先级,即允许在其他事务被中止时继续。 为了避免在具有预定的计数逻辑值(例如最大计数值)的处理元件之间的实时锁定,当一个处理元件达到预定计数值时,所有计数器都被重置。 此外,当计数逻辑处于最大值时,可以提供在最大值(FMV)计数器上的故障来计数事务的中止次数。 当FMV计数器处于预定数量的中止时,计数逻辑被复位以避免实时锁定。