公开(公告)号：US20140208331A1

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

申请号：US13858036

申请日：2013-04-06

Applicant: NEC LABORATORIES AMERICA, INC.

Inventor： Cheng-Hong Li ,  Srihari Cadambi ,  Kunal Rao ,  Srimat T. Chakradhar ,  Rajat Phull ,  Giuseppe Coviello ,  Murugan Sankaradass

IPC: G06F9/48

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协处理器对卸载和本机应用程序执行调度和资源管理。

公开(公告)号：US20140208327A1

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

申请号：US13858039

申请日：2013-04-06

Applicant: NEC LABORATORIES AMERICA, INC.

Inventor： Srihari Cadambi ,  Kunal Rao ,  Srimat T. Chakradhar ,  Rajat Phull ,  Giuseppe Coviello ,  Murugan Sankaradass ,  Cheng-Hong Li

IPC: G06F9/50

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