专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US06292934B1 Method and system for improving the locality of memory references during execution of a computer program 失效
标题翻译：用于在计算机程序执行期间改善存储器引用的位置的方法和系统
公开(公告)号：US06292934B1
公开(公告)日：2001-09-18
申请号：US08846893
申请日：1997-05-01
申请人： Robert I. Davidson , Nathan Myhrvold , Keith Randel Vogel , Gideon Andreas Yuval , Richard Shupak , Norman Eugene Apperson
发明人： Robert I. Davidson , Nathan Myhrvold , Keith Randel Vogel , Gideon Andreas Yuval , Richard Shupak , Norman Eugene Apperson
IPC分类号： G06F945
CPC分类号： G06F8/4442
摘要： The present invention provides a method and system for determining an optimal placement order for basic blocks within a computer program to improve locality of reference and reduce the working set of the computer program. By reducing the working set, the computer program requires less memory than it normally would require to execute on a computer system. The optimal placement order for basic blocks within a computer program reflects the concurrency of usage for basic blocks during execution of the computer program. The method for determining an optimal placement order includes analyzing the computer program to identify all of the basic blocks, determining how many times each basic block is executed, assigning a placement order to each basic block depending upon how many times each basic block was executed, and reordering the basic blocks according to their assigned placement orders to produce an optimized computer program. The method used to identify all of the basic blocks includes disassembling known instruction addresses to identify the beginning and end of basic blocks and processing jump tables to identify more instruction addresses. Processing jump tables includes processing the first entry of every jump table before processing the second entry of any jump table. The present invention further optimizes a computer program by replacing rarely executed instructions with other instructions that require a smaller amount of storage space.
摘要翻译：本发明提供了一种用于确定计算机程序内的基本块的最佳布置顺序以改善参考的位置并减少计算机程序的工作集合的方法和系统。通过减少工作集，计算机程序需要比通常在计算机系统上执行的更少的内存。计算机程序中基本块的最佳布局顺序反映了在执行计算机程序期间基本块的使用的并发性。用于确定最佳放置顺序的方法包括分析计算机程序以识别所有基本块，确定执行每个基本块的次数，根据执行每个基本块的次数为每个基本块分配布局顺序，并根据其分配的布置顺序重新排序基本块，以生成优化的计算机程序。用于识别所有基本块的方法包括拆分已知的指令地址以识别基本块的开始和结束，并处理跳转表以识别更多的指令地址。处理跳转表包括在处理任何跳转表的第二个条目之前处理每个跳转表的第一个条目。本发明通过用少量存储空间的其他指令替换很少执行的指令来进一步优化计算机程序。

2. 发明授权

US5790858A Method and system for selecting instrumentation points in a computer program 失效
标题翻译：在计算机程序中选择仪器仪表的方法和系统
公开(公告)号：US5790858A
公开(公告)日：1998-08-04
申请号：US268444
申请日：1994-06-30
申请人： Keith Randel Vogel
发明人： Keith Randel Vogel
IPC分类号： G06F11/36 , G06F9/44
CPC分类号： G06F11/3612
摘要： The present invention provides a method in a computer system for selecting instrumentation points in a computer program. Instrumentation points are locations within the computer program at which instrumentation code is inserted. The method includes identifying code portions such as basic blocks in the computer program code, creating a control flow graph out of the code portions, generating a spanning tree for the control flow graph, and then selecting those edges of the control flow graph which are not a part of the spanning tree as instrumentation points. After instrumentation points are selected, instrumentation code may be added at those locations. When the computer program is executed, the added instrumentation code records execution information such as how many times an instrumentation point is accessed during execution of the computer program. Using the recorded execution information and direction specified in the control flow graph, execution information for the non-instrumented blocks may then be calculated.
摘要翻译：本发明提供了一种用于在计算机程序中选择仪表点的计算机系统中的方法。仪表点是计算机程序中插入仪器代码的位置。该方法包括识别代码部分，例如计算机程序代码中的基本块，从代码部分创建控制流程图，生成控制流程图的生成树，然后选择不是的控制流程图的边缘生成树的一部分作为仪表点。选择仪器仪表点后，可在这些位置添加仪表代码。当执行计算机程序时，所附加的检测代码记录执行信息，例如在执行计算机程序期间访问检测点的次数。使用记录的执行信息和在控制流程图中指定的方向，然后可以计算非检测块的执行信息。

3. 发明授权

US5664191A Method and system for improving the locality of memory references during execution of a computer program 失效
标题翻译：用于在计算机程序执行期间改善存储器引用的位置的方法和系统
公开(公告)号：US5664191A
公开(公告)日：1997-09-02
申请号：US268277
申请日：1994-06-30
申请人： Robert I. Davidson , Nathan Myhrvold , Keith Randel Vogel , Gideon Andreas Yuval , Richard Shupak , Norman Eugene Apperson
发明人： Robert I. Davidson , Nathan Myhrvold , Keith Randel Vogel , Gideon Andreas Yuval , Richard Shupak , Norman Eugene Apperson
IPC分类号： G06F9/45 , G06F9/44
CPC分类号： G06F8/4442
摘要： The present invention provides a method and system for determining an optimal placement order for basic blocks within a computer program to improve locality of reference and reduce the working set of the computer program. By reducing the working set, the computer program requires less memory than it normally would require to execute on a computer system. The optimal placement order for basic blocks within a computer program reflects the concurrency of usage for basic blocks during execution of the computer program. The method for determining an optimal placement order includes analyzing the computer program to identify all of the basic blocks, determining how many times each basic block is executed, assigning a placement order to each basic block depending upon how many times each basic block was executed, and reordering the basic blocks according to their assigned placement orders to produce an optimized computer program. The method used to identify all of the basic blocks includes disassembling known instruction addresses to identify the beginning and end of basic blocks and processing jump tables to identify more instruction addresses. Processing jump tables includes processing the first entry of every jump table before processing the second entry of any jump table. The present invention further optimizes a computer program by replacing rarely executed instructions with other instructions that require a smaller amount of storage space.
摘要翻译：本发明提供了一种用于确定计算机程序内的基本块的最佳布置顺序以改善参考的位置并减少计算机程序的工作集合的方法和系统。通过减少工作集，计算机程序需要比通常在计算机系统上执行的更少的内存。计算机程序中基本块的最佳布局顺序反映了在执行计算机程序期间基本块的使用的并发性。用于确定最佳放置顺序的方法包括分析计算机程序以识别所有基本块，确定执行每个基本块的次数，根据执行每个基本块的次数为每个基本块分配布局顺序，并根据其分配的布置顺序重新排序基本块，以生成优化的计算机程序。用于识别所有基本块的方法包括拆分已知的指令地址以识别基本块的开始和结束，并处理跳转表以识别更多的指令地址。处理跳转表包括在处理任何跳转表的第二个条目之前处理每个跳转表的第一个条目。本发明通过用少量存储空间的其他指令替换很少执行的指令来进一步优化计算机程序。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式