USECASE SPECIFICATION AND RUNTIME EXECUTION
    14.
    发明申请

    公开(公告)号:US20200293371A1

    公开(公告)日:2020-09-17

    申请号:US16809154

    申请日:2020-03-04

    Abstract: A computer-implemented method includes obtaining a usecase specification and a usecase runtime specification corresponding to the usecase. The usecase includes a plurality of applications each being associated with a micro-service providing a corresponding functionality within the usecase for performing a task. The method further includes determining that at least one instance of the at least one of the plurality of applications can be reused during execution of the usecase based on the usecase specification and the usecase runtime specification, and reusing the at least one instance during execution of the usecase.

    Real-time Abnormal Change Detection in Graphs
    15.
    发明申请
    Real-time Abnormal Change Detection in Graphs 有权
    图形中的实时异常变化检测

    公开(公告)号:US20160110404A1

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

    申请号:US14831775

    申请日:2015-08-20

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

    Large-Scale, Dynamic Graph Storage and Processing System
    16.
    发明申请
    Large-Scale, Dynamic Graph Storage and Processing System 审中-公开
    大型动态图形存储和处理系统

    公开(公告)号:US20160110134A1

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

    申请号:US14831792

    申请日:2015-08-20

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

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

Patent Agency Ranking