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

1. 发明授权

US09417856B2 Efficient interpreter profiling to obtain accurate call-path information 有权
公开(公告)号：US09417856B2
公开(公告)日：2016-08-16
申请号：US13420616
申请日：2012-03-15
申请人： Graham A. Chapman , James I. Gartley , Daniel J. Heidinga , Vijay Sundaresan
发明人： Graham A. Chapman , James I. Gartley , Daniel J. Heidinga , Vijay Sundaresan
IPC分类号： G06F11/30 , G06F9/45 , G06F11/34 , G06F9/455
CPC分类号： G06F8/443 , G06F9/4552 , G06F11/3466 , G06F2201/86 , G06F2201/865
摘要： A method for obtaining accurate call path information in a mixed-mode environment where interpreted methods and non-interpreted methods can call one another is disclosed. In one embodiment, such a method includes generating an event and recording it in a buffer when an interpreted method calls an interpreted method. The method also generates an event and records it in the buffer when an interpreted method calls a non-interpreted method. The method further generates an event and records it in the buffer when a non-interpreted method calls an interpreted method. The method refrains from generating an event when a non-interpreted method calls a non-interpreted method. A corresponding apparatus and computer program product are also disclosed.

2. 发明申请

US20130243175A1 EFFICIENT INTERPRETER PROFILING TO OBTAIN ACCURATE CALL-PATH INFORMATION 有权
标题翻译：有效的解释器配置，以获得准确的呼叫路径信息
公开(公告)号：US20130243175A1
公开(公告)日：2013-09-19
申请号：US13420616
申请日：2012-03-15
申请人： Graham A. Chapman , James I. Gartley , Daniel J. Heidinga , Vijay Sundaresan
发明人： Graham A. Chapman , James I. Gartley , Daniel J. Heidinga , Vijay Sundaresan
IPC分类号： H04M3/42
CPC分类号： G06F8/443 , G06F9/4552 , G06F11/3466 , G06F2201/86 , G06F2201/865
摘要： A method for obtaining accurate call path information in a mixed-mode environment where interpreted methods and non-interpreted methods can call one another is disclosed. In one embodiment, such a method includes generating an event and recording it in a buffer when an interpreted method calls an interpreted method. The method also generates an event and records it in the buffer when an interpreted method calls a non-interpreted method. The method further generates an event and records it in the buffer when a non-interpreted method calls an interpreted method. The method refrains from generating an event when a non-interpreted method calls a non-interpreted method. A corresponding apparatus and computer program product are also disclosed.
摘要翻译：公开了一种用于在解释方法和非解释方法可以彼此呼叫的混合模式环境中获得准确的呼叫路径信息的方法。在一个实施例中，当解释方法调用解释方法时，这种方法包括生成事件并将其记录在缓冲器中。当解释方法调用非解释方法时，该方法还生成一个事件并将其记录在缓冲区中。当非解释方法调用解释方法时，该方法进一步生成事件并将其记录在缓冲器中。当非解释方法调用非解释方法时，该方法不会生成事件。还公开了相应的装置和计算机程序产品。

3. 发明申请

US20120192206A1 Deep Copying Objects in a Collocated Environment 有权
标题翻译：深层复制并置环境中的对象
公开(公告)号：US20120192206A1
公开(公告)日：2012-07-26
申请号：US13425844
申请日：2012-03-21
申请人： Derek B. Inglis , Aruna A. Kalagananam , Vijay Sundaresan
发明人： Derek B. Inglis , Aruna A. Kalagananam , Vijay Sundaresan
IPC分类号： G06F9/46
CPC分类号： G06F9/45504 , G06F9/547
摘要： Systems and methods of passing arguments between client and server contexts may provide for detecting an in-process call between a client and a server, wherein the client and the server share a common virtual machine instance. An object copy from a source object of the in-process call to a destination object can be conducted based on an internal class structure of the virtual machine instance. The object copy procedure may be repeated for a plurality of source objects of the in-process call.
摘要翻译：在客户端和服务器上下文之间传递参数的系统和方法可以提供用于检测客户端和服务器之间的进程内调用，其中客户端和服务器共享公共虚拟机实例。可以基于虚拟机实例的内部类结构，将进程中调用的源对象的目标对象复制到目标对象。可以针对进程内呼叫的多个源对象重复对象复制过程。

