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

41. 发明授权

US07937552B2 Cache line reservations 失效
标题翻译：缓存线预留
公开(公告)号：US07937552B2
公开(公告)日：2011-05-03
申请号：US11943252
申请日：2007-11-20
申请人： Daryl James Maier , Marcel Mitran , Vijay Sundaresan
发明人： Daryl James Maier , Marcel Mitran , Vijay Sundaresan
IPC分类号： G06F12/00
CPC分类号： G06F12/0253 , G06F12/126
摘要： Illustrative embodiments provide a computer implemented method, an apparatus in the form of a data processing system and a computer program product for cache line reservations. In one embodiment, the computer implemented method comprises, dividing a memory into an unreserved section and a set of reserved sections. The method performs selected allocations of the memory only from the set of reserved sections, and performing un-selected allocations of the memory from the unreserved section. The method further mapping a specified selected allocation of the memory to a same corresponding line of cache memory each time the mapping for the specified selected allocation of the memory occurs, thereby maintaining locality.
摘要翻译：说明性实施例提供计算机实现的方法，数据处理系统形式的装置和用于高速缓存行预留的计算机程序产品。在一个实施例中，计算机实现的方法包括：将存储器划分为未预留部分和一组预留部分。该方法仅从保留部分组执行存储器的选择分配，并且从未保留部分执行存储器的未选择分配。每当存储器的指定选择分配的映射发生时，该方法进一步将存储器的指定选择的分配映射到相同的相应的高速缓冲存储器行，从而保持局部性。

42. 发明申请

US20110055819A1 System and Method for Optimizing Compiler Performance by Object Collocation 有权
标题翻译：通过对象配置优化编译器性能的系统和方法
公开(公告)号：US20110055819A1
公开(公告)日：2011-03-03
申请号：US12858001
申请日：2010-08-17
申请人： Patrick Doyle , Pramod Ramarao , Vijay Sundaresan
发明人： Patrick Doyle , Pramod Ramarao , Vijay Sundaresan
IPC分类号： G06F9/45
CPC分类号： G06F8/443 , G06F8/4442
摘要： A computer-implemented method, system, and computer program product for performing object collocation on a computer system are provided. The method includes analyzing a sequence of computer instructions for object allocations and uses of the allocated objects. The method further includes creating an allocation interference graph of object allocation nodes with edges indicating pairs of allocations to be omitted from collocation. The method also includes coloring the allocation interference graph such that adjacent nodes are assigned different colors, and creating an object allocation at a program point prior to allocations of a selected color from the allocation interference graph. The method additionally includes storing an address associated with the created object allocation in a collocation pointer, and replacing a use of each allocation of the selected color with a use of the collocation pointer to collocate multiple objects.
摘要翻译：提供了一种用于在计算机系统上执行对象搭配的计算机实现的方法，系统和计算机程序产品。该方法包括分析用于对象分配的计算机指令序列和所分配的对象的使用。该方法还包括创建对象分配节点的分配干涉图，其边缘指示将从配置中省略的分配对。该方法还包括着色分配干涉图，使得相邻节点被分配不同的颜色，并且在从分配干涉图分配所选择的颜色之前在程序点创建对象分配。该方法还包括将与所创建的对象分配相关联的地址存储在并置指针中，并且通过使用并置指针来并置多个对象来替换所选颜色的每个分配的使用。

43. 发明授权

