Scheduling accelerator tasks on accelerators using graphs

    公开(公告)号:US09996394B2

    公开(公告)日:2018-06-12

    申请号:US13409117

    申请日:2012-03-01

    IPC分类号: G06F9/50 G06F9/46

    摘要: An application programming interface is provided that allows programmers to encapsulate snippets of executable code of a program into accelerator tasks. A graph is generated with a node corresponding to each of the accelerator tasks with edges that represent the data flow and data dependencies between the accelerator tasks. The generated graph is used by a scheduler to schedule the execution of the accelerator tasks across multiple accelerators. The application programming interface further provides an abstraction of the various memories of the accelerators called a datablock. The programmer can store and use data stored on the datablocks without knowing where on the accelerators the data is stored. The application programming interface can further schedule the execution of accelerator tasks to minimize the amount of data that is copied to and from the accelerators based on the datablocks and the generated graph.

    DEVICE SCHEDULING METHOD, TASK MANAGER AND STORAGE MEDIUM

    公开(公告)号:US20170329632A1

    公开(公告)日:2017-11-16

    申请号:US15528145

    申请日:2015-04-28

    IPC分类号: G06F9/48 G06F9/50

    摘要: Disclosed a device scheduling method. A Task Description (TD) in a task queue is read and parsed, to acquire task information of a task corresponding to the TD; and when it is determined that the task has met a starting condition and the task is a task with a highest priority among tasks which currently meet the starting condition, a preset parameter is acquired according to the task information, and the parameter is configured to a device intended to complete the task. A task manager and a storage medium is also disclosed.

    ACCESSING RESOURCES ACROSS MULTIPLE TENANTS
    10.
    发明申请

    公开(公告)号:US20170132046A1

    公开(公告)日:2017-05-11

    申请号:US15318902

    申请日:2014-07-28

    IPC分类号: G06F9/50 H04L12/927

    摘要: Examples relate to accessing resources across multiple tenants. One example enables determination, from a list of requests, a request to perform which accesses a resource, responsive to a determination that the resource on a server is available for use for an application. The request to be performed may be determined, for example, by determining a first priority score for a first tenant associated with a first request based on usage of the resource by the first tenant, wherein the first tenant comprises a first set of users, determining a second priority score for a tenant associated with a second request based on usage of the resource by the second tenant, wherein the second tenant comprises a second set of users, and, responsive to the first priority score being lower than the second priority score, selecting the first request as the request to be performed.