公开(公告)号：US08464221B2

公开(公告)日：2013-06-11

申请号：US12485726

申请日：2009-06-16

申请人： Alice X. Zheng ,  Trishul A Chilimbi ,  Shuo-Hsien Hsiao ,  Danyel A. Fisher ,  David M. Andrzejewski

发明人： Alice X. Zheng ,  Trishul A Chilimbi ,  Shuo-Hsien Hsiao ,  Danyel A. Fisher ,  David M. Andrzejewski

IPC分类号： G06F9/44

CPC分类号： G06F11/3664

摘要： A system and method for identifying a root cause of a wait in a computer system are provided. Given the identity of a thread of interest and time window, a longest wait period for the thread of interest within the time window is identified. The longest wait period is used as a starting node to generate a ready tree by walking backwards through the data in a system trace to construct a tree of readying events that ready threads for running on a processor. A potentially anomalous chain of events is automatically identified and highlighted in the ready tree. A visualization of the ready tree is presented to a user so that the user can explore the events in the tree and annotate the automatically generated tree to aid in problem diagnosis.

摘要翻译： 提供了一种用于在计算机系统中识别等待的根本原因的系统和方法。 给定兴趣线程和时间窗口的身份，识别在时间窗口内的兴趣线程的最长等待时间段。 最长的等待周期用作起始节点，以便通过向后走向系统跟踪中的数据来生成就绪树，以构建准备好的事件树，以准备在处理器上运行的线程。 在可用树中自动识别并突出显示一个潜在的异常链接事件。 将可用树的可视化呈现给用户，以便用户可以浏览树中的事件并注释自动生成的树以帮助进行问题诊断。

公开(公告)号：US07577943B2

公开(公告)日：2009-08-18

申请号：US10892260

申请日：2004-07-15

申请人： Trishul A Chilimbi ,  Matthias M Hauswirth

发明人： Trishul A Chilimbi ,  Matthias M Hauswirth

IPC分类号： G06F9/44 ,  G06F13/00

CPC分类号： G06F11/366 ,  G06F8/30 ,  G06F9/44 ,  G06F11/3636 ,  G06F11/3644

摘要： A method of detecting memory leaks. The method of detecting memory leaks comprises, adaptively bursty tracing a program execution to track accesses to heap objects with low overhead and using this information identify stale heap objects, which are reported as leaks.

摘要翻译： 检测内存泄漏的方法。 检测内存泄漏的方法包括自适应地突发性地跟踪程序执行以跟踪对具有低开销的堆对象的访问，并且使用该信息来标识被报告为泄漏的过期堆对象。

公开(公告)号：US08397221B2

公开(公告)日：2013-03-12

申请号：US12247034

申请日：2008-10-07

申请人： Sumit Gulwani ,  Krishna Kumar Mehra ,  Trishul A Chilimbi

发明人： Sumit Gulwani ,  Krishna Kumar Mehra ,  Trishul A Chilimbi

IPC分类号： G06F9/44 ,  G06F9/45

CPC分类号： G06F8/452 ,  G06F9/44589 ,  G06F11/3644

摘要： Bounding resource consumption of code that processes recursive data structures and collections includes making use of quantitative functions (based on user input) that are associated with a tuple of data-structures and whose semantics is specified by describing the effect of various data-structure methods on the relevant quantitative functions. Counter variables are incorporated into source code to count loop iterations (and number of recursive procedure call invocations). Relevant quantitative functions are incorporated into the source code to allow computation of invariants (and hence bounds) on the incorporated counter variables in terms of the quantitative functions.

摘要翻译： 处理递归数据结构和集合的代码的边界资源消耗包括利用与数据结构的元组相关联的定量函数（基于用户输入），并且通过描述各种数据结构方法对其语义的影响来指定其语义 相关定量功能。 计数器变量被并入到源代码中以对循环迭代进行计数（和递归过程调用调用的次数）。 相关的定量函数被并入到源代码中，以允许根据定量函数计算所引入的计数器变量上的不变量（和因此的边界）。

公开(公告)号：US08266598B2

公开(公告)日：2012-09-11

申请号：US12115435

申请日：2008-05-05

申请人： Sumit Gulwani ,  Krishna Kumar Mehra ,  Trishul A Chilimbi

发明人： Sumit Gulwani ,  Krishna Kumar Mehra ,  Trishul A Chilimbi

IPC分类号： G06F9/44

CPC分类号： G06F11/3608 ,  G06F9/44589

摘要： Bounding resource consumption of code using abstract interpretation includes a static analysis to estimate a code's resource consumption in terms of units of resources utilized at any point during execution, expressed as a function of its scalar inputs. An instrumentation mechanism and an abstract interpretation mechanism are employed to compute bounds on the code resource consumption. The instrumentation mechanism includes incorporating one or more counter variables in the source code to count the number of loop iterations and recursive procedure call invocations. The abstract interpretation mechanism includes computing invariants on the instrumented counter variables and scalar program variables to obtain bounds on the number of loop iterations and recursive procedure call invocations, which are then composed together to obtain resource bounds for the entire program.

摘要翻译： 使用抽象解释来限制代码的资源消耗包括静态分析，以执行期间的任何时间点使用的资源单位来估计代码的资源消耗，以其标量输入的函数表示。 采用仪器机制和抽象解释机制来计算代码资源消耗的边界。 仪器机制包括在源代码中并入一个或多个计数器变量以对循环迭代次数和递归过程调用调用进行计数。 抽象解释机制包括在仪表化计数器变量和标量程序变量上计算不变量，以获得循环迭代次数和递归过程调用调用的边界，然后将它们组合在一起以获得整个程序的资源范围。