会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 4. 发明授权
    • Method for minimizing spill in code scheduled by a list scheduler
    • 用于最小化由列表调度程序调度的代码中的溢出的方法
    • US07478379B2
    • 2009-01-13
    • US10840088
    • 2004-05-06
    • Damien BonaventureJames Lawrence McInnes
    • Damien BonaventureJames Lawrence McInnes
    • G06F9/44G06F9/48G06F9/40
    • G06F8/445
    • A technique of ordering machine instructions to reduce spill code. For each machine instruction that is ready for scheduling, an amount is determined by which the size of a committed set of machine instructions would increase upon the scheduling of the machine instruction. The machine instruction for which the determined amount is smallest is then scheduled. The currently committed instructions may be determined to be the machine instructions that are already scheduled as well as the machine instructions that are descendent from already scheduled machine instructions. The result is that new computations upon which a target processor will embark tend to be deferred. Bit vectors may be employed for efficiency during the assessment of candidate instructions that are ready for scheduling. The technique may be triggered when the risk of registers becoming overcommitted becomes high, as may occur when the number of available processor registers drops below a certain threshold.
    • 订购机器指令以减少溢出代码的技术。 对于准备进行调度的每个机器指令,根据机器指令的调度,确定机器指令的一定程度的大小将被确定。 然后调度确定量最小的机器指令。 可以将当前承诺的指令确定为已经被调度的机器指令以及从已经调度的机器指令后代的机器指令。 结果是,目标处理器将趋于延迟的新计算。 可以在准备好进行调度的候选指令的评估期间采用位向量的效率。 当寄存器过度承担的风险变高时,可能会触发该技术,如可用处理器寄存器的数量低于某个阈值时可能会发生的。
    • 10. 发明授权
    • Connectivity based program partitioning
    • 基于连接的程序分区
    • US5797012A
    • 1998-08-18
    • US727720
    • 1996-10-07
    • Robert James BlaineyChristopher Michael DonawaJames Lawrence McInnes
    • Robert James BlaineyChristopher Michael DonawaJames Lawrence McInnes
    • G06F9/45
    • G06F8/443
    • A method for partitioning programs into multi-procedure modules for efficient compilation. During interprocedural analysis, a weighted callgraph of the program is constructed in which weights on nodes represent code size of each procedure and weights on edges between the nodes represent execution counts between procedures. A coloured interference graph is built from the analysis information, and is used to induce weighted sub-graphs of the callgraph containing no interferences between procedures in each sub-graph. The procedures from a single sub-graph are combined into one or more modules; procedures with the highest weighted edges between them are combined in a module first until the cumulative node weight of the module reaches a preset limit on memory size.
    • 一种将程序划分为多程序模块以实现高效编译的方法。 在过程间分析期间,构建了程序的加权调用,其中节点上的权重表示每个过程的代码大小,并且节点之间的边上的权重表示过程之间的执行计数。 彩色干涉图是从分析信息构建的,用于诱导不包含每个子图中的过程之间干扰的呼叫图的加权子图。 来自单个子图的过程被组合成一个或多个模块; 在它们之间具有最高加权边缘的程序首先被组合在模块中,直到模块的累积节点权重达到存储器大小的预设限制。