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

1. 发明授权

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为可用于索引到路径阵列的所有有趣的路径分配唯一且紧凑的路径索引标识符。路径数组包含第二个路径值标识符，用于区分有趣的路径与其他程序路径此路径编号允许实施优先路径分析以使用基于数组的计数器而不是基于哈希表的计数器来识别感兴趣的路径和收集路径配置文件，在分析期间显着减少了执行时间和计算资源开销。

2. 发明申请

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为可用于索引到路径阵列的所有有趣的路径分配唯一且紧凑的路径索引标识符。路径数组包含第二个路径值标识符，用于区分有趣的路径与其他程序路径此路径编号允许实施优先路径分析以使用基于数组的计数器而不是基于哈希表的计数器来识别感兴趣的路径和收集路径配置文件，在分析期间显着减少了执行时间和计算资源开销。

3. 发明申请

US20080276025A1 LOCK INFERENCE FOR ATOMIC SECTIONS 有权
标题翻译：原子部分的锁定
公开(公告)号：US20080276025A1
公开(公告)日：2008-11-06
申请号：US11744642
申请日：2007-05-04
申请人： Sigmund Isy Cherem , Trishul Amit Madhukar Chilimbi , Sumit Gulwani
发明人： Sigmund Isy Cherem , Trishul Amit Madhukar Chilimbi , Sumit Gulwani
IPC分类号： G06F12/14
CPC分类号： G06F9/524
摘要： Locks which protect data structures used within atomic sections of concurrent programs are inferred from atomic sections and acquired in a manner to avoid deadlock. Locks may be inferred by expression correspondence using a backward inter-procedural analysis of an atomic section. Locks may be sorted according to a total order and acquired early in an atomic section to prevent deadlock. Multiple granularity of locks are determined and employed. Fine grained locks may be inferred and acquired to reduce contention. Coarse grained locks may be determined and substituted for fine grained locks when necessary for unbounded locations or to reduce the number of finer grained locks.
摘要翻译：保护在并发程序的原子部分中使用的数据结构的锁定是从原子部分推断的，并以避免死锁的方式获取。锁定可以通过使用原子部分的后向过程间分析的表达式对应来推断。锁可以根据总顺序进行排序，并在原子部分早期获取，以防止死锁。确定并采用多个锁定粒度。可以推断和获取细粒度的锁以减少争用。可以确定粗粒度锁，并在必要时替代未加工位置的精细锁，或者减少更细粒度的锁的数量。

4. 发明授权

US08060880B2 System using backward inter-procedural analysis for determining alternative coarser grained lock when finer grained locks exceeding threshold 有权
标题翻译：使用后向程序间分析的系统，用于在更细粒度锁超过阈值时确定替代粗粒度锁定
公开(公告)号：US08060880B2
公开(公告)日：2011-11-15
申请号：US11744642
申请日：2007-05-04
申请人： Sigmund Isy Cherem , Trishul Amit Madhukar Chilimbi , Sumit Gulwani
发明人： Sigmund Isy Cherem , Trishul Amit Madhukar Chilimbi , Sumit Gulwani
IPC分类号： G06F12/14 , G06F9/46 , G06F12/00 , G06F17/50
CPC分类号： G06F9/524
摘要： Locks which protect data structures used within atomic sections of concurrent programs are inferred from atomic sections and acquired in a manner to avoid deadlock. Locks may be inferred by expression correspondence using a backward inter-procedural analysis of an atomic section. Locks may be sorted according to a total order and acquired early in an atomic section to prevent deadlock. Multiple granularity of locks are determined and employed. Fine grained locks may be inferred and acquired to reduce contention. Coarse grained locks may be determined and substituted for fine grained locks when necessary for unbounded locations or to reduce the number of finer grained locks.
摘要翻译：保护在并发程序的原子部分中使用的数据结构的锁定是从原子部分推断的，并以避免死锁的方式获取。锁定可以通过使用原子部分的后向过程间分析的表达式对应来推断。锁可以根据总顺序进行排序，并在原子部分早期获取，以防止死锁。确定并采用多个锁定粒度。可以推断和获取细粒度的锁以减少争用。可以确定粗粒度锁，并在必要时替代未加工位置的精细锁，或者减少更细粒度的锁的数量。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式