会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Method and apparatus for modular reordering of portions of a computer
program based on profile data
    • 基于简档数据对计算机程序的部分进行模块化重排序的方法和装置
    • US6029004A
    • 2000-02-22
    • US819526
    • 1997-03-17
    • Vita BortnikovBilha MendelsonMark NovickRobert Ralph RoedigerWilliam Jon SchmidtInbal Shavit-Lottem
    • Vita BortnikovBilha MendelsonMark NovickRobert Ralph RoedigerWilliam Jon SchmidtInbal Shavit-Lottem
    • G06F9/45G06F9/44
    • G06F8/445
    • An apparatus and method reorder portions of a computer program in a way that achieves both enhanced performance and maintainability of the computer program. A global call graph is initially constructed that includes profile data. From the information in the global call graph, an intramodular call graph is generated for each module. Reordering techniques are used to reorder the procedures in each module according to the profile data in each intramodular call graph. An intermodular call graph is generated from the information in the global call graph. Reordering techniques are used to reorder the modules in the computer program. By reordering procedures within modules, then reordering the modules, enhanced performance is achieved without reordering procedures across module boundaries. Respecting module boundaries enhances the maintainability of the computer program by allowing a module to be replaced without adversely affecting the other modules while still providing many of the advantages of global procedure reordering.
    • 一种装置和方法以实现计算机程序的增强的性能和可维护性的方式重新排序计算机程序的部分。 最初构建包括配置文件数据的全局调用图。 从全局调用图中的信息,为每个模块生成一个集体内调用图。 根据每个模块间调用图中的配置文件数据,重新排序技术用于对每个模块中的过程重新排序。 从全局调用图中的信息生成一个多模式调用图。 重新排序技术用于重新排序计算机程序中的模块。 通过重新排序模块中的过程,然后重新排序模块,实现增强的性能,而无需跨模块边界重新排序过程。 尊重模块边界通过允许更换模块而不会对其他模块产生不利影响,从而提高计算机程序的可维护性,同时仍然提供全局过程重新排序的许多优点。
    • 3. 发明授权
    • Method and apparatus for profile-based reordering of program portions in
a computer program
    • 用于计算机程序中的程序部分的基于简档的重新排序的方法和装置
    • US5950009A
    • 1999-09-07
    • US814527
    • 1997-03-10
    • Vita BortnikovBilha MendelsonMark NovickWilliam Jon SchmidtInbal Shavit-Lottem
    • Vita BortnikovBilha MendelsonMark NovickWilliam Jon SchmidtInbal Shavit-Lottem
    • G06F9/45G06F9/445
    • G06F8/445
    • An apparatus and several methods provide for a more optimized computer program that will have a faster execution time than was possible using the prior art reordering technique that adds to a trace until it finds no more predecessors or successors to add. The apparatus and methods disclosed herein use a variety of methods to reorder the program portions in a more intelligent manner that will improve its run-time performance. Each of these methods involves constructing traces in the control flow graph of the computer program. In a first embodiment, a basic block is only added to a trace if it is not negligible within predetermined limits. This negligibility test results in traces that are not extended for infrequently executed basic blocks. In a second embodiment, a basic block is only added to a trace if it is a perfect partner with the last basic block added to the trace. The concept of a "perfect partner" helps to match basic blocks together in a trace that have the greatest affinity for each other. In a third embodiment, a basic block is only added to a trace if it satisfies "should follow" flags and predetermined negligibility criteria. The "should follow" flags and negligibility criteria provide a complex criteria for adding basic blocks to a trace, criteria that create more efficient code in some specific circumstances.
    • 一种装置和几种方法提供了一种更优化的计算机程序,该程序具有比使用现有技术重新排序技术更快的执行时间,该技术可以添加到跟踪中,直到找不到更多的前导或后继来添加。 本文公开的装置和方法使用各种方法以更智能的方式重新排序程序部分,这将改善其运行时性能。 这些方法中的每一个都涉及在计算机程序的控制流程图中构造跟踪。 在第一实施例中,如果基本块仅在预定限度内不可忽略,则仅添加到轨迹。 这种可忽略性测试导致对于不经常执行的基本块不扩展的迹线。 在第二实施例中,如果基本块是与添加到跟踪的最后基本块的完美伙伴,则仅添加到跟踪。 “完美伴侣”的概念有助于将基本块在一起,彼此之间具有最大的亲和力。 在第三实施例中,如果基本块满足“应遵循”标志和预定的可忽略性标准,则仅添加到跟踪。 “应遵循”标志和忽略标准为添加基本块的跟踪提供了一个复杂的标准,在某些特定情况下创建更有效的代码的标准。