-
公开(公告)号：US07788637B2
公开(公告)日：2010-08-31
申请号：US11118690
申请日：2005-04-29
申请人： Galen C. Hunt , James R. Larus , John D. DeTreville , Edward P Wobber , Martin Abadi , Michael B. Jones , Trishul A. Chilimbi
发明人： Galen C. Hunt , James R. Larus , John D. DeTreville , Edward P Wobber , Martin Abadi , Michael B. Jones , Trishul A. Chilimbi
IPC分类号： G06F9/44
CPC分类号： G06F21/562 , G06F21/566 , G06F21/57
摘要： Described herein is an implementation of a technology for the construction, identification, and/or optimization of operating-system processes. At least one implementation, described herein, constructs an operating-system process having the contents as defined by a process manifest. Once constructed, the operating-system process is unalterable.
摘要翻译： 这里描述了用于构建，识别和/或优化操作系统过程的技术的实现。 这里描述的至少一个实现构造具有由过程清单定义的内容的操作系统过程。 一旦构建，操作系统过程是不可改变的。
-
公开(公告)号：US07694300B2
公开(公告)日：2010-04-06
申请号：US11118684
申请日：2005-04-29
IPC分类号： G06F9/46
CPC分类号： G06F21/562 , G06F21/566 , G06F21/57
摘要： Described herein is an implementation of a technology for the construction, identification, and/or optimization of operating-system processes. At least one implementation, described herein, constructs an operating-system process having the contents as defined by a process manifest. Once constructed, the operating-system process is unalterable.
摘要翻译： 这里描述了用于构建，识别和/或优化操作系统过程的技术的实现。 这里描述的至少一个实现构造具有由过程清单定义的内容的操作系统过程。 一旦构建，操作系统过程是不可改变的。
-
公开(公告)号：US09329876B2
公开(公告)日：2016-05-03
申请号：US12468869
申请日：2009-05-20
申请人： Trishul A. Chilimbi , Woongki Baek
发明人： Trishul A. Chilimbi , Woongki Baek
CPC分类号： G06F9/44536 , G06F11/3409
摘要： The described implementations relate to resource aware programming. In one case a program is obtained that is configured to perform a task in accordance with one or more quantitative metrics. An approximate version can be generated from the program. The approximate version is configured to perform the task in a manner that satisfies the one or more quantitative metrics while using fewer computer resources than the program.
摘要翻译： 所描述的实现涉及资源感知编程。 在一种情况下，获得被配置为根据一个或多个定量度量执行任务的程序。 可以从程序中生成一个近似版本。 大致版本被配置为以满足一个或多个定量度量的方式执行任务，同时使用比该程序更少的计算机资源。
-
公开(公告)号：US20090276763A1
公开(公告)日：2009-11-05
申请号：US12115435
申请日：2008-05-05
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.
摘要翻译： 使用抽象解释来限制代码的资源消耗包括静态分析，以执行期间的任何时间点使用的资源单位来估计代码的资源消耗，以其标量输入的函数表示。 采用仪器机制和抽象解释机制来计算代码资源消耗的边界。 仪器机制包括在源代码中并入一个或多个计数器变量以对循环迭代次数和递归过程调用调用进行计数。 抽象解释机制包括在仪表化计数器变量和标量程序变量上计算不变量，以获得循环迭代次数和递归过程调用调用的界限，然后将其组合在一起以获得整个程序的资源限制。
-
公开(公告)号：US08914781B2
公开(公告)日：2014-12-16
申请号：US12258239
申请日：2008-10-24
申请人： Trishul A. Chilimbi , Chen Ding
发明人： Trishul A. Chilimbi , Chen Ding
CPC分类号： G06F11/3447 , G06F8/4441 , G06F11/3404 , G06F12/0842 , G06F2201/885
摘要： Described is predicting cache locality in a multicore/multithreaded processing environment including when threads share cache data in a non-uniform interleaving manner. Thread execution traces are analyzed to compute a set of per-thread parameters that can then be used to predict cache miss rates for other cache sizes. In one aspect, a model is based upon a probability that the cache reuse distance will increase because of accesses by other threads, and another probability that the reuse distance will decrease because of intercept accesses by other threads to shared data blocks. Estimates of the number of shared data blocks, possibly shared data blocks and private data blocks are used in the computations.
摘要翻译： 描述了在多核/多线程处理环境中预测高速缓存位置，包括当线程以非均匀交织方式共享高速缓存数据时。 分析线程执行跟踪，以计算一组每线程参数，然后可以将其用于预测其他高速缓存大小的高速缓存未命中率。 在一个方面，模型基于高速缓存重用距离将由于其他线程的访问而增加的概率，以及由于其他线程对共享数据块的截取访问而使重用距离将减小的概率。 在计算中使用共享数据块的数量，可能的共享数据块和专用数据块的估计。
-
6.发明申请Calculating Resource Bounds Of Programs Manipulating Recursive Data Structures And Collections 有权计算处理递归数据结构和集合的程序的资源边界公开(公告)号：US20100088684A1
公开(公告)日：2010-04-08
申请号：US12247034
申请日：2008-10-07
IPC分类号： 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.
摘要翻译： 处理递归数据结构和集合的代码的边界资源消耗包括利用与数据结构的元组相关联的定量函数（基于用户输入），并且通过描述各种数据结构方法对其语义的影响来指定其语义 相关定量功能。 计数器变量被并入到源代码中以对循环迭代进行计数（和递归过程调用调用的次数）。 相关的定量函数被并入到源代码中，以允许根据定量函数计算所引入的计数器变量上的不变量（和因此的边界）。
-
公开(公告)号：US08959442B2
公开(公告)日：2015-02-17
申请号：US12814194
申请日：2010-06-11
CPC分类号： G06F11/3636 , G06F11/323 , G06F11/3476
摘要： A “Memory Allocation Visualizer” provides a dynamic visualization that animates memory allocation event trace information over a time period of execution of a program. Consequently, the Memory Allocation Visualizer provides a visualization and understanding of a program's memory system behavior. Various modes of display with custom color mappings and zooming allow the user to see how heaps are used over time (e.g., by allocation type, age, size, thread id, etc.). Custom displays also allow the user to detect potential memory leaks and fragmentation problems. Composable filters enable the user to focus on specific issues. Various techniques are used to enable processing of a very large numbers of trace events while enabling rapid response to visualization view changes.
摘要翻译： “内存分配可视化程序”提供动态可视化，可在程序执行的时间段内动画化内存分配事件跟踪信息。 因此，内存分配可视化程序提供了对程序的内存系统行为的可视化和理解。 具有自定义颜色映射和缩放的各种显示模式允许用户看到随着时间的推移如何使用堆（例如，通过分配类型，年龄，大小，线程ID等）。 自定义显示还允许用户检测潜在的内存泄漏和碎片问题。 可组合的过滤器使用户能够专注于具体问题。 使用各种技术来处理非常大量的跟踪事件，同时能够对可视化视图更改进行快速响应。
-
公开(公告)号：US20110307828A1
公开(公告)日：2011-12-15
申请号：US12814194
申请日：2010-06-11
IPC分类号： G06F3/048
CPC分类号： G06F11/3636 , G06F11/323 , G06F11/3476
摘要： A “Memory Allocation Visualizer” provides a dynamic visualization that animates memory allocation event trace information over a time period of execution of a program. Consequently, the Memory Allocation Visualizer provides a visualization and understanding of a program's memory system behavior. Various modes of display with custom color mappings and zooming allow the user to see how heaps are used over time (e.g., by allocation type, age, size, thread id, etc.). Custom displays also allow the user to detect potential memory leaks and fragmentation problems. Composable filters enable the user to focus on specific issues. Various techniques are used to enable processing of a very large numbers of trace events while enabling rapid response to visualization view changes.
摘要翻译： “内存分配可视化程序”提供动态可视化，可在程序执行的时间段内动画化内存分配事件跟踪信息。 因此，内存分配可视化程序提供了对程序的内存系统行为的可视化和理解。 具有自定义颜色映射和缩放的各种显示模式允许用户看到随着时间的推移如何使用堆（例如，通过分配类型，年龄，大小，线程ID等）。 自定义显示还允许用户检测潜在的内存泄漏和碎片问题。 可组合的过滤器使用户能够专注于具体问题。 使用各种技术来处理非常大量的跟踪事件，同时能够对可视化视图更改进行快速响应。
-
公开(公告)号：US20100318852A1
公开(公告)日：2010-12-16
申请号：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分类号： G06F11/32
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.
摘要翻译： 提供了一种用于在计算机系统中识别等待的根本原因的系统和方法。 给定兴趣线程和时间窗口的身份，识别在时间窗口内的兴趣线程的最长等待时间段。 最长的等待周期用作起始节点，以便通过向后走向系统跟踪中的数据来生成就绪树，以构建准备好的事件树，以准备在处理器上运行的线程。 在可用树中自动识别并突出显示一个潜在的异常链接事件。 将可用树的可视化呈现给用户，以便用户可以浏览树中的事件并注释自动生成的树以帮助进行问题诊断。
-
公开(公告)号：US20100299662A1
公开(公告)日：2010-11-25
申请号：US12468869
申请日：2009-05-20
申请人： Trishul A. Chilimbi , Woongki Baek
发明人： Trishul A. Chilimbi , Woongki Baek
IPC分类号： G06F9/44
CPC分类号： G06F9/44536 , G06F11/3409
摘要： The described implementations relate to resource aware programming. In one case a program is obtained that is configured to perform a task in accordance with one or more quantitative metrics. An approximate version can be generated from the program. The approximate version is configured to perform the task in a manner that satisfies the one or more quantitative metrics while using fewer computer resources than the program.
摘要翻译： 所描述的实现涉及资源感知编程。 在一种情况下，获得被配置为根据一个或多个定量度量执行任务的程序。 可以从程序中生成一个近似版本。 大致版本被配置为以满足一个或多个定量度量的方式执行任务，同时使用比该程序更少的计算机资源。
-
-
-
-
-
-
-
-
-
搜索结果
12 条记录 (耗时 0.034 秒)
