会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 12. 发明申请
    • BUDGET-AWARE EVENT INFORMATION COLLECTION DURING PROGRAM EXECUTION
    • 计划执行过程中的预算事件信息收集
    • US20140207632A1
    • 2014-07-24
    • US13997643
    • 2012-05-09
    • Zhiqiang MaPaul M. Petersen
    • Zhiqiang MaPaul M. Petersen
    • G06Q40/00
    • G06Q40/12G06F11/3624G06F11/3636
    • Embodiments of techniques and systems for slowdown-budget-aware event information collection are described. In various embodiments, a system may be configured to control collection of information for events associated with execution of a program during execution of the program based on a slowdown cost budget. In various embodiments, the slowdown cost budget may be set in order to help keep slowdown experienced due to associated event information collection within a range around the budget. In embodiments, this may provide a user with greater control over the effects of the associated event information collection and instrumentation than would be available due to simple sampling rate control. Other embodiments may be described and claimed.
    • 描述了用于减缓预算感知事件信息收集的技术和系统的实施例。 在各种实施例中,系统可以被配置为基于减速成本预算来控制在执行程序期间与程序的执行相关联的事件的信息的收集。 在各种实施例中,可以设置减速成本预算,以便有助于在预算周围的范围内收集相关联的事件信息来保持经济放缓。 在实施例中,这可以为用户提供比相关事件信息收集和检测的效果更大的控制,这比由于简单的采样率控制而可用。 可以描述和要求保护其他实施例。
    • 13. 发明授权
    • Node-based representation of multi-threaded computing environment tasks, and node-based data race evaluation
    • 基于节点的多线程计算环境任务表示,以及基于节点的数据竞赛评估
    • US08141082B2
    • 2012-03-20
    • US12039528
    • 2008-02-28
    • Gautam UpadhyayaZhiqiang MaPaul M. Petersen
    • Gautam UpadhyayaZhiqiang MaPaul M. Petersen
    • G06F9/46
    • G06F9/524G06F11/3612G06F11/3632
    • A method for detecting race conditions in a concurrent processing environment is provided. The method comprises implementing a data structure configured for storing data related to at least one task executed in a concurrent processing computing environment, each task represented by a node in the data structure; and assigning to a node in the data structure at least one of a task number, a wait number, and a wait list; wherein the task number uniquely identifies the respective task, wherein the wait number is calculated based on a segment number of the respective task's parent node, and wherein the wait list comprises at least an ancestor's wait number. The method may further comprise monitoring a plurality of memory locations to determine if a first task accesses a first memory location, wherein said first memory location was previously accessed by a second task.
    • 提供了一种用于在并发处理环境中检测竞态条件的方法。 该方法包括:实现数据结构,其被配置为存储与在并行处理计算环境中执行的至少一个任务相关的数据,每个任务由数据结构中的一个节点表示; 以及向所述数据结构中的节点分配任务号码,等待号码和等待列表中的至少一个; 其中所述任务编号唯一地标识相应的任务,其中基于相应任务的父节点的段号计算所述等待数,并且其中所述等待列表至少包括祖先的等待号。 该方法还可以包括监视多个存储器位置以确定第一任务是否访问第一存储器位置,其中所述第一存储器位置先前被第二任务访问。
    • 20. 发明申请
    • Device, system, and method for regulating software lock elision mechanisms
    • 用于调节软件锁定机制的装置,系统和方法
    • US20090125519A1
    • 2009-05-14
    • US11984002
    • 2007-11-13
    • Arch D. RobisonPaul M. Petersen
    • Arch D. RobisonPaul M. Petersen
    • G06F7/00
    • G06F9/528G06F9/467
    • A method, apparatus and system for, in a computing apparatus, comparing a measure of data contention for a group of operations protected by a lock to a predetermined threshold for data contention, and comparing a measure of lock contention for the group of operations to a predetermined threshold for lock contention, eliding the lock for concurrently executing two or more of the operations of the group using two or more threads when the measure of data contention is approximately less than or equal to the predetermined threshold for data contention and the measure of lock contention is approximately greater than or equal to a predetermined threshold for lock contention, and acquiring the lock for executing two or more of the of operations of the group in a serialized manner when the measure of data contention is approximately greater than or equal to the predetermined threshold for data contention and the measure of lock contention is approximately less than or equal to a predetermined threshold for lock contention. Other embodiments are described and claimed.
    • 一种用于在计算装置中将由锁保护的一组操作的数据争用的度量与用于数据争用的预定阈值进行比较的方法,装置和系统,以及将所述操作组的锁争用度量度与 锁定争用的预定阈值,当数据争用的度量大约小于或等于数据争用的预定阈值和锁定度量时,使用两个或多个线程来同时执行该组的两个或更多个操作的锁定 争用大约等于或等于锁定争用的预定阈值,并且当数据争用的测量大约等于或等于预定的时间时,以串行方式获取用于执行组中的两个或更多个操作的锁定 数据争用的阈值和锁争用的测量大约小于或等于预定值 锁争用的阈值。 描述和要求保护其他实施例。