SELECTIVELY KILLING TRAPPED MULTI-PROCESS SERVICE CLIENTS SHARING THE SAME HARDWARE CONTEXT
    1.
    发明申请
    SELECTIVELY KILLING TRAPPED MULTI-PROCESS SERVICE CLIENTS SHARING THE SAME HARDWARE CONTEXT 有权
    选择性杀死多个进程的服务客户共享相同的硬件条件

    公开(公告)号:US20150206272A1

    公开(公告)日:2015-07-23

    申请号:US14481802

    申请日:2014-09-09

    CPC classification number: G06T1/20 G06F9/5016 G06F12/109 G06T1/60

    Abstract: A method for handling parallel processing clients associated with a server in a GPU, the method comprising: receiving a failure indication for at least client running a thread in the GPU; determining threads in the GPU associated with the failing client; exiting threads in the GPU associated with the failing client; and continuing to execute remaining threads in the GPU for other clients running threads in the GPU.

    Abstract translation: 一种用于处理与GPU中的服务器相关联的并行处理客户端的方法,所述方法包括:至少接收客户端运行GPU中的线程的失败指示; 确定与故障客户端相关联的GPU中的线程; 退出与故障客户端相关联的GPU中的线程; 并继续在GPU中执行剩余的线程以用于在GPU中运行线程的其他客户端。

    GROUPING AND ANALYSIS OF DATA ACCESS HAZARD REPORTS
    2.
    发明申请
    GROUPING AND ANALYSIS OF DATA ACCESS HAZARD REPORTS 有权
    数据访问危害报告的分组和分析

    公开(公告)号:US20140281727A1

    公开(公告)日:2014-09-18

    申请号:US14012270

    申请日:2013-08-28

    CPC classification number: G06F11/3632 G06F9/46 G06F11/3604

    Abstract: A method for analyzing race conditions between multiple threads of an application is disclosed. The method comprises accessing hazard records for an application under test. It further comprises creating a graph comprising a plurality of vertices and a plurality of edges using the hazard records, wherein each vertex of the graph comprises information about a code location of a hazard and wherein each edge of the graph comprises hazard information between one or more vertices. Additionally, it comprises assigning each edge with a weight, wherein the weight depends on a number and relative priority of hazards associated with a respective edge. Finally, it comprises traversing the graph to report an analysis record for each hazard represented in the graph.

    Abstract translation: 公开了一种用于分析应用程序的多个线程之间的竞争条件的方法。 该方法包括访问被测试应用的危险记录。 它进一步包括使用危险记录创建包括多个顶点和多个边缘的图形,其中图形的每个顶点包括关于危险物的代码位置的信息,并且其中图形的每个边缘包括一个或多个 顶点。 另外,它包括为每个边缘分配权重,其中权重取决于与相应边缘相关联的危险的数量和相对优先级。 最后,它包括遍历图形以报告图中表示的每个危险的分析记录。

    UNIFIED MEMORY SYSTEMS AND METHODS
    4.
    发明申请
    UNIFIED MEMORY SYSTEMS AND METHODS 审中-公开
    统一的内存系统和方法

    公开(公告)号:US20150206277A1

    公开(公告)日:2015-07-23

    申请号:US14601223

    申请日:2015-01-20

    CPC classification number: G06T1/20 G06F9/5016 G06F12/109 G06T1/60

    Abstract: The present invention facilitates efficient and effective utilization of unified virtual addresses across multiple components. In one embodiment, the presented new approach or solution uses Operating System (OS) allocation on the central processing unit (CPU) combined with graphics processing unit (GPU) driver mappings to provide a unified virtual address (VA) across both GPU and CPU. The new approach helps ensure that a GPU VA pointer does not collide with a CPU pointer provided by OS CPU allocation (e.g., like one returned by “malloc” C runtime API, etc.).

    Abstract translation: 本发明有助于跨多个组件的统一虚拟地址的有效和有效的利用。 在一个实施例中,所提出的新方法或解决方案使用与图形处理单元(GPU)驱动程序映射相结合的中央处理单元(CPU)上的操作系统(OS)分配,以在GPU和CPU两者之间提供统一的虚拟地址(VA)。 新的方法有助于确保GPU VA指针不会与OS CPU分配提供的CPU指针相冲突(例如,像“malloc”C运行时API返回的一样)等。

Patent Agency Ranking