Patents by Inventor Ilie Gabriel Tanase
Ilie Gabriel Tanase has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 11281647Abstract: 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.Type: GrantFiled: December 6, 2017Date of Patent: March 22, 2022Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Jinho Lee, Toyotaro Suzumura, Ilie Gabriel Tanase, Warut Vijitbenjaronk
-
Patent number: 10884942Abstract: 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.Type: GrantFiled: May 19, 2016Date of Patent: January 5, 2021Assignee: International Business Machines CorporationInventors: William Pettit Horn, Joefon Jann, Manoj Kumar, Jose Eduardo Moreira, Pratap Chandra Pattnaik, Mauricio J. Serrano, Ilie Gabriel Tanase
-
Patent number: 10558429Abstract: 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.Type: GrantFiled: August 24, 2016Date of Patent: February 11, 2020Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Mauricio J. Serrano, Ilie Gabriel Tanase
-
Publication number: 20190171736Abstract: 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.Type: ApplicationFiled: December 6, 2017Publication date: June 6, 2019Inventors: Jinho Lee, Toyotaro Suzumura, Ilie Gabriel Tanase, Warut Vijitbenjaronk
-
Publication number: 20180060038Abstract: 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.Type: ApplicationFiled: August 24, 2016Publication date: March 1, 2018Inventors: Mauricio J. Serrano, Ilie Gabriel Tanase
-
Publication number: 20170336971Abstract: 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.Type: ApplicationFiled: May 19, 2016Publication date: November 23, 2017Inventors: William Pettit HORN, Joefon JANN, Manoj KUMAR, Jose Eduardo MOREIRA, Pratap Chandra PATTNAIK, Mauricio J. SERRANO, Ilie Gabriel TANASE
-
Patent number: 9778967Abstract: 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.Type: GrantFiled: June 25, 2015Date of Patent: October 3, 2017Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Kattamuri Ekanadham, William Pettit Horn, Joefon Jann, Manoj Kumar, Jose Eduardo Moreira, Pratap Chandra Pattnaik, Mauricio Jose Serrano, Ilie Gabriel Tanase, Hao Yu
-
Patent number: 9772890Abstract: 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.Type: GrantFiled: December 31, 2014Date of Patent: September 26, 2017Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Kattamuri Ekanadham, William Pettit Horn, Joefon Jann, Manoj Kumar, Jose Eduardo Moreira, Pratap Chandra Pattnaik, Mauricio Jose Serrano, Ilie Gabriel Tanase, Hao Yu
-
Patent number: 9400700Abstract: 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.Type: GrantFiled: June 24, 2015Date of Patent: July 26, 2016Assignee: International Business Machines CorporationInventors: Kattamuri Ekanadham, William Pettit Horn, Joefon Jann, Manoj Kumar, Jose Eduardo Moreira, Pratap Chandra Pattnaik, Mauricio Jose Serrano, Ilie Gabriel Tanase, Hao Yu
-
Publication number: 20160188391Abstract: 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.Type: ApplicationFiled: June 25, 2015Publication date: June 30, 2016Inventors: Kattamuri EKANADHAM, William Pettit Horn, Joefon Jann, Manoj Kumar, Jose Eduardo Moreira, Pratap Chandra Pattnaik, Mauricio Jose Serrano, ILie Gabriel Tanase, Hao Yu
-
Publication number: 20160188385Abstract: 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.Type: ApplicationFiled: June 24, 2015Publication date: June 30, 2016Inventors: Kattamuri EKANADHAM, William Pettit HORN, Joefon JANN, Manoj KUMAR, Jose MOREIRA, Pratap Chandra PATTNAIK, Mauricio Jose SERRANO, ILIE Gabriel TANASE, Hao YU
-
Publication number: 20160188656Abstract: 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.Type: ApplicationFiled: December 31, 2014Publication date: June 30, 2016Inventors: Kattamuri EKANADHAM, William Pettit HORN, Joefon JANN, Manoj KUMAR, Jose Eduardo MOREIRA, Pratap Chandra PATTNAIK, Mauricio Jose SERRANO, ILIE Gabriel TANASE, Hao YU
-
Patent number: 9304835Abstract: 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.Type: GrantFiled: December 31, 2014Date of Patent: April 5, 2016Assignee: International Business Machines CorporationInventors: Kattamuri Ekanadham, William Pettit Horn, Joefon Jann, Manoj Kumar, Jose Eduardo Moreira, Pratap Chandra Pattnaik, Mauricio Jose Serrano, Ilie Gabriel Tanase, Hao Yu