会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 51. 发明申请
    • MANAGEMENT OF DATA AND COMPUTATION IN DATA CENTERS
    • 数据中心的数据管理和计算
    • US20110072006A1
    • 2011-03-24
    • US12562156
    • 2009-09-18
    • Yuan YuPradeep Kumar GundaLi Zhuang
    • Yuan YuPradeep Kumar GundaLi Zhuang
    • G06F17/30
    • G06F17/30545G06F17/30451
    • Data and computation may be unified (i.e., integrated) in a data center using a single query interface. Users may interact with the data center via a query interface to provide a query (i.e., a computation) to the data center. The results of the query may be referred to as derived datasets and may be managed by a cache server. In an implementation, a derived dataset is uniquely referenced by the query that computes it. Shared common computations are computed only once and may be reused by other computations. The result of a query may be computed (if not previously cached) and returned to the user. Infrequently used derived datasets may be garbage collected (e.g., deleted or otherwise removed from storage) by a garbage collector. This integration of data and computation provides efficient resource management for data center.
    • 数据和计算可以使用单个查询接口统一(即集成)在数据中心中。 用户可以经由查询界面与数据中心进行交互,以向数据中心提供查询(即计算)。 查询的结果可以被称为派生数据集,并且可以由缓存服务器管理。 在一个实现中,派生数据集由计算它的查询唯一引用。 共享公共计算仅计算一次,并可能被其他计算重用。 可以计算查询的结果(如果不是先前缓存)并返回给用户。 不经常使用的派生数据集可能被垃圾收集器垃圾收集(例如,删除或以其他方式从存储中移除)。 这种数据和计算的集成为数据中心提供了有效的资源管理。
    • 54. 发明申请
    • AUTOMATIC AND SYSTEMATIC DETECTION OF RACE CONDITIONS AND ATOMICITY VIOLATIONS
    • 自动和系统的检测条件和原子侵害
    • US20080109641A1
    • 2008-05-08
    • US11557252
    • 2006-11-07
    • Thomas J. BallYuan YuShuvendu K. Lahiri
    • Thomas J. BallYuan YuShuvendu K. Lahiri
    • G06F9/30
    • G06F11/3684G06F9/524
    • A library or application is selected comprising one or more functions or methods. An interesting subset of the functions or methods is created. A plurality of multi-threaded test cases are generated from the subset of interesting functions or methods, with each test case comprising a unique pair or triple of functions or methods from the subset. The resulting set of test cases may then be filtered of thread safe test cases using static analysis techniques. The filtered set of test cases is then used as an input to a specialized application that executes each of the multi-threaded test cases to detect atomicity violations and race conditions. The results of the execution of each of the test cases by the specialized application are then aggregated and presented to a user or administrator in a report, for example.
    • 选择包括一个或多个功能或方法的库或应用程序。 创建函数或方法的一个有趣的子集。 从感兴趣的功能或方法的子集生成多个多线程测试用例,每个测试用例包括来自该子集的唯一对或三个函数或方法。 然后可以使用静态分析技术对结果集的测试用例进行线程安全测试用例的过滤。 然后将经过滤波的测试用例集合用作执行每个多线程测试用例以检测原子性违规和竞态条件的专用应用程序的输入。 例如,通过专门应用程序执行每个测试用例的结果然后被聚合并呈现给报告中的用户或管理员。
    • 56. 发明授权
    • Adaptive granularity refinement in detecting potential data races
    • 检测潜在数据竞赛中的自适应粒度优化
    • US07231498B2
    • 2007-06-12
    • US11070766
    • 2005-03-02
    • Thomas L. RodehefferYuan Yu
    • Thomas L. RodehefferYuan Yu
    • G06F12/02
    • G06F9/526G06F2209/523
    • A method and apparatus are provided for detecting data races that overcome the limitations of the prior art. In some embodiments, this is accomplished by detecting a first access to an object, determining whether the first access is associated with a suspicious pattern, automatically refining a pattern detection granularity from the object to a memory location within the object if a determination is made that the first access is associated with the suspicious pattern, and reporting the data race if a second access associated with the suspicious pattern occurs at the memory location after the pattern detection granularity is refined.
    • 提供了一种用于检测克服现有技术限制的数据竞赛的方法和装置。 在一些实施例中,这是通过检测对对象的第一访问,确定第一访问是否与可疑模式相关联来实现的,如果确定所述对象中的模式检测粒度被自动地从对象改进到对象内的存储器位置,则确定 第一访问与可疑模式相关联,并且如果在模式检测粒度被改进之后在存储器位置发生与可疑模式相关联的第二访问,则报告数据竞争。
    • 57. 发明申请
    • Adaptive granularity refinement in detecting potential data races
    • 检测潜在数据竞赛中的自适应粒度优化
    • US20060218356A1
    • 2006-09-28
    • US11070766
    • 2005-03-02
    • Thomas RodehefferYuan Yu
    • Thomas RodehefferYuan Yu
    • G06F12/00
    • G06F9/526G06F2209/523
    • A method and apparatus are provided for detecting data races that overcome the limitations of the prior art. In some embodiments, this is accomplished by detecting a first access to an object, determining whether the first access is associated with a suspicious pattern, automatically refining a pattern detection granularity from the object to a memory location within the object if a determination is made that the first access is associated with the suspicious pattern, and reporting the data race if a second access associated with the suspicious pattern occurs at the memory location after the pattern detection granularity is refined.
    • 提供了一种用于检测克服现有技术限制的数据竞赛的方法和装置。 在一些实施例中,这是通过检测对对象的第一访问,确定第一访问是否与可疑模式相关联来实现的,如果确定所述对象中的模式检测粒度被自动地从对象改进到对象内的存储器位置,则确定 第一访问与可疑模式相关联,并且如果在模式检测粒度被改进之后在存储器位置发生与可疑模式相关联的第二访问,则报告数据竞争。
    • 59. 发明申请
    • Quantified boolean formula (QBF) solver
    • 量化布尔公式(QBF)求解器
    • US20060190865A1
    • 2006-08-24
    • US11038958
    • 2005-01-18
    • Yuan YuLintao Zhang
    • Yuan YuLintao Zhang
    • G06F17/50
    • G06F17/504G06F17/11
    • Quantified Boolean formula (QBF) techniques are used in determining QBF satisfiability. A QBF is broken into component parts that are analyzable by a satisfiability (SAT) solver. Each component is then independently, and perhaps in parallel, analyzed for satisfiability. If a component is unsatisfiable, then it is determined that the QBF is unsatisfiable, and the analysis is stopped. If a component is satisfiable, then an assignment corresponding to the satisfiable component is noted. If a component is satisfiable, then it is appended to another untested component to provide a combination component, and the satisfiability of the combination component is analyzed. Such appending and analysis is repeated until the QBF is completed and determined to be satisfiable or determined to be unsatisfiable.
    • 量化布尔公式(QBF)技术用于确定QBF可满足性。 QBF被分解成可满足性(SAT)求解器可分析的组件。 然后分析每个组件的可靠性,并且可能并行地进行分析。 如果组件不能令人满意,则确定QBF不可满足,并且分析停止。 如果组件是可满足的,则记录对应于可满足组件的分配。 如果组件可满足,则将其附加到另一未测试组件以提供组合组件,并分析组合组件的可满足性。 重复这种附加和分析直到QBF完成并确定为满足或确定为不满意。