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

1. 发明授权

US08065565B2 Statistical debugging using paths and adaptive profiling 有权
标题翻译：使用路径和适应性分析的统计调试
公开(公告)号：US08065565B2
公开(公告)日：2011-11-22
申请号：US12245581
申请日：2008-10-03
申请人： Trishul Chilimbi , Krishna Kumar Mehra , Benjamin Robert Liblit , Aditya V. Nori , Kapil Vaswani
发明人： Trishul Chilimbi , Krishna Kumar Mehra , Benjamin Robert Liblit , Aditya V. Nori , Kapil Vaswani
IPC分类号： G06F11/00
CPC分类号： G06F11/366
摘要： The method executes the application and if there are no errors from the execution of the application, the method ends. If errors exist, the errors are collected from the execution of the application in an error report. Labeled application paths are created by adding a unique label to individual application paths where the application paths are individual loops and individual functions in the application. An analysis is created of the labeled application paths by executing the application with the labeled paths, reviewing the error report for data related to the labels and if an error is sufficiently related to application paths with labels, storing the path that created the errors in a report. If an error is not sufficient related to the application path with labels, the method is repeated by the creating the analysis again by substituting additional application paths for the application paths.
摘要翻译：该方法执行应用程序，如果应用程序的执行没有错误，则该方法结束。如果存在错误，则会在错误报告中从应用程序的执行中收集错误。标签的应用程序路径是通过向单个应用程序路径添加唯一标签创建的，其中应用程序路径是单个循环和应用程序中的单个功能。通过使用标记的路径执行应用程序来创建标记的应用程序路径的分析，查看与标签相关的数据的错误报告，并且如果错误与具有标签的应用程序路径充分相关，则将创建错误的路径存储在报告。如果与标签的应用程序路径相关的错误不足，则通过将其他应用程序路径替换为应用程序路径，再次创建分析来重复该方法。

2. 发明申请

US20100088546A1 STATISTICAL DEBUGGING USING PATHS AND ADAPTIVE PROFILING 有权
标题翻译：使用PATHS和自适应配置文件进行统计调试
公开(公告)号：US20100088546A1
公开(公告)日：2010-04-08
申请号：US12245581
申请日：2008-10-03
申请人： Trishul Chilimbi , Krishna Kumar Mehra , Benjamin Robert Liblit , Aditya V. Nori , Kapil Vaswani
发明人： Trishul Chilimbi , Krishna Kumar Mehra , Benjamin Robert Liblit , Aditya V. Nori , Kapil Vaswani
IPC分类号： G06F11/36
CPC分类号： G06F11/366
摘要： The method executes the application and if there are no errors from the execution of the application, the method ends. If errors exist, the errors are collected from the execution of the application in an error report. Labeled application paths are created by adding a unique label to individual application paths where the application paths are individual loops and individual functions in the application. An analysis is created of the labeled application paths by executing the application with the labeled paths, reviewing the error report for data related to the labels and if an error is sufficiently related to application paths with labels, storing the path that created the errors in a report. If an error is not sufficient related to the application path with labels, the method is repeated by the creating the analysis again by substituting additional application paths for the application paths.
摘要翻译：该方法执行应用程序，如果应用程序的执行没有错误，则该方法结束。如果存在错误，则会在错误报告中从应用程序的执行中收集错误。标签的应用程序路径是通过向单个应用程序路径添加唯一标签创建的，其中应用程序路径是单个循环和应用程序中的单个功能。通过使用标记的路径执行应用程序来创建标记的应用程序路径的分析，查看与标签相关的数据的错误报告，并且如果错误与具有标签的应用程序路径充分相关，则将创建错误的路径存储在报告。如果与标签的应用程序路径相关的错误不足，则通过将其他应用程序路径替换为应用程序路径，再次创建分析来重复该方法。

3. 发明授权

