公开(公告)号：US09086925B2

公开(公告)日：2015-07-21

申请号：US13858036

申请日：2013-04-06

Applicant: NEC Laboratories America, Inc.

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

IPC: G06F9/46 ,  G06F9/50

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

公开(公告)号：US20150066988A1

公开(公告)日：2015-03-05

申请号：US14472752

申请日：2014-08-29

Applicant: NEC Laboratories America, Inc.

Inventor： Srihari Cadambi ,  Srimat Chakradhar ,  Yuan Yuan

IPC: G06F17/30

CPC classification number: G06F7/36

Abstract: Systems and methods for sorting data, including chunking unsorted data such that each chunk is of a size that fits within a last level cache of the system. One or more threads are instantiated in each physical core of the system, chunks assigned physical cores are distributed evenly across the threads on the physical cores. Subchunks in the physical cores are sorted using vector intrinsics, the subchunks being data assigned to the threads in the physical cores, and the subchunks are merged to generate sorted large chunks. A binary tree, which includes leaf nodes that correspond to the sorted large chunks, is built, leaf nodes are assigned to threads, and tree nodes are assigned to a circular buffer, wherein the circular buffer is lock and synchronization free. The large chunks are sorted to generate sorted data as output.

Abstract translation: 用于排序数据的系统和方法，包括分块未排序的数据，使得每个块的大小适合系统的最后一级高速缓存。 一个或多个线程在系统的每个物理核心中实例化，分配的物理核心的分组均匀分布在物理内核上的线程之间。 物理核心中的子块使用向量内在函数进行排序，子块是分配给物理内核中的线程的数据，并且子块被合并以生成排序的大块。 构建了包含与排序的大块对应的叶节点的二叉树，将叶节点分配给线程，并将树节点分配给循环缓冲区，其中循环缓冲器是锁定和同步的。 大块被排序以生成排序数据作为输出。

公开(公告)号：US20160110404A1

公开(公告)日：2016-04-21

申请号：US14831775

申请日：2015-08-20

Applicant: NEC LABORATORIES AMERICA, INC.

Inventor： Kunal Rao ,  Giuseppe Coviello ,  Srimat Chakradhar ,  Souvik Bhattacherjee ,  Srihari Cadambi

IPC: G06F17/30

CPC classification number: G06F3/0638 ,  G06F3/0604 ,  G06F3/0619 ,  G06F3/067 ,  G06F17/30368 ,  G06F17/30371 ,  G06F17/30374 ,  G06F17/30424 ,  G06F17/30867 ,  G06F17/30876 ,  G06F17/30958 ,  G06T11/206

Abstract: A method is provided for detecting abnormal changes in real-time in dynamic graphs. The method includes extracting, by a graph sampler, an active sampled graph from an underlying base graph. The method further includes merging, by a graph merger, the active sampled graph with graph updates within a predetermined recent time period to generate a merged graph. The method also includes computing, by a graph diameter computer, a diameter of the merged graph. The method additionally includes determining, by a graph diameter change determination device, whether a graph diameter change exists. The method further includes generating, by an alarm generator, a user-perceptible alarm responsive to the graph diameter change.

Abstract translation: 提供了一种用于在动态图中实时检测异常变化的方法。 该方法包括通过图形采样器从底层基础图提取活动采样图。 该方法还包括通过图形合并将活动采样图与预定的最近时间段内的图更新进行合并，以生成合并图。 该方法还包括通过图形直径计算机计算合并图的直径。 该方法还包括通过图形直径变化确定装置确定是否存在图形直径变化。 该方法还包括响应于图形直径变化，通过报警发生器生成用户可感知的报警。

公开(公告)号：US20160110134A1

公开(公告)日：2016-04-21

申请号：US14831792

申请日：2015-08-20

Applicant: NEC Laboratories America, Inc.

Inventor： Kunal Rao ,  Giuseppe Coviello ,  Srimat Chakradhar ,  Souvik Bhattacherjee ,  Srihari Cadambi

IPC: G06F3/06

CPC classification number: G06F3/0638 ,  G06F3/0604 ,  G06F3/0619 ,  G06F3/067 ,  G06F17/30368 ,  G06F17/30371 ,  G06F17/30374 ,  G06F17/30424 ,  G06F17/30867 ,  G06F17/30876 ,  G06F17/30958 ,  G06T11/206

Abstract: A graph storage and processing system is provided. The system includes a scalable, distributed, fault-tolerant, in-memory graph storage device for storing base graph data representative of graphs. The system further includes a real-time, in memory graph storage device for storing update graph data representative of graph updates for the graphs with respect to a time threshold. The system also includes an in-memory graph sampler for sampling the base graph data to generate sampled portions of the graphs and for storing the sampled portions of the graph. The system additionally includes a query manager for providing a query interface between applications and the system and for forming graph data representative of a complete graph from at least the base graph data and the update graph data, if any. The system also includes a graph computer for processing the sampled portions using batch-type computations to generate approximate results for graph-based queries.

Abstract translation: 提供图形存储和处理系统。 该系统包括可扩展的，分布式的，容错的存储器内存图形存储装置，用于存储表示图形的基本图形数据。 该系统还包括一个实时存储器图形存储装置，用于存储代表图形关于时间阈值的图形更新的更新图形数据。 该系统还包括存储器内图形采样器，用于对基本图形数据进行采样以生成图形的采样部分并存储图形的采样部分。 该系统还包括查询管理器，用于在应用和系统之间提供查询接口，并且用于从至少基本图形数据和更新图形数据（如果有的话）形成表示完整图形的图形数据。 该系统还包括用于使用分批式计算来处理采样部分以生成基于图的查询的近似结果的图形计算机。

公开(公告)号：US20150113542A1

公开(公告)日：2015-04-23

申请号：US14506256

申请日：2014-10-03

Applicant: NEC Laboratories America, Inc.

Inventor： Srihari Cadambi ,  Giuseppe Coviello ,  Srimat Chakradhar

IPC: G06F9/52 ,  H04L29/08

CPC classification number: G06F9/5066 ,  H04L67/1023

Abstract: A method is provided for controlling a compute cluster having a plurality of nodes. Each of the plurality of nodes has a respective computing device with a main server and one or more coprocessor-based hardware accelerators. The method includes receiving a plurality of jobs for scheduling. The method further includes scheduling the plurality of jobs across the plurality of nodes responsive to a knapsack-based sharing-aware schedule generated by a knapsack-based sharing-aware scheduler. The knapsack-based sharing-aware schedule is generated to co-locate together on a same computing device certain ones of the plurality of jobs that are mutually compatible based on a set of requirements whose fulfillment is determined using a knapsack-based sharing-aware technique that uses memory as a knapsack capacity and minimizes makespan while adhering to coprocessor memory and thread resource constraints.

Abstract translation: 提供了一种用于控制具有多个节点的计算集群的方法。 多个节点中的每一个具有相应的计算设备，其具有主服务器和一个或多个基于协处理器的硬件加速器。 该方法包括接收多个作业用于调度。 该方法还包括响应于由基于背包的共享感知调度器生成的基于背包的共享感知调度来跨多个节点调度多个作业。 基于背包的共享感知计划被生成以在同一计算设备上共同定位在基于使用基于背包的共享感知技术来确定其满足的一组需求的相互兼容的多个作业中的某些作业 其使用内存作为背包容量，并且在保持协处理器存储器和线程资源约束的同时最小化制造时间。

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