-
公开(公告)号：US09304835B1
公开(公告)日：2016-04-05
申请号：US14588333
申请日：2014-12-31
发明人： Kattamuri Ekanadham , William Pettit Horn , Joefon Jann , Manoj Kumar , Jose Eduardo Moreira , Pratap Chandra Pattnaik , Mauricio Jose Serrano , Ilie Gabriel Tanase , Hao Yu
CPC分类号： G06F17/30958 , G06F9/5044 , G06F17/30424
摘要： A graph processing system includes a graph API (Application Program Interface), as executed on a processor of a computer and as capable of implementing any of a plurality of graph operators to express computations of input graph analytics applications. A run-time system, executed by the processor, implements graph operators specified by each graph API function and deploys the implemented graph operators to a selected computing system. A library contains multiple implementations for each graph API function, each implementation predetermined as being optimal for a specific set of conditions met by a graph being processed, for functional capabilities of a specific computing system on which the graph is being processed, and for resources available on that specific computing system.
摘要翻译： 图形处理系统包括在计算机的处理器上执行的图形API（应用程序接口），并且能够实现多个图形运算符中的任何一个来表示输入图形分析应用的计算。 由处理器执行的运行时系统实现由每个图形API函数指定的图形运算符，并将实现的图形运算符部署到选定的计算系统。 一个库包含每个图形API函数的多个实现，每一个实现被预先确定为正在被处理的图所满足的一组特定条件，对于处理图表的特定计算系统的功能以及可用的资源而言是最佳的 在具体的计算系统上。
-
公开(公告)号：US11281647B2
公开(公告)日：2022-03-22
申请号：US15833022
申请日：2017-12-06
IPC分类号： G06F16/22 , G06F16/23 , G06F16/901 , G06F16/2457
摘要： A fine-grained scalable time-versioning support for large-scale property graph databases includes receiving a request, wherein the request includes an entity identifier (ID) and reference time information, and searching entries of a first table using the entity ID as a first key. Matching an entry is performed corresponding to the first key in the first table, determining the entry is valid based at least in part on comparing the reference time information of the request with stored time information for the entry, and responsive to the determination, creating a second key, wherein the second key concatenates an ID associated with the entity ID with the reference time information of the request. Searching a second table is performed having entries based at least in part on the second key, and responsive to searching the second table, retrieving data associated with the second key.
-
公开(公告)号：US09400700B2
公开(公告)日：2016-07-26
申请号：US14749362
申请日：2015-06-24
发明人： Kattamuri Ekanadham , William Pettit Horn , Joefon Jann , Manoj Kumar , Jose Eduardo Moreira , Pratap Chandra Pattnaik , Mauricio Jose Serrano , Ilie Gabriel Tanase , Hao Yu
CPC分类号： G06F17/30958 , G06F9/5044 , G06F17/30424
摘要： A graph processing system includes a graph API (Application Program Interface), as executed on a processor of a computer and as capable of implementing any of a plurality of graph operators to express computations of input graph analytics applications. A run-time system, executed by the processor, implements graph operators specified by each graph API function and deploys the implemented graph operators to a selected computing system. A library contains multiple implementations for each graph API function, each implementation predetermined as being optimal for a specific set of conditions met by a graph being processed, for functional capabilities of a specific computing system on which the graph is being processed, and for resources available on that specific computing system.
-
4.发明申请公开(公告)号：US20180060038A1
公开(公告)日：2018-03-01
申请号：US15245463
申请日：2016-08-24
摘要： Techniques for determining connected components of a graph via incremental graph analysis algorithms are provided. In one example, a computer-implemented method comprises analyzing, by a system operatively coupled to a processor, a first differential value representing an initial incremental difference of elements between selected initial elements of an initial vector and selected input elements of an input vector associated with a graph. The method further comprises recurringly analyzing, by the system, a second differential value representing a subsequent incremental difference of elements between selected updated elements of an updated initial vector and selected additional elements of another input vector associated with the graph until the second differential value is zero.
-
公开(公告)号：US09772890B2
公开(公告)日：2017-09-26
申请号：US14588349
申请日：2014-12-31
发明人： Kattamuri Ekanadham , William Pettit Horn , Joefon Jann , Manoj Kumar , Jose Eduardo Moreira , Pratap Chandra Pattnaik , Mauricio Jose Serrano , Ilie Gabriel Tanase , Hao Yu
CPC分类号： G06F9/547 , G06F17/30377 , G06F17/30958
摘要： A graph processing system includes a graph API (Application Programming Interface), as executed by a processor on a computer, and that includes a plurality of graph operators to create graphs and to execute graph analytic applications on the created graphs, the graph operators supporting a creation and manipulation of multi-dimensional properties of graphs. A run-time system is executed by the processor and implements routines that dynamically adjust a plurality of representations and algorithms to execute sequences of operations on graph data. A library is accessible to the run-time system and stores a specification of calling signatures for the graph operators such that the graph operators can be called from any of various computer programming languages such that top-level algorithms received in an input graph application can be understood in the graph processing system when received in any of the various computer programming languages. Thereby the top-level algorithms written to the graph API are portable across multiple implementations.
-
公开(公告)号：US10884942B2
公开(公告)日：2021-01-05
申请号：US15159368
申请日：2016-05-19
发明人： William Pettit Horn , Joefon Jann , Manoj Kumar , Jose Eduardo Moreira , Pratap Chandra Pattnaik , Mauricio J. Serrano , Ilie Gabriel Tanase
IPC分类号： G06F12/0897 , G06F12/0862
摘要： Various embodiments execute a program with improved cache efficiency. In one embodiment, a first subset of operations of a program is performed on a plurality of objects stored in one or more data structures. The first subset of operations has a regular memory access pattern. After each operation in the first subset of operations has been performed, results of the operation are stored in one of the plurality of queues. Each queue in the plurality of queues is associated with a different cacheable region of a memory. A second subset of operations in the program is performed utilizing at least one queue in the plurality of queues. The second subset of operations utilizes results of the operations in the first subset of operations stored in the queue. The second subset of operations has an irregular memory access pattern that is regularized by localizing memory locations accessed by the second subset of operations to the cacheable region of memory associated with the at least one queue. Results of each operation performed in the second subset of operations are stored in memory.
-
7.发明授权公开(公告)号：US10558429B2
公开(公告)日：2020-02-11
申请号：US15245463
申请日：2016-08-24
IPC分类号： G06F17/30 , G06F7/20 , G06F16/901 , G06F16/951 , G06F16/35 , G06F16/28
摘要： Techniques for determining connected components of a graph via incremental graph analysis algorithms are provided. In one example, a computer-implemented method comprises analyzing, by a system operatively coupled to a processor, a first differential value representing an initial incremental difference of elements between selected initial elements of an initial vector and selected input elements of an input vector associated with a graph. The method further comprises recurringly analyzing, by the system, a second differential value representing a subsequent incremental difference of elements between selected updated elements of an updated initial vector and selected additional elements of another input vector associated with the graph until the second differential value is zero.
-
8.发明申请公开(公告)号：US20190171736A1
公开(公告)日：2019-06-06
申请号：US15833022
申请日：2017-12-06
IPC分类号： G06F17/30
摘要： Embodiments include techniques for fine-grained scalable time-versioning support for large-scale property graph databases comprising receiving a request, wherein the request includes an entity identifier (ID) and reference time information, and searching entries of a first table using the entity ID as a first key. Techniques also include matching an entry corresponding to the first key in the first table, determining the entry is valid based at least in part on comparing the reference time information of the request with stored time information for the entry, and responsive to the determination, creating a second key, wherein the second key concatenates an ID associated with the entity ID with the reference time information of the request. Techniques also include searching a second table having one or more entries based at least in part on the second key, and responsive to searching the second table, retrieving data associated with the second key.
-
公开(公告)号：US09778967B2
公开(公告)日：2017-10-03
申请号：US14750182
申请日：2015-06-25
发明人： Kattamuri Ekanadham , William Pettit Horn , Joefon Jann , Manoj Kumar , Jose Eduardo Moreira , Pratap Chandra Pattnaik , Mauricio Jose Serrano , Ilie Gabriel Tanase , Hao Yu
CPC分类号： G06F9/547 , G06F17/30377 , G06F17/30958
摘要： A graph processing system includes a graph API (Application Programming Interface), as executed by a processor on a computer, and that includes a plurality of graph operators to create graphs and to execute graph analytic applications on the created graphs, the graph operators supporting a creation and manipulation of multi-dimensional properties of graphs. A run-time system is executed by the processor and implements routines that dynamically adjust a plurality of representations and algorithms to execute sequences of operations on graph data. A library is accessible to the run-time system and stores a specification of calling signatures for the graph operators such that the graph operators can be called from any of various computer programming languages such that top-level algorithms received in an input graph application can be understood in the graph processing system when received in any of the various computer programming languages. Thereby the top-level algorithms written to the graph API are portable across multiple implementations.
-
-
-
-
-
-
-
-
搜索结果
9 条记录 (耗时 0.015 秒)