US07574704B2 System and method for frequency based loop reorganization 有权
标题翻译：基于频率循环重组的系统和方法
公开(公告)号：US07574704B2
公开(公告)日：2009-08-11
申请号：US10970436
申请日：2004-10-21
申请人： Mike Stephen Fulton , Christopher B. Larsson , Vijay Sundaresan
发明人： Mike Stephen Fulton , Christopher B. Larsson , Vijay Sundaresan
IPC分类号： G06F9/44 , G06F9/45
CPC分类号： G06F8/443
摘要： A system and method for reorganizing source code using frequency based instruction loop replication are provided. Code is reorganized based on the frequency of execution of blocks of the code so as to favor frequently executed blocks of code over rarely executed code with regard to subsequent optimizations. Frequently executed blocks of instructions are maintained within loop/switch statements and rarely executed blocks of instructions are removed from the loop/switch statements. The rarely executed blocks of instructions may be replicated after the loop/switch statement with a reference back to the loop/switch statement. In this way, when subsequent loop/switch statement optimizations are applied, the frequently executed blocks of instructions within the loop are more likely to benefit from such optimizations since the negative influence of the rarely executed blocks of instructions has been removed.
摘要翻译：提供了一种使用基于频率的指令循环复制来重组源代码的系统和方法。基于代码块的执行频率对代码进行重组，从而有利于经常执行的代码块对于后续优化的执行代码很少。在循环/切换语句中维护经常执行的指令块，很少执行的指令块将从循环/切换语句中删除。在循环/切换语句之后，很少执行的指令块可以被引用回到loop / switch语句。以这种方式，当应用后续的循环/开关语句优化时，循环中频繁执行的指令块更可能受益于这种优化，因为很少执行的指令块的负面影响已被消除。

44. 发明申请

US20090125893A1 METHOD AND APPARATUS FOR MANAGING VARIABLE ASSIGNMENTS IN A PROGRAM 有权
标题翻译：管理程序中可变分配的方法和装置
公开(公告)号：US20090125893A1
公开(公告)日：2009-05-14
申请号：US11938884
申请日：2007-11-13
申请人： Reid T. Copeland , Mark Graham Stoodley , Vijay Sundaresan , Ning Thomas Wong
发明人： Reid T. Copeland , Mark Graham Stoodley , Vijay Sundaresan , Ning Thomas Wong
IPC分类号： G06F9/45
CPC分类号： G06F8/443
摘要： The illustrative embodiments described herein provide a computer-implemented method, apparatus, and computer program product for managing variable assignments in a program. The process identifies a set of variable assignments that is live on a portion of paths to form a set of identified variable assignments. Each of the set of identified variable assignments assign a value to at least one variable of a set of variables. The process determines a set of program points at which the set of identified variable assignments is live on all paths. The process also moves the set of identified variable assignments to the set of program points in response to determining that the set of identified variable assignments is movable to the set of program points.
摘要翻译：本文描述的说明性实施例提供了一种用于管理程序中的可变分配的计算机实现的方法，装置和计算机程序产品。该过程识别一组可变分配，其存在于一部分路径上以形成一组已识别的变量分配。识别的变量赋值集合中的每一个将值分配给一组变量的至少一个变量。该过程确定一组程序点，在该集合上，所识别的变量分配集合在所有路径上都存在。响应于确定所识别的可变分配集合可移动到该组节目点，该过程还将所识别的变量分配集合移动到该组节目点。

45. 发明申请

US20080250396A1 Transforming Locks in Software Loops 失效
标题翻译：在软件环路中转换锁
公开(公告)号：US20080250396A1
公开(公告)日：2008-10-09
申请号：US12135311
申请日：2008-06-09
申请人： Nikola Grcevski , Kevin Alexander Stoodley , Mark Graham Stoodley , Vijay Sundaresan
发明人： Nikola Grcevski , Kevin Alexander Stoodley , Mark Graham Stoodley , Vijay Sundaresan
IPC分类号： G06F9/44
CPC分类号： G06F8/443 , Y10S707/99938
摘要： An improved system and computer programming product for acquisition and release of locks within a software program is disclosed. In an exemplary embodiment, a lock within a loop is transformed by relocating acquisition and release instructions from within the loop to positions outside the loop. This may significantly decrease unnecessarily lock acquisition and release during execution of the software program. In order to avoid contention problems which may arise from acquiring and keeping a lock on an object over a relatively long period of time, a contention test may be inserted into the loop. Such a contention test may temporarily release the lock if another thread in the software program requires access to the locked object.
摘要翻译：公开了用于在软件程序内采集和释放锁的改进的系统和计算机程序设计产品。在示例性实施例中，通过将采集和释放指令从循环内的位置重新定位到环路外的位置来变换环路内的锁定。这可能会在执行软件程序时不必要地锁定获取和释放。为了避免在相对长的时间段内获取和保持对象的锁定可能引起的争用问题，可以将竞争测试插入到循环中。如果软件程序中的另一个线程需要访问被锁定的对象，则这样的争用测试可临时释放该锁。