4. 发明申请

US20060168585A1 Computer-implemented method, system and program product for establishing multiple read-only locks on a shared data object 有权
标题翻译：用于在共享数据对象上建立多个只读锁的计算机实现的方法，系统和程序产品
公开(公告)号：US20060168585A1
公开(公告)日：2006-07-27
申请号：US11042778
申请日：2005-01-25
申请人： Nikola Grcevski , Kevin Stoodley , Mark Stoodley , Vijay Sundaresan
发明人： Nikola Grcevski , Kevin Stoodley , Mark Stoodley , Vijay Sundaresan
IPC分类号： G06F9/46
CPC分类号： G06F9/526 , G06F2209/523
摘要： Under the present invention, a locking primitive associated with a shared data object is automatically transformed to allow multiple read-only locks if certain conditions are met. To this extent, when a read-only lock on a shared data object is desired, a thread identifier of an object header lock word (hereinafter “lock word”) associated with the shared data object is examined to determine if a read-write lock on the shared data object already exists. If not, then the thread identifier is set to a predetermined value indicative of read-only locks, and a thread count in the lock word is incremented. If another thread attempts a read-only lock, the thread identifier will be examined for the predetermined value. If it is present, the thread count will be incremented again, and a second read-only lock will be simultaneously established.
摘要翻译：在本发明中，如果满足某些条件，则与共享数据对象相关联的锁定原语被自动转换以允许多个只读锁。在这种情况下，当需要共享数据对象上的只读锁时，检查与共享数据对象相关联的对象头锁定字（以下称为“锁字”）的线程标识符，以确定是否读写锁对共享数据对象已经存在。如果不是，则将线程标识符设置为指示只读锁定的预定值，并且增加锁定字中的线程数。如果另一个线程尝试只读锁，则将检查线程标识符的预定值。如果它存在，则线程计数将再次递增，并且将同时建立第二个只读锁。

5. 发明申请

US20060101441A1 System and method for frequency based loop reorganization 有权
公开(公告)号：US20060101441A1
公开(公告)日：2006-05-11
申请号：US10970436
申请日：2004-10-21
申请人： Mike Fulton , Christopher Larsson , Vijay Sundaresan
发明人： Mike Fulton , Christopher Larsson , Vijay Sundaresan
IPC分类号： 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.

6. 发明授权

US09507574B2 Method, computer program product, and device for selectively allocating memory 有权
标题翻译：方法，计算机程序产品和用于选择性地分配存储器的设备
公开(公告)号：US09507574B2
公开(公告)日：2016-11-29
申请号：US11536047
申请日：2006-09-28
申请人： Marcel Mitran , Vijay Sundaresan , Alexander Vaseilevskiy
发明人： Marcel Mitran , Vijay Sundaresan , Alexander Vaseilevskiy
IPC分类号： G06F9/44 , G06F9/45
CPC分类号： G06F8/425
摘要： Expressions are selectively retrieved from memory during compilation by scanning code for expressions that can be effectively accessed directly from highly cached memory without needing to be loaded into a register, e.g., expressions that are not modified by the rest of the code. The scanning may include examining the use of the expression. Those expressions may be retrieved directly from the highly cached memory rather than being loaded into registers. This reduces compilation time.
摘要翻译：在编译期间，通过扫描代码可以从高度缓存的存储器中直接有效访问的表达式而不需要加载到寄存器中，例如不被其余代码修改的表达式，可以在编译期间从存储器中选择性地检索表达式。扫描可能包括检查表达式的使用。这些表达式可以直接从高度缓存的存储器中检索，而不是被加载到寄存器中。这减少了编译时间。

7. 发明授权

US09229744B2 Prevention of classloader memory leaks in multitier enterprise applications 有权
标题翻译：在多企业应用程序中防止类加载器内存泄漏
公开(公告)号：US09229744B2
公开(公告)日：2016-01-05
申请号：US13434151
申请日：2012-03-29
申请人： Vijay Sundaresan , Andres H. Voldman
发明人： Vijay Sundaresan , Andres H. Voldman
IPC分类号： G06F9/445 , G06F12/02 , G06F12/08
CPC分类号： G06F8/77 , G06F9/30047 , G06F9/44521 , G06F12/0253 , G06F12/0802
摘要： A classloader cache class definition is obtained by a processor. The classloader cache class definition includes code that creates a classloader object cache that is referenced by a strong internal reference by a classloader object in response to instantiation of the classloader cache class definition. A classloader object cache is instantiated using the obtained classloader cache class definition. The strong internal reference is created at instantiation of the classloader object cache. A public interface to the classloader object cache is provided. The public interface to the classloader object cache operates as a weak reference to the classloader object cache and provides external access to the classloader object cache.
摘要翻译：类加载器缓存类定义由处理器获得。类加载器缓存类定义包括创建类加载器对象缓存的代码，该对象缓存由Classloader对象的强内部引用引用，以响应类加载器缓存类定义的实例化。使用获取的类加载器缓存类定义来实例化一个类加载器对象缓存。强大的内部引用是在类加载器对象缓存的实例化时创建的。提供了一个到类加载器对象缓存的公共接口。类加载器对象缓存的公共接口作为对类加载器对象缓存的弱引用，并提供对类加载器对象缓存的外部访问。

8. 发明授权

US08276134B2 Transforming locks in software loops 失效
标题翻译：在软件循环中转换锁
公开(公告)号：US08276134B2
公开(公告)日：2012-09-25
申请号：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/45
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.
摘要翻译：公开了用于在软件程序内采集和释放锁的改进的系统和计算机程序设计产品。在示例性实施例中，通过将采集和释放指令从循环内的位置重新定位到环路外的位置来变换环路内的锁定。这可能会在执行软件程序时不必要地锁定获取和释放。为了避免在相对长的时间段内获取和保持对象的锁定可能引起的争用问题，可以将竞争测试插入到循环中。如果软件程序中的另一个线程需要访问被锁定的对象，则这样的争用测试可临时释放该锁。

9. 发明授权

US08104028B2 Method for JIT compiler to optimize repetitive synchronization 失效
标题翻译： JIT编译器优化重复同步的方法
公开(公告)号：US08104028B2
公开(公告)日：2012-01-24
申请号：US12414991
申请日：2009-03-31
申请人： Mark Graham Stoodley , Vijay Sundaresan
发明人： Mark Graham Stoodley , Vijay Sundaresan
IPC分类号： G06F9/45
CPC分类号： G06F9/52 , G06F9/45516
摘要： Repetitive synchronization in program code is optimized through lock coarsening that is performed subject to a number of constraints. Using a forward pass over the program code followed by a backward pass, region extent bits may be determined that identify the points in the program where object locking can be coarsened. The program code may then be modified to realize coarsened locking regions determined based on the region extent bits. Alternatively, previously determined value numbers may provide much of the information collected by the two passes. In such a case, a single pass over the program code may locate features that limit lock coarsening opportunities. A set of synchronization operations that can be removed may then be determined and used when modifying the program code to coarsen locking regions.
摘要翻译：程序代码中的重复同步是通过锁定粗化进行优化的，该粗化是受许多约束条件执行的。使用向后传递程序代码，然后是向后传递，可以确定识别程序中可以粗化对象锁定的点的区域范围位。然后可以修改程序代码以实现基于区域范围位确定的粗化锁定区域。或者，先前确定的值号可以提供由两次通过所收集的大部分信息。在这种情况下，程序代码的单次传递可以定位限制锁定粗化机会的特征。然后可以在修改程序代码以粗化锁定区域时确定并使用可以移除的一组同步操作。

10. 发明授权

US08056067B2 Method, computer program product, and device for reducing delays in data processing 有权
标题翻译：方法，计算机程序产品和用于减少数据处理延迟的设备
公开(公告)号：US08056067B2
公开(公告)日：2011-11-08
申请号：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.
摘要翻译：在数据处理期间，使用编译器优化减少数据处理延迟。代码块按照最常重复的顺序扫描，最少经常排列。按照最经常重复的块到最少频繁地重复循环的顺序，在算术参考之前插入移位，使得先前使用算术参考不需要移位，在每个存储器使用之后插入移位，使得下一次使用存储器不需要移位，并且在每个算术参考之后插入移位，使得下一次使用算术参考不需要移位。此外，如果任何一个块的最后一个移位量与任何一个块中的所需初始移位量之间存在不匹配，则插入移位以弥补不匹配。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式