会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 6. 发明申请
    • Detecting Potential Access Errors In A Multi-Threaded Application
    • 检测多线程应用程序中的潜在访问错误
    • US20120303910A1
    • 2012-11-29
    • US13117526
    • 2011-05-27
    • Zhiqiang Ma
    • Zhiqiang Ma
    • G06F12/00
    • G06F9/52G06F11/3612G06F11/3632
    • In one embodiment, a method includes maintaining thread analysis metadata for a multi-threaded application. The metadata may include a thread vector clock for threads of the application and a synchronization vector clock for synchronization objects of the application. In addition, an initialization log and an access log can be generated and maintained for memory accesses occurring during execution of the application. From this metadata, it may be determined if an access to a memory element by a thread is a potential invalid access for a different scheduling of the application. Other embodiments are described and claimed.
    • 在一个实施例中,一种方法包括维护多线程应用的线程分析元数据。 元数据可以包括用于应用程序的线程的线程向量时钟和应用程序的同步对象的同步向量时钟。 此外,可以生成并维护初始化日志和访问日志,以便在执行应用程序期间发生的内存访问。 根据该元数据,可以确定线程对存储器元件的访问对于应用的不同调度是潜在的无效访问。 描述和要求保护其他实施例。
    • 9. 发明申请
    • DATA RACE DETECTION IN A CONCURRENT PROCESSING ENVIRONMENT
    • 数据处理环境中的数据检测
    • US20090222825A1
    • 2009-09-03
    • 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.
    • 提供了一种用于在并发处理环境中检测竞态条件的方法。 该方法包括:实现数据结构,其被配置为存储与在并行处理计算环境中执行的至少一个任务相关的数据,每个任务由数据结构中的一个节点表示; 以及向所述数据结构中的节点分配任务号码,等待号码和等待列表中的至少一个; 其中所述任务编号唯一地标识相应的任务,其中基于相应任务的父节点的段号计算所述等待数,并且其中所述等待列表至少包括祖先的等待号。 该方法还可以包括监视多个存储器位置以确定第一任务是否访问第一存储器位置,其中所述第一存储器位置先前被第二任务访问。