会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明授权
    • 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. DavidsonNathan MyhrvoldKeith Randel VogelGideon Andreas YuvalRichard ShupakNorman Eugene Apperson
    • Robert I. DavidsonNathan MyhrvoldKeith Randel VogelGideon Andreas YuvalRichard ShupakNorman Eugene Apperson
    • G06F945
    • 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.
    • 本发明提供了一种用于确定计算机程序内的基本块的最佳布置顺序以改善参考的位置并减少计算机程序的工作集合的方法和系统。 通过减少工作集,计算机程序需要比通常在计算机系统上执行的更少的内存。 计算机程序中基本块的最佳布局顺序反映了在执行计算机程序期间基本块的使用的并发性。 用于确定最佳放置顺序的方法包括分析计算机程序以识别所有基本块,确定执行每个基本块的次数,根据执行每个基本块的次数为每个基本块分配布局顺序, 并根据其分配的布置顺序重新排序基本块,以生成优化的计算机程序。 用于识别所有基本块的方法包括拆分已知的指令地址以识别基本块的开始和结束,并处理跳转表以识别更多的指令地址。 处理跳转表包括在处理任何跳转表的第二个条目之前处理每个跳转表的第一个条目。 本发明通过用少量存储空间的其他指令替换很少执行的指令来进一步优化计算机程序。
    • 3. 发明授权
    • 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. DavidsonNathan MyhrvoldKeith Randel VogelGideon Andreas YuvalRichard ShupakNorman Eugene Apperson
    • Robert I. DavidsonNathan MyhrvoldKeith Randel VogelGideon Andreas YuvalRichard ShupakNorman Eugene Apperson
    • G06F9/45G06F9/44
    • 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.
    • 本发明提供了一种用于确定计算机程序内的基本块的最佳布置顺序以改善参考的位置并减少计算机程序的工作集合的方法和系统。 通过减少工作集,计算机程序需要比通常在计算机系统上执行的更少的内存。 计算机程序中基本块的最佳布局顺序反映了在执行计算机程序期间基本块的使用的并发性。 用于确定最佳放置顺序的方法包括分析计算机程序以识别所有基本块,确定执行每个基本块的次数,根据执行每个基本块的次数为每个基本块分配布局顺序, 并根据其分配的布置顺序重新排序基本块,以生成优化的计算机程序。 用于识别所有基本块的方法包括拆分已知的指令地址以识别基本块的开始和结束,并处理跳转表以识别更多的指令地址。 处理跳转表包括在处理任何跳转表的第二个条目之前处理每个跳转表的第一个条目。 本发明通过用少量存储空间的其他指令替换很少执行的指令来进一步优化计算机程序。
    • 4. 发明授权
    • Automatic bottleneck detection by means of workload reconstruction from
performance measurements
    • 通过性能测量的工作负载重建实现自动瓶颈检测
    • US6067412A
    • 2000-05-23
    • US516176
    • 1995-08-17
    • Russell P. BlakeDavid O. HovelRobert I. DavidsonDavid E. HeckermanJohn S. Breese
    • Russell P. BlakeDavid O. HovelRobert I. DavidsonDavid E. HeckermanJohn S. Breese
    • G06F11/34G06F9/00
    • G06F11/3409G06F11/3452G06F11/3414G06F11/3428G06F2201/815G06F2201/87G06F2201/885
    • A system and method for determining a workload placed on a target computer system during execution of a specified computer program. The system receives a set of performance measurements representing the performance of the target computer system during execution of the specified computer program. The system then identifies a plurality of workloads and for each identified workload, uses a model of the target computer system to predict a set of performance measurements that would results when a computer program that places the identified workload on the target computer system is executed. The system selects the identified workload whose set of predicted performance measurements most closely matches the received set of performance measurements as the determined workload that was place on the target computer system during execution of the specified computer program. The system uses the selected workload to predict the performance of the specified computer program on the target computer system with various different configurations. The system also determines the resource that is a bottleneck for each of the different configurations.
    • 一种用于在执行指定的计算机程序期间确定放置在目标计算机系统上的工作负载的系统和方法。 系统在执行指定的计算机程序期间接收表示目标计算机系统的性能的一组性能测量。 然后,系统识别多个工作负载,并且对于每个所识别的工作负载,使用目标计算机系统的模型来预测当将所识别的工作负载置于目标计算机系统上的计算机程序被执行时将导致的一组性能测量。 该系统选择所识别的工作负载,其中一组预测的性能测量与所接收的一组性能测量值最接近地匹配,作为在执行指定的计算机程序期间放置在目标计算机系统上的确定的工作负载。 系统使用所选择的工作负载来预测具有各种不同配置的目标计算机系统上指定的计算机程序的性能。 该系统还确定作为每个不同配置的瓶颈的资源。
    • 7. 发明授权
    • Apparatus and method for swapping blocks of memory between a main memory
area and a secondary storage area of a computer system
    • 用于交换计算机系统的主存储区域和辅助存储区域之间的存储块的装置和方法
    • US5809564A
    • 1998-09-15
    • US266731
    • 1994-06-27
    • Andrew C. CrazeRobert I. DavidsonPaul W. Davis
    • Andrew C. CrazeRobert I. DavidsonPaul W. Davis
    • G06F9/42G06F12/02G06F12/08G06F12/10
    • G06F9/4426G06F12/023G06F12/08
    • A method and system for swapping blocks of data between a main memory area and a secondary storage area of a computer system that uses absolute addresses as its native addressing format. A series of linked information structures is maintained in the main memory area of the computer system. Each information structure allocates storage for a near return address pointer, a previous information structure pointer, a reference number and an offset. A first and second data block are swapped into the main memory area of the computer system. When the first data block transfers control to the second data block, a memory location indicating an absolute address for this point of transfer is stored in an information structure associated with the first data block. Prior to swapping the first data block out of the main memory area, the absolute address is resolved into a reference number and an offset. This resolved address is then stored in an information structure associated with the first data block. When the first data block is swapped back into the main memory area, the resolved address is restored into a new absolute address which directs processing control to a proper return point in the first data block.
    • 在使用绝对地址作为其本地寻址格式的计算机系统的主存储区域和次存储区域之间交换数据块的方法和系统。 在计算机系统的主存储区域中保持一系列链接的信息结构。 每个信息结构为近返回地址指针,先前的信息结构指针,参考号和偏移量分配存储。 第一和第二数据块被交换到计算机系统的主存储器区域中。 当第一数据块将控制传送到第二数据块时,指示用于该传送点的绝对地址的存储器位置被存储在与第一数据块相关联的信息结构中。 在将第一数据块从主存储区域交换之前,绝对地址被解析为参考号和偏移量。 然后将该解析的地址存储在与第一数据块相关联的信息结构中。 当第一个数据块被交换回主存储器区域时,解析的地址被还原成一个新的绝对地址,它将处理控制引导到第一个数据块中的正确返回点。