会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 31. 发明申请
    • COMPUTER-IMPLEMENTED METHOD, SYSTEM, AND PROGRAM PRODUCT FOR OPTIMIZING A DISTRIBUTED APPLICATION
    • 用于优化分布式应用的计算机实现方法,系统和程序产品
    • US20080271004A1
    • 2008-10-30
    • US12167258
    • 2008-07-03
    • Jong-Deok ChoiManish GuptaParviz KermaniKang-Won LeeKyung Dong RyuDinesh C. VermaPeng Wu
    • Jong-Deok ChoiManish GuptaParviz KermaniKang-Won LeeKyung Dong RyuDinesh C. VermaPeng Wu
    • G06F9/45G06F9/44
    • G06F8/61
    • A computer-implemented method, system, and program product for optimizing a distributed (software) application are provided. Specifically, a configuration of a target computing environment, in which the distributed application is deployed, is discovered upon deployment of the distributed application. Thereafter, based on a set of rules and the discovered configuration, one or more optimization techniques are applied to optimize the distributed application. In a typical embodiment, the set of rules can be embedded in the distributed application, or they can be accessed from an external source such as a repository. Regardless, the optimization techniques applied can include at least one of the following: (1) identification and replacement of an underperforming component of the distributed application with a new component; (2) generation of interface layers (to allow selection of optimal bindings) between distributed objects of the distributed application; and/or (3) execution of code transformation of the distributed application using program analysis techniques.
    • 提供了一种用于优化分布式(软件)应用程序的计算机实现的方法,系统和程序产品。 具体而言,在部署分布式应用程序时发现其中部署了分布式应用的目标计算环境的配置。 此后,基于一组规则和所发现的配置,应用一个或多个优化技术来优化分布式应用。 在典型的实施例中,该组规则可以嵌入在分布式应用中,或者可以从诸如存储库的外部源访问它们。 无论如何,应用的优化技术可以包括以下至少一个:(1)用新的组件识别和替换分布式应用程序的表现不佳的组件; (2)在分布式应用程序的分布式对象之间生成界面层(允许选择最佳绑定); 和/或(3)使用程序分析技术执行分布式应用程序的代码转换。
    • 33. 发明授权
    • Deterministic replay of multithreaded applications
    • 多线程应用程序的确定性重播
    • US6101524A
    • 2000-08-08
    • US956717
    • 1997-10-23
    • Jong-Deok ChoiHarini Srinivasan
    • Jong-Deok ChoiHarini Srinivasan
    • G06F9/46G06F9/48G06F9/00G06F9/45
    • G06F9/4881G06F9/52
    • A multithreaded program includes sequences of events wherein each sequence is associated with one of a plurality of execution threads. In a record mode, the software tool of the present invention records a run-time representation of the program by distinguishing critical events from non-critical events of the program and identifying the execution order of such critical events. Groups of critical events are generated wherein, for each group G.sub.i, critical events belonging to the group G.sub.i belong to a common execution thread, critical events belonging to the group G.sub.i are consecutive, and only non-critical events occur between any two consecutive critical events in the group G.sub.i. In addition, the groups are ordered and no two adjacent groups include critical events that belong to a common execution thread. For each execution thread, a logical thread schedule is generated that identifies a sequence of said groups associated with the execution thread. The logical thread schedules are stored in persistent storage for subsequent reuse. In a replay mode, for each execution thread, the logical thread schedule associated with the execution thread is loaded from persistent storage and the critical events identified by the logical thread schedule are executed.
    • 多线程程序包括事件序列,其中每个序列与多个执行线程之一相关联。 在记录模式中,本发明的软件工具通过区分程序的关键事件和非关键事件并识别这些关键事件的执行顺序来记录程序的运行时表示。 生成关键事件组,其中,对于每个组Gi,属于组Gi的关键事件属于公共执行线程,属于组Gi的关键事件是连续的,并且在任何两个连续关键事件之间仅发生非关键事件 在组Gi。 此外,组是有序的,并且没有两个相邻组包括属于公共执行线程的关键事件。 对于每个执行线程,生成逻辑线程调度,以标识与执行线程相关联的所述组的序列。 逻辑线程调度存储在持久存储器中以供后续重用。 在重播模式中,对于每个执行线程,与执行线程相关联的逻辑线程调度从持久存储器加载,并且执行由逻辑线程调度所标识的关键事件。
    • 34. 发明授权
    • Using program call graphs to determine the maximum fixed point solution
of interprocedural bidirectional data flow problems in a compiler
    • 使用程序调用图来确定编译器中过程间双向数据流问题的最大定点解
    • US5485616A
    • 1996-01-16
    • US135199
    • 1993-10-12
    • Michael G. BurkePaul R. CariniJong-Deok Choi
    • Michael G. BurkePaul R. CariniJong-Deok Choi
    • G06F9/45G06F9/44
    • G06F8/433G06F8/434
    • By novel use of the Program Call Graph representation of computer programs, this method and apparatus provides a general analysis method for interprocedural bidirection data flow problems in computer software programs. The invention has many uses, including the determination of interprocedural alias analysis of computer software programs which contain pointers.The method starts by constructing a Program Call Graph representation of a computer program with each node of the graph representing a routine of the program. An internal representation of each node is then constructed and initial interprocedural values are associated with appropriate nodes. An interprocedural traversal of the Program Call Graph is performed in which each node is visited; an intraprocedural propagation is performed to develop a new set of interim solution values; and the new interim solution values are interprocedurally propagated. The new interim solution is propagated in a forward and backward direction in one pass of the traversal. The interprocedural traversal of the Program Call Graph is repeated until the interprocedural solution does not change.
    • 通过小说使用计算机程序的程序调用图表示,该方法和装置为计算机软件程序中的过程间双向数据流问题提供了一种通用的分析方法。 本发明具有许多用途,包括确定包含指针的计算机软件程序的过程间别名分析。 该方法通过构建计算机程序的程序调用图表示开始,其中每个图形节点表示程序的例程。 然后构建每个节点的内部表示,并将初始过程值与适当的节点相关联。 执行程序调用图的跨过程遍历,其中每个节点被访问; 进行一个进程内传播以开发一套新的临时解决方案值; 新的临时解决方案值被跨过程传播。 新的临时解决方案在遍历的一个遍中向前和向后的方向传播。 程序调用图的过程间遍历将重复,直到过程间解决方案不会改变。
    • 37. 发明申请
    • Checkpointed Tag Prefetcher
    • 检查点标签预取器
    • US20120303857A1
    • 2012-11-29
    • US13564829
    • 2012-08-02
    • Harold Wade Cain, IIIJong-Deok Choi
    • Harold Wade Cain, IIIJong-Deok Choi
    • G06F12/08
    • G06F12/0862G06F2212/6024
    • A cache management method using checkpoint tags in checkpoint mode includes steps of: receiving a request to save data; fetching at least one cache block including the data from cache memory; writing the data from the at least one cache block into the data array; writing a physical address and metadata of the cache block into an array of cache memory tags; and upon receipt of a restore request: fetching an identifier for the at least one cache block stored in the checkpoint tag array; reloading the cache memory with the at least one cache block in the checkpoint tag array; and switching to normal mode.
    • 在检查点模式中使用检查点标签的高速缓存管理方法包括以下步骤:接收保存数据的请求; 从高速缓冲存储器中取出包含数据的至少一个缓存块; 将来自所述至少一个高速缓存块的数据写入所述数据阵列; 将高速缓存块的物理地址和元数据写入高速缓存存储器标签阵列; 并且在接收到恢复请求时:获取存储在所述检查点标签阵列中的所述至少一个高速缓存块的标识符; 使用所述检查点标签阵列中的所述至少一个高速缓存块重新加载所述高速缓冲存储器; 并切换到正常模式。