46. 发明申请

US20080098376A1 METHOD, COMPUTER PROGRAM PRODUCT, AND DEVICE FOR REDUCING DELAYS IN DATA PROCESSING 有权
标题翻译：方法，计算机程序产品和用于减少数据处理延迟的装置
公开(公告)号：US20080098376A1
公开(公告)日：2008-04-24
申请号：US11536837
申请日：2006-09-29
申请人： Michael Fulton , Allan Kielstra , Vijay Sundaresan
发明人： Michael Fulton , Allan Kielstra , Vijay Sundaresan
IPC分类号： G06F9/45
CPC分类号： G06F8/4451
摘要： Data processing delay is reduced during data processing, using compiler optimization. Blocks of code are scanned in an order from blocks recurring most often to blocks recurring least often. In an order from blocks recurring most often to block recurring least often, shifts are inserted before arithmetic references, such that a previous use of the arithmetic reference does not require a shift, shifts are inserted after each memory use such that the next use of the memory does not require a shift, and shifts are inserted after each arithmetic reference such that the next use of the arithmetic reference requires no shift. In addition, if there is a mismatch between the last shifted amount of any one block and the required initial shifted amount in any of its successors, shifts are inserted to make up for the mismatch.
摘要翻译：在数据处理期间，使用编译器优化减少数据处理延迟。代码块按照最常重复的顺序扫描，最少经常排列。按照最经常重复的块到最少频繁地重复循环的顺序，在算术参考之前插入移位，使得先前使用算术参考不需要移位，在每个存储器使用之后插入移位，使得下一次使用存储器不需要移位，并且在每个算术参考之后插入移位，使得下一次使用算术参考不需要移位。此外，如果任何一个块的最后一个移位量与任何一个块中的所需初始移位量之间存在不匹配，则插入移位以弥补不匹配。

47. 发明申请

US20070226683A1 Method of efficiently performing precise profiling in a multi-threaded dynamic compilation environment 失效
标题翻译：在多线程动态编译环境中有效执行精确剖析的方法
公开(公告)号：US20070226683A1
公开(公告)日：2007-09-27
申请号：US11388607
申请日：2006-03-24
申请人： Kevin Stoodley , Vijay Sundaresan
发明人： Kevin Stoodley , Vijay Sundaresan
IPC分类号： G06F9/44
CPC分类号： G06F8/443
摘要： Synchronizing clones of a software method to be executed by at least one thread while the software method is compiled. The software method is cloned to generate a software method clone. At least one transition is created between equivalent program points in the software method and the software method clone. A lock object is inserted into one of the software method and the software method clone. Then, code that controls the at least one transition between a profiling clone and a non-profiling clone is changed to access thread-local storage. The non-profiling clone is the one of the software method and the software method clone into which the lock object was inserted. A first synchronization operation is performed at or after an entry point of the non-profiling clone. Then, the profiling clone is executed using thread-local storage.
摘要翻译：在软件方法被编译的同时，由至少一个线程执行的软件方法的克隆。克隆软件方法以生成软件方法克隆。在软件方法中的等效程序点和软件方法克隆之间至少创建一个转换。将锁定对象插入到软件方法和软件方法克隆之一中。然后，更改控制概要分析克隆和非概要分析克隆之间的至少一个转换的代码，以访问线程本地存储。非分析克隆是插入锁定对象的软件方法和软件方法克隆之一。在非分析克隆的入口点之前或之后执行第一同步操作。然后，使用线程本地存储执行概要分析克隆。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式