US07926043B2 Data structure path profiling 有权
标题翻译：数据结构路径分析
公开(公告)号：US07926043B2
公开(公告)日：2011-04-12
申请号：US11425354
申请日：2006-06-20
申请人： Kapil Vaswani , Trishul Chilimbi
发明人： Kapil Vaswani , Trishul Chilimbi
IPC分类号： G06F9/44 , G06F9/45
CPC分类号： G06F11/3466 , G06F2201/865
摘要： The described technology provides data structure path profiling. An instrumented version of a program is created that calls a profiler runtime when pointer based data structures are allocated or accessed via pointers. A model of the heap is created and nodes in the model data structures are assigned unique identifiers. Paths traversed through the model data structures are assigned unique identifiers. The paths are counted in order to identify paths through the data structure model that are traversed frequently. The model is useful for providing information about high frequency data paths to the program developer and for various optimization purposes, such as prefetching and or increasing data locality during garbage collection.
摘要翻译：所描述的技术提供了数据结构路径分析。创建了一个程序的检测版本，当通过指针分配或访问基于指针的数据结构时，调用分析器运行时。创建堆的模型，并为模型数据结构中的节点分配唯一的标识符。遍历模型数据结构的路径被分配唯一的标识符。对路径进行计数，以便识别经过数据结构模型的路径。该模型对于向程序开发人员提供关于高频数据路径的信息以及各种优化目的是有用的，例如在垃圾收集期间预取和/或增加数据局部性。

4. 发明申请

US20080005208A1 DATA STRUCTURE PATH PROFILING 有权
标题翻译：数据结构路径分布
公开(公告)号：US20080005208A1
公开(公告)日：2008-01-03
申请号：US11425354
申请日：2006-06-20
申请人： Kapil Vaswani , Trishul Chilimbi
发明人： Kapil Vaswani , Trishul Chilimbi
IPC分类号： G06F17/30
CPC分类号： G06F11/3466 , G06F2201/865
摘要： The described technology provides data structure path profiling. An instrumented version of a program is created that calls a profiler runtime when pointer based data structures are allocated or accessed via pointers. A model of the heap is created and nodes in the model data structures are assigned unique identifiers. Paths traversed through the model data structures are assigned unique identifiers. The paths are counted in order to identify paths through the data structure model that are traversed frequently. The model is useful for providing information about high frequency data paths to the program developer and for various optimization purposes, such as prefetching and or increasing data locality during garbage collection.
摘要翻译：所描述的技术提供了数据结构路径分析。创建了一个程序的检测版本，当通过指针分配或访问基于指针的数据结构时，调用分析器运行时。创建堆的模型，并为模型数据结构中的节点分配唯一的标识符。遍历模型数据结构的路径被分配唯一的标识符。对路径进行计数，以便识别经过数据结构模型的路径。该模型对于向程序开发人员提供关于高频数据路径的信息以及各种优化目的是有用的，例如在垃圾收集期间预取和/或增加数据局部性。

5. 发明授权

US08079020B2 Preferential path profiling 有权
标题翻译：优惠路径剖析
公开(公告)号：US08079020B2
公开(公告)日：2011-12-13
申请号：US11682196
申请日：2007-03-05
申请人： Trishul Amit Madhukar Chilimbi , Kapil Vaswani , Aditya Vithal Nori
发明人： Trishul Amit Madhukar Chilimbi , Kapil Vaswani , Aditya Vithal Nori
IPC分类号： G06F9/44
CPC分类号： G06F11/3471 , G06F11/3447 , G06F2201/88
摘要： This paper describes preferential path profiling, which enables profiling a specified subset of all possible program paths with very low overhead. Preferential path profiling compactly identifies paths of interest using an array. More specifically, PPP assigns a unique and compact path index identifier to all interesting paths that can be used to index into a path array. The path array contains a second path value identifier that is used to distinguish interesting paths from other program paths This path numbering allows the implementation of preferential path profiling to use array-based counters instead of hash table-based counters for identifying paths of interest and gathering path profiles, which significantly reduces execution time and computational resource overhead during profiling.
摘要翻译：本文介绍了优化路径分析，可以以非常低的开销对所有可能的程序路径进行分析。优先路径分析使用数组紧凑地标识感兴趣的路径。更具体地说，PPP为可用于索引到路径阵列的所有有趣的路径分配唯一且紧凑的路径索引标识符。路径数组包含第二个路径值标识符，用于区分有趣的路径与其他程序路径此路径编号允许实施优先路径分析以使用基于数组的计数器而不是基于哈希表的计数器来识别感兴趣的路径和收集路径配置文件，在分析期间显着减少了执行时间和计算资源开销。

6. 发明授权

US07941616B2 System to reduce interference in concurrent programs 有权
标题翻译：减少并发程序干扰的系统
公开(公告)号：US07941616B2
公开(公告)日：2011-05-10
申请号：US12255354
申请日：2008-10-21
申请人： Sriram Rajamani , Ganesan Ramalingam , Venkatesh-Prasad Ranganath , Kapil Vaswani
发明人： Sriram Rajamani , Ganesan Ramalingam , Venkatesh-Prasad Ranganath , Kapil Vaswani
IPC分类号： G06F12/00 , G06F13/00 , G06F13/28
CPC分类号： G06F12/145 , G06F9/526
摘要： Locks are used to protect variables. All variables protected by a lock are allocated on a page associated with a lock. When a thread (called the owner) acquires the lock, a local copy of the memory page containing the variable is created, the original memory page is protected, and all access of the variable in the owner thread is directed to the local copy. Upon releasing the lock, the changes from the local copy are carried over to the memory page and the memory page is unprotected. Any concurrent access of the variable by non-owner threads triggers an exception handler (due to the protection mechanism) and delays such an access until after the owner thread has finished accessing the variable.
摘要翻译：锁用于保护变量。由锁保护的所有变量都将分配到与锁相关联的页面上。当一个线程（称为所有者）获取锁定时，将创建包含该变量的内存页面的本地副本，原始内存页面将受到保护，并且所有者线程中的变量的所有访问都将定向到本地副本。释放锁定后，本地副本的更改将转移到内存页，而内存页不受保护。非所有者线程的任何并发访问的变量触发异常处理程序（由于保护机制），并延迟访问权限，直到所有者线程完成对该变量的访问。

7. 发明申请

US20080222614A1 PREFERENTIAL PATH PROFILING 有权
标题翻译：优先路径分布
公开(公告)号：US20080222614A1
公开(公告)日：2008-09-11
申请号：US11682196
申请日：2007-03-05
申请人： Trishul Amit Madhukar Chilimbi , Kapil Vaswani , Aditya Vithal Nori
发明人： Trishul Amit Madhukar Chilimbi , Kapil Vaswani , Aditya Vithal Nori
IPC分类号： G06F9/44
CPC分类号： G06F11/3471 , G06F11/3447 , G06F2201/88
摘要： This paper describes preferential path profiling, which enables profiling a specified subset of all possible program paths with very low overhead. Preferential path profiling compactly identifies paths of interest using an array. More specifically, PPP assigns a unique and compact path index identifier to all interesting paths that can be used to index into a path array. The path array contains a second path value identifier that is used to distinguish interesting paths from other program paths This path numbering allows the implementation of preferential path profiling to use array-based counters instead of hash table-based counters for identifying paths of interest and gathering path profiles, which significantly reduces execution time and computational resource overhead during profiling.
摘要翻译：本文介绍了优化路径分析，可以以非常低的开销对所有可能的程序路径进行分析。优先路径分析使用数组紧凑地标识感兴趣的路径。更具体地说，PPP为可用于索引到路径阵列的所有有趣的路径分配唯一且紧凑的路径索引标识符。路径数组包含第二个路径值标识符，用于区分有趣的路径与其他程序路径此路径编号允许实施优先路径分析以使用基于数组的计数器而不是基于哈希表的计数器来识别感兴趣的路径和收集路径配置文件，在分析期间显着减少了执行时间和计算资源开销。

8. 发明申请

US20100169618A1 IDENTIFYING CONCURRENCY CONTROL FROM A SEQUENTIAL PROOF 审中-公开
标题翻译：从序列证明中识别同义词控制
公开(公告)号：US20100169618A1
公开(公告)日：2010-07-01
申请号：US12345857
申请日：2008-12-30
申请人： Ganesan Ramalingam , Sriram Rajamani , Venkatesh-Prasad Ranganath , Kapil Vaswani , Jyotirmoy Vinay Deshmukh
发明人： Ganesan Ramalingam , Sriram Rajamani , Venkatesh-Prasad Ranganath , Kapil Vaswani , Jyotirmoy Vinay Deshmukh
IPC分类号： G06F9/44
CPC分类号： G06F8/456
摘要： The claimed subject matter provides a system and/or a method that facilitates ensuring non-interference between multiple threads that access a shared resource. An interface can receive a portion of sequential code, wherein the portion of sequential code includes a property that is maintained and relied upon when invoked and executed by a sequential client. A synthesizer component can leverage a sequential proof related to the portion of sequential code in order to derive a concurrency control mechanism for a portion of concurrency code that maintains the property when invoked by a concurrent client, wherein the sequential proof identifies a concurrent interference at an execution point that is tolerable for the concurrent client.
摘要翻译：所要求保护的主题提供了一种有助于确保访问共享资源的多个线程之间的不干扰的系统和/或方法。接口可以接收一部分顺序代码，其中顺序代码的部分包括当由顺序客户机调用并执行时维护和依赖的属性。合成器组件可以利用与序列代码部分相关的顺序证明，以便为由并发客户机调用时维护该属性的并行代码的一部分导出并发控制机制，其中该顺序证明标识在对于并发客户端是可以容忍的执行点。

9. 发明申请

US20100100690A1 SYSTEM TO REDUCE INTERFERENCE IN CONCURRENT PROGRAMS 有权
标题翻译：降低同步程序干扰的系统
公开(公告)号：US20100100690A1
公开(公告)日：2010-04-22
申请号：US12255354
申请日：2008-10-21
申请人： Sriram Rajamani , Ganesan Ramalingam , Venkatesh-Prasad Ranganath , Kapil Vaswani
发明人： Sriram Rajamani , Ganesan Ramalingam , Venkatesh-Prasad Ranganath , Kapil Vaswani
IPC分类号： G06F12/00
CPC分类号： G06F12/145 , G06F9/526
摘要： Locks are used to protect variables. All variables protected by a lock are allocated on a page associated with a lock. When a thread (called the owner) acquires the lock, a local copy of the memory page containing the variable is created, the original memory page is protected, and all access of the variable in the owner thread is directed to the local copy. Upon releasing the lock, the changes from the local copy are carried over to the memory page and the memory page is unprotected. Any concurrent access of the variable by non-owner threads triggers an exception handler (due to the protection mechanism) and delays such an access until after the owner thread has finished accessing the variable.
摘要翻译：锁用于保护变量。由锁保护的所有变量都将分配到与锁相关联的页面上。当一个线程（称为所有者）获取锁定时，将创建包含该变量的内存页面的本地副本，原始内存页面将受到保护，并且所有者线程中的变量的所有访问都将定向到本地副本。释放锁定后，本地副本的更改将转移到内存页，而内存页不受保护。非所有者线程的任何并发访问的变量触发异常处理程序（由于保护机制），并延迟访问权限，直到所有者线程完成对该变量的访问。

10. 发明申请

US20110087700A1 ABSTRACTING EVENTS FOR DATA MINING 有权
标题翻译：摘要数据采矿活动
公开(公告)号：US20110087700A1
公开(公告)日：2011-04-14
申请号：US12578603
申请日：2009-10-14
申请人： David Lo , Ganesan Ramalingam , Venkatesh-Prasad Ranganath , Kapil Vaswani
发明人： David Lo , Ganesan Ramalingam , Venkatesh-Prasad Ranganath , Kapil Vaswani
IPC分类号： G06F17/30
CPC分类号： G06F17/30539
摘要： An event is described herein as being representable by a quantified abstraction of the event. The event includes at least one predicate, and the at least one predicate has at least one constant symbol corresponding thereto. An instance of the constant symbol corresponding to the event is identified, and the instance of the constant symbol is replaced by a free variable to obtain an abstracted predicate. Thus, a quantified abstraction of the event is composed as a pair: the abstracted predicate and a mapping between the free variable and an instance of the constant symbol that corresponds to the predicate. A data mining algorithm is executed over abstracted, quantified events to ascertain a correlation between the event and another event.
摘要翻译：这里描述的事件可以通过事件的量化抽象来表示。所述事件包括至少一个谓词，并且所述至少一个谓词具有与之对应的至少一个常数符号。识别与事件对应的常量符号的实例，并且常量符号的实例由可用变量替换以获得抽象谓词。因此，事件的量化抽象由一对组成：抽象谓词和自由变量与对应于谓词的常量符号的实例之间的映射。在抽象的量化事件上执行数据挖掘算法，以确定事件与另一事件之间的相关性。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式