公开(公告)号：US20090222825A1

公开(公告)日：2009-09-03

申请号：US12039528

申请日：2008-02-28

申请人： Gautam Upadhyaya ,  Zhiqiang Ma ,  Paul M. Petersen

发明人： Gautam Upadhyaya ,  Zhiqiang Ma ,  Paul M. Petersen

IPC分类号： G06F9/46

CPC分类号： G06F9/524 ,  G06F11/3612 ,  G06F11/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.

摘要翻译： 提供了一种用于在并发处理环境中检测竞态条件的方法。 该方法包括：实现数据结构，其被配置为存储与在并行处理计算环境中执行的至少一个任务相关的数据，每个任务由数据结构中的一个节点表示; 以及向所述数据结构中的节点分配任务号码，等待号码和等待列表中的至少一个; 其中所述任务编号唯一地标识相应的任务，其中基于相应任务的父节点的段号计算所述等待数，并且其中所述等待列表至少包括祖先的等待号。 该方法还可以包括监视多个存储器位置以确定第一任务是否访问第一存储器位置，其中所述第一存储器位置先前被第二任务访问。

公开(公告)号：US08141082B2

公开(公告)日：2012-03-20

申请号：US12039528

申请日：2008-02-28

申请人： Gautam Upadhyaya ,  Zhiqiang Ma ,  Paul M. Petersen

发明人： Gautam Upadhyaya ,  Zhiqiang Ma ,  Paul M. Petersen

IPC分类号： G06F9/46

CPC分类号： G06F9/524 ,  G06F11/3612 ,  G06F11/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.

摘要翻译： 提供了一种用于在并发处理环境中检测竞态条件的方法。 该方法包括：实现数据结构，其被配置为存储与在并行处理计算环境中执行的至少一个任务相关的数据，每个任务由数据结构中的一个节点表示; 以及向所述数据结构中的节点分配任务号码，等待号码和等待列表中的至少一个; 其中所述任务编号唯一地标识相应的任务，其中基于相应任务的父节点的段号计算所述等待数，并且其中所述等待列表至少包括祖先的等待号。 该方法还可以包括监视多个存储器位置以确定第一任务是否访问第一存储器位置，其中所述第一存储器位置先前被第二任务访问。

公开(公告)号：US09489246B2

公开(公告)日：2016-11-08

申请号：US13976054

申请日：2011-09-30

申请人： Jeffrey V. Olivier ,  Zhiqiang Ma ,  Paul M Petersen

发明人： Jeffrey V. Olivier ,  Zhiqiang Ma ,  Paul M Petersen

IPC分类号： G06F9/54 ,  G06F9/38 ,  G06F9/45 ,  G06F9/50

CPC分类号： G06F9/54 ,  G06F8/458 ,  G06F9/3838 ,  G06F9/3851 ,  G06F9/5066 ,  G06F2209/5017

摘要： A method and device for determining parallelism of tasks of a program comprises generating a task data structure to track the tasks and assigning a node of the task data structure to each executing task. Each node includes a task identification number and a wait number. The task identification number uniquely identifies the corresponding task from other currently executing tasks and the wait number corresponds to the task identification number of a node corresponding to the last descendant task of the corresponding task that was executed prior to a wait command. The parallelism of the tasks is determined by comparing the relationship between the tasks.

摘要翻译： 一种用于确定程序的任务的并行性的方法和装置包括生成任务数据结构以跟踪任务并将任务数据结构的节点分配给每个执行任务。 每个节点包括任务标识号和等待号。 任务识别号码从其他当前执行任务中唯一地识别相应的任务，等待号码对应于在等待命令之前执行的相应任务的最后一个后续任务对应的节点的任务识别号码。 通过比较任务之间的关系来确定任务的并行性。

公开(公告)号：US20090248689A1

公开(公告)日：2009-10-01

申请号：US12059108

申请日：2008-03-31

申请人： Paul M. Petersen ,  Zhiqiang Ma

发明人： Paul M. Petersen ,  Zhiqiang Ma

IPC分类号： G06F9/50 ,  G06F7/08 ,  G06F17/30

CPC分类号： G06F17/30348 ,  G06F9/526

摘要： A method of removing a first data race condition by generating a list of suggested solutions is provided. The method comprises detecting the first data race condition involving a shared resource that is accessed first by a first thread and then by a second thread; suggesting one or more solutions using a lockset mechanism; suggesting one or more solutions using a vector clock mechanism; suggesting that a user create a new synchronization object; suggesting that a user replicate the shared resource; and displaying the list to the user.

摘要翻译： 提供了通过生成建议解决方案的列表来消除第一数据竞争条件的方法。 该方法包括检测涉及首先由第一线程然后由第二线程访问的共享资源的第一数据竞争条件; 建议使用锁定机制的一个或多个解决方案; 建议使用向量时钟机制的一个或多个解决方案; 提示用户创建一个新的同步对象; 提示用户复制共享资源; 并将该列表显示给用户。

公开(公告)号：US07093262B2

公开(公告)日：2006-08-15

申请号：US10207262

申请日：2002-07-30

申请人： Zhiqiang Ma ,  Paul M. Petersen

发明人： Zhiqiang Ma ,  Paul M. Petersen

IPC分类号： G06F15/16

CPC分类号： G06F9/524 ,  G06F11/362

摘要： An arrangement is provided for detecting deadlocks in a multithreaded program. When a thread in a multithreaded program performs a resource operation related to a mutually exclusive shared resource, it creates relationships between the thread and the shared resource as well as between the thread and other threads of the multithreaded program. Such created relationships are monitored and used to detect deadlocks.

摘要翻译： 提供了一种用于检测多线程程序中的死锁的布置。 当多线程程序中的线程执行与互斥共享资源相关的资源操作时，它会创建线程和共享资源之间以及线程和多线程程序的其他线程之间的关系。 这种创建的关系被监视并用于检测死锁。

公开(公告)号：US20130290975A1

公开(公告)日：2013-10-31

申请号：US13976054

申请日：2011-09-30

申请人： Jeffrey V. Olivier ,  Zhiqiang Ma ,  Paul M. Petersen

发明人： Jeffrey V. Olivier ,  Zhiqiang Ma ,  Paul M. Petersen

IPC分类号： G06F9/54

CPC分类号： G06F9/54 ,  G06F8/458 ,  G06F9/3838 ,  G06F9/3851 ,  G06F9/5066 ,  G06F2209/5017

摘要： A method and device for determining parallelism of tasks of a program comprises generating a task data structure to track the tasks and assigning a node of the task data structure to each executing task. Each node includes a task identification number and a wait number. The task identification number uniquely identifies the corresponding task from other currently executing tasks and the wait number corresponds to the task identification number of a node corresponding to the last descendant task of the corresponding task that was executed prior to a wait command. The parallelism of the tasks is determined by comparing the relationship between the tasks.

摘要翻译： 一种用于确定程序的任务的并行性的方法和装置包括生成任务数据结构以跟踪任务并将任务数据结构的节点分配给每个执行任务。 每个节点包括任务标识号和等待号。 任务识别号码从其他当前执行任务中唯一地识别相应的任务，等待号码对应于在等待命令之前执行的相应任务的最后一个后续任务对应的节点的任务识别号码。 通过比较任务之间的关系来确定任务的并行性。

公开(公告)号：US20140207632A1

公开(公告)日：2014-07-24

申请号：US13997643

申请日：2012-05-09

申请人： Zhiqiang Ma ,  Paul M. Petersen

发明人： Zhiqiang Ma ,  Paul M. Petersen

IPC分类号： G06Q40/00

CPC分类号： G06Q40/12 ,  G06F11/3624 ,  G06F11/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.

摘要翻译： 描述了用于减缓预算感知事件信息收集的技术和系统的实施例。 在各种实施例中，系统可以被配置为基于减速成本预算来控制在执行程序期间与程序的执行相关联的事件的信息的收集。 在各种实施例中，可以设置减速成本预算，以便有助于在预算周围的范围内收集相关联的事件信息来保持经济放缓。 在实施例中，这可以为用户提供比相关事件信息收集和检测的效果更大的控制，这比由于简单的采样率控制而可用。 可以描述和要求保护其他实施例。

公开(公告)号：US08732142B2

公开(公告)日：2014-05-20

申请号：US12059108

申请日：2008-03-31

申请人： Paul M Petersen ,  Zhiqiang Ma

发明人： Paul M Petersen ,  Zhiqiang Ma

IPC分类号： G06F7/00 ,  G06F17/00

CPC分类号： G06F17/30348 ,  G06F9/526

摘要： A method of removing a first data race condition by generating a list of suggested solutions is provided. The method comprises detecting the first data race condition involving a shared resource that is accessed first by a first thread and then by a second thread; suggesting one or more solutions using a lockset mechanism; suggesting one or more solutions using a vector clock mechanism; suggesting that a user create a new synchronization object; suggesting that a user replicate the shared resource; and displaying the list to the user.

摘要翻译： 提供了通过生成建议解决方案的列表来消除第一数据竞争条件的方法。 该方法包括检测涉及首先由第一线程然后由第二线程访问的共享资源的第一数据竞争条件; 建议使用锁定机制的一个或多个解决方案; 建议使用向量时钟机制的一个或多个解决方案; 提示用户创建一个新的同步对象; 提示用户复制共享资源; 并将该列表显示给用户。

公开(公告)号：US10089696B2

公开(公告)日：2018-10-02

申请号：US13997643

申请日：2012-05-09

申请人： Zhiqiang Ma ,  Paul M. Petersen

发明人： Zhiqiang Ma ,  Paul M. Petersen

IPC分类号： G06Q40/00 ,  G06F11/36 ,  G06F9/46

摘要： 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.

公开(公告)号：US20100037025A1

公开(公告)日：2010-02-11

申请号：US12186416

申请日：2008-08-05

申请人： Sergey N. Zheltov ,  Paul Petersen ,  Zhiqiang Ma

发明人： Sergey N. Zheltov ,  Paul Petersen ,  Zhiqiang Ma

IPC分类号： G06F12/08

CPC分类号： G06F11/366 ,  G06F11/3636

摘要： Machine-readable media, methods, apparatus and system for detecting a data access violation are described. In some embodiments, current memory access information related to a current memory access to a memory address by a current user thread may be obtained. It may be determined whether a cache includes a cache entry associated with the memory address. If the cache includes the cache entry associated with the memory address, then, an access history stored in the cache entry and the current memory access information may be analyzed to detect if there is at least one of an actual violation and a potential violation of accessing the memory address.

摘要翻译： 描述了用于检测数据访问冲突的机器可读介质，方法，装置和系统。 在一些实施例中，可以获得与由当前用户线程访问存储器地址的当前存储器相关的当前存储器访问信息。 可以确定高速缓存是否包括与存储器地址相关联的高速缓存条目。 如果高速缓存包括与存储器地址相关联的高速缓存条目，则可以分析存储在高速缓存条目中的访问历史和当前存储器访问信息，以检测是否存在实际违规和潜在违反访问中的至少一个 内存地址。