USER-LEVEL MANAGER TO HANDLE MULTI-PROCESSING ON MANY-CORE COPROCESSOR-BASED SYSTEMS
    1.
    发明申请
    USER-LEVEL MANAGER TO HANDLE MULTI-PROCESSING ON MANY-CORE COPROCESSOR-BASED SYSTEMS 审中-公开
    用户级管理员处理多个基于协处理器的系统的多处理

    公开(公告)号:US20140208072A1

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

    申请号:US13858034

    申请日:2013-04-06

    CPC classification number: G06F9/5044 G06F9/5033 G06F2209/509

    Abstract: A method is disclosed to manage a multi-processor system with one or more multiple-core coprocessors by intercepting coprocessor offload infrastructure application program interface (API) calls; scheduling user processes to run on one of the coprocessors; scheduling offloads within user processes to run on one of the coprocessors; and affinitizing offloads to predetermined cores within one of the coprocessors by selecting and allocating cores to an offload, and obtaining a thread-to-core mapping from a user.

    Abstract translation: 公开了一种通过拦截协处理器卸载基础设施应用程序接口(API)调用来管理具有一个或多个多核协处理器的多处理器系统的方法; 调度用户进程以在一个协处理器上运行; 在用户进程内调度卸载以在一个协处理器上运行; 并且通过选择和分配核到卸载来将卸载到一个协处理器内的预定内核,并从用户获得线程到核心的映射。

    Simultaneous scheduling of processes and offloading computation on many-core coprocessors
    2.
    发明授权
    Simultaneous scheduling of processes and offloading computation on many-core coprocessors 有权
    同时调度多核协处理器的进程和卸载计算

    公开(公告)号:US09367357B2

    公开(公告)日:2016-06-14

    申请号:US14261090

    申请日:2014-04-24

    CPC classification number: G06F9/5044 G06F9/4881

    Abstract: Methods and systems for scheduling jobs to manycore nodes in a cluster include selecting a job to run according to the job's wait time and the job's expected execution time; sending job requirements to all nodes in a cluster, where each node includes a manycore processor; determining at each node whether said node has sufficient resources to ever satisfy the job requirements and, if no node has sufficient resources, deleting the job; creating a list of nodes that have sufficient free resources at a present time to satisfy the job requirements; and assigning the job to a node, based on a difference between an expected execution time and associated confidence value for each node and a hypothetical fastest execution time and associated hypothetical maximum confidence value.

    Abstract translation: 将作业调度到群集节点的方法和系统包括根据作业的等待时间和作业的预期执行时间来选择要运行的作业; 向群集中的所有节点发送作业需求,其中每个节点包括一个处理器; 在每个节点处确定所述节点是否具有足够的资源以满足工作要求,如果没有节点具有足够的资源,则删除该作业; 创建一个目前有足够空闲资源的节点列表,以满足工作要求; 并且基于每个节点的预期执行时间和相关联的置信度值之间的差异以及假设的最快执行时间和相关联的假设最大置信度值将作业分配给节点。

    METHODS OF PROCESSING CORE SELECTION FOR APPLICATIONS ON MANYCORE PROCESSORS
    3.
    发明申请
    METHODS OF PROCESSING CORE SELECTION FOR APPLICATIONS ON MANYCORE PROCESSORS 有权
    处理多核处理器应用的核心选择方法

    公开(公告)号:US20140208331A1

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

    申请号:US13858036

    申请日:2013-04-06

    CPC classification number: G06F9/5044 G06F9/5033 G06F2209/509

    Abstract: A runtime method is disclosed that dynamically sets up core containers and thread-to-core affinity for processes running on manycore coprocessors. The method is completely transparent to user applications and incurs low runtime overhead. The method is implemented within a user-space middleware that also performs scheduling and resource management for both offload and native applications using the manycore coprocessors.

    Abstract translation: 公开了一种运行时方法,其动态地为在manycore协处理器上运行的进程设置核心容器和线程到核心的亲和力。 该方法对用户应用程序是完全透明的,并导致低运行时开销。 该方法在用户空间中间件中实现,该中间件还使用manycore协处理器对卸载和本机应用程序执行调度和资源管理。

    METHOD FOR SIMULTANEOUS SCHEDULING OF PROCESSES AND OFFLOADING COMPUTATION ON MANY-CORE COPROCESSORS
    4.
    发明申请
    METHOD FOR SIMULTANEOUS SCHEDULING OF PROCESSES AND OFFLOADING COMPUTATION ON MANY-CORE COPROCESSORS 有权
    方法同时安排过程和卸载计算在多个核心协处理器

    公开(公告)号:US20140208327A1

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

    申请号:US13858039

    申请日:2013-04-06

    CPC classification number: G06F9/5044 G06F9/5033 G06F2209/509

    Abstract: A method is disclosed to manage a multi-processor system with one or more manycore devices, by managing real-time bag-of-tasks applications for a cluster, wherein each task runs on a single server node, and uses the offload programming model, and wherein each task has a deadline and three specific resource requirements: total processing time, a certain number of manycore devices and peak memory on each device; when a new task arrives, querying each node scheduler to determine which node can best accept the task and each node scheduler responds with an estimated completion time and a confidence level, wherein the node schedulers use an urgency-based heuristic to schedule each task and its offloads; responding to an accept/reject query phase, wherein the cluster scheduler send the task requirements to each node and queries if the node can accept the task with an estimated completion time and confidence level; and scheduling tasks and offloads using a aging and urgency-based heuristic, wherein the aging guarantees fairness, and the urgency prioritizes tasks and offloads so that maximal deadlines are met.

    Abstract translation: 公开了一种通过管理用于集群的实时任务应用程序来管理具有一个或多个管理器设备的多处理器系统的方法,其中每个任务在单个服务器节点上运行,并且使用卸载编程模型, 并且其中每个任务具有最后期限和三个特定的资源要求:总处理时间,一定数量的管理设备和每个设备上的峰值存储器; 当新任务到达时,查询每个节点调度器以确定哪个节点可以最好地接受任务,并且每个节点调度器以估计的完成时间和置信水平进行响应,其中节点调度器使用基于紧急度的启发式来安排每个任务及其 卸货 响应于接受/拒绝查询阶段,其中所述群集调度器向每个节点发送所述任务需求,并且查询所述节点是否可以接收具有估计完成时间和置信水平的所述任务; 并使用基于老化和紧急性的启发式调度任务和卸载,其中老化保证公平性,并且紧急性优先考虑任务和卸载,以便满足最大期限。

    Method for simultaneous scheduling of processes and offloading computation on many-core coprocessors
    7.
    发明授权
    Method for simultaneous scheduling of processes and offloading computation on many-core coprocessors 有权
    多核协同处理器同步进程调度和卸载计算方法

    公开(公告)号:US09152467B2

    公开(公告)日:2015-10-06

    申请号:US13858039

    申请日:2013-04-06

    CPC classification number: G06F9/5044 G06F9/5033 G06F2209/509

    Abstract: A method is disclosed to manage a multi-processor system with one or more manycore devices, by managing real-time bag-of-tasks applications for a cluster, wherein each task runs on a single server node, and uses the offload programming model, and wherein each task has a deadline and three specific resource requirements: total processing time, a certain number of manycore devices and peak memory on each device; when a new task arrives, querying each node scheduler to determine which node can best accept the task and each node scheduler responds with an estimated completion time and a confidence level, wherein the node schedulers use an urgency-based heuristic to schedule each task and its offloads; responding to an accept/reject query phase, wherein the cluster scheduler send the task requirements to each node and queries if the node can accept the task with an estimated completion time and confidence level; and scheduling tasks and offloads using a aging and urgency-based heuristic, wherein the aging guarantees fairness, and the urgency prioritizes tasks and offloads so that maximal deadlines are met.

    Abstract translation: 公开了一种通过管理用于集群的实时任务应用程序来管理具有一个或多个管理器设备的多处理器系统的方法,其中每个任务在单个服务器节点上运行,并且使用卸载编程模型, 并且其中每个任务具有最后期限和三个特定的资源要求:总处理时间,一定数量的管理设备和每个设备上的峰值存储器; 当新任务到达时,查询每个节点调度器以确定哪个节点可以最好地接受任务,并且每个节点调度器以估计的完成时间和置信水平进行响应,其中节点调度器使用基于紧急度的启发式来安排每个任务及其 卸货 响应于接受/拒绝查询阶段,其中所述群集调度器向每个节点发送所述任务需求,并且查询所述节点是否可以接收具有估计完成时间和置信水平的所述任务; 并使用基于老化和紧急性的启发式调度任务和卸载,其中老化保证公平性,并且紧急性优先考虑任务和卸载,以便满足最大期限。

    SIMULTANEOUS SCHEDULING OF PROCESSES AND OFFLOADING COMPUTATION ON MANY-CORE COPROCESSORS
    8.
    发明申请
    SIMULTANEOUS SCHEDULING OF PROCESSES AND OFFLOADING COMPUTATION ON MANY-CORE COPROCESSORS 有权
    多个并发处理器的同步调度和卸载计算

    公开(公告)号:US20140237477A1

    公开(公告)日:2014-08-21

    申请号:US14261090

    申请日:2014-04-24

    CPC classification number: G06F9/5044 G06F9/4881

    Abstract: Methods and systems for scheduling jobs to manycore nodes in a cluster include selecting a job to run according to the job's wait time and the job's expected execution time; sending job requirements to all nodes in a cluster, where each node includes a manycore processor; determining at each node whether said node has sufficient resources to ever satisfy the job requirements and, if no node has sufficient resources, deleting the job; creating a list of nodes that have sufficient free resources at a present time to satisfy the job requirements; and assigning the job to a node, based on a difference between an expected execution time and associated confidence value for each node and a hypothetical fastest execution time and associated hypothetical maximum confidence value.

    Abstract translation: 将作业调度到群集节点的方法和系统包括根据作业的等待时间和作业的预期执行时间来选择要运行的作业; 向群集中的所有节点发送作业需求,其中每个节点包括一个处理器; 在每个节点处确定所述节点是否具有足够的资源以满足工作要求,如果没有节点具有足够的资源,则删除该作业; 创建一个目前有足够空闲资源的节点列表,以满足工作要求; 并且基于每个节点的预期执行时间和相关联的置信度值之间的差异以及假设的最快执行时间和相关联的假设最大置信度值将作业分配给节点。

Patent Agency Ranking