中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

31 records (took 0.029 seconds)

    Efficient resource allocation for concurrent graph workloads
    21.
    发明授权
    Efficient resource allocation for concurrent graph workloads 有权

    公开(公告)号：US10853137B2

    公开(公告)日：2020-12-01

    申请号：US16351377

    申请日：2019-03-12

    Applicant: Oracle International Corporation

    Inventor： Vlad Ioan Haprian ,  Iraklis Psaroudakis ,  Alexander Weld ,  Oskar Van Rest ,  Sungpack Hong ,  Hassan Chafi

    IPC: G06F9/46 ,  G06F9/50 ,  G06F9/38 ,  G06F11/30 ,  G06K9/62 ,  G06F16/901

    Abstract: Techniques are described herein for allocating and rebalancing computing resources for executing graph workloads in manner that increases system throughput. According to one embodiment, a method includes receiving a request to execute a graph processing workload on a dataset, identifying a plurality of graph operators that constitute the graph processing workload, and determining whether execution of each graph operator is processor intensive or memory intensive. The method also includes assigning a task weight for each graph operator of the plurality of graph operators, and performing, based on the assigned task weights, a first allocation of computing resources to execute the plurality of graph operators. Further, the method includes causing, according to the first allocation, execution of the plurality of graph operators by the computing resources, and monitoring computing resource usage of graph operators executed by the computing resources according to the first allocation. In addition, the method includes performing, responsive to monitoring computing resource usage, a second allocation of computing resources to execute the plurality of graph operators, and causing, according to the second allocation instead of according to the first allocation, execution of the plurality of graph operators by the computing resources.

    EFFICIENT RESOURCE ALLOCATION FOR CONCURRENT GRAPH WORKLOADS
    22.
    发明申请
    EFFICIENT RESOURCE ALLOCATION FOR CONCURRENT GRAPH WORKLOADS 审中-公开

    公开(公告)号：US20200293372A1

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

    申请号：US16351377

    申请日：2019-03-12

    Applicant: Oracle International Corporation

    Inventor： Vlad Ioan Haprian ,  Iraklis Psaroudakis ,  Alexander Weld ,  Oskar Van Rest ,  Sungpack Hong ,  Hassan Chafi

    IPC: G06F9/50 ,  G06F9/38 ,  G06F16/901 ,  G06K9/62 ,  G06F11/30

    Abstract: Techniques are described herein for allocating and rebalancing computing resources for executing graph workloads in manner that increases system throughput. According to one embodiment, a method includes receiving a request to execute a graph processing workload on a dataset, identifying a plurality of graph operators that constitute the graph processing workload, and determining whether execution of each graph operator is processor intensive or memory intensive. The method also includes assigning a task weight for each graph operator of the plurality of graph operators, and performing, based on the assigned task weights, a first allocation of computing resources to execute the plurality of graph operators. Further, the method includes causing, according to the first allocation, execution of the plurality of graph operators by the computing resources, and monitoring computing resource usage of graph operators executed by the computing resources according to the first allocation. In addition, the method includes performing, responsive to monitoring computing resource usage, a second allocation of computing resources to execute the plurality of graph operators, and causing, according to the second allocation instead of according to the first allocation, execution of the plurality of graph operators by the computing resources.

    Multi-source breadth-first search (MS-BFS) technique and graph processing system that applies it
    24.
    发明授权
    Multi-source breadth-first search (MS-BFS) technique and graph processing system that applies it 有权

    公开(公告)号：US10540398B2

    公开(公告)日：2020-01-21

    申请号：US15495193

    申请日：2017-04-24

    Applicant: Oracle International Corporation

    Inventor： Martin Sevenich ,  Sungpack Hong ,  Alexander Weld ,  Hassan Chafi ,  Daniel Lehmann

    IPC: G06F16/00 ,  G06F16/901 ,  G06F16/23 ,  G06F16/903

    Abstract: Techniques herein minimize memory needed to store distances between vertices of a graph for use during a multi-source breadth-first search (MS-BFS). In an embodiment, during each iteration of a first sequence of iterations of a MS-BFS, a computer updates a first matrix that contains elements that use a first primitive integer type having a first width to record a distance from a source vertex of a graph to another vertex. The computer detects that a count of iterations of the first sequence of iterations exceeds a threshold. Responsively, the computer creates a second matrix that contains elements that use a second primitive integer type having a second width that is larger than the first width to record a distance from a source vertex of the graph to another vertex. During each iteration of a second sequence of iterations of the MS-BFS, the computer updates the second matrix.

    In-memory graph analytics system that allows memory and performance trade-off between graph mutation and graph traversal
    26.
    发明授权
    In-memory graph analytics system that allows memory and performance trade-off between graph mutation and graph traversal 有权

    公开(公告)号：US10235474B2

    公开(公告)日：2019-03-19

    申请号：US15443327

    申请日：2017-02-27

    Applicant: Oracle International Corporation

    Inventor： Michael Haubenschild ,  Sungpack Hong ,  Hassan Chafi ,  Korbinian Schmid ,  Martin Sevenich ,  Alexander Weld

    IPC: G06F17/30

    Abstract: Techniques herein are for navigation data structures for graph traversal. In an embodiment, navigation data structures that a computer stores include: a source vertex array of vertices; a neighbor array of dense identifiers of target vertices terminating edges; a bidirectional map associating, for each vertex, a sparse identifier of the vertex with a dense identifier of the vertex; and a vertex array containing, when a dense identifier of a source vertex is used as an offset, a pair of offsets defining an offset range, for use with the neighbor array. The source vertex array, using the dense identifier of a particular vertex as an offset, contains an offset, into a neighbor array, of a target vertex terminating an edge originating at the particular vertex. The neighbor array contiguously stores dense identifiers of target vertices terminating edges originating from a same source vertex.

    Methods of Graph-Type Specialization and Optimization in Graph Algorithm DSL Compilation
    27.
    发明申请
    Methods of Graph-Type Specialization and Optimization in Graph Algorithm DSL Compilation 审中-公开

    公开(公告)号：US20190042661A1

    公开(公告)日：2019-02-07

    申请号：US15666310

    申请日：2017-08-01

    Applicant: Oracle International Corporation

    Inventor： Martin Sevenich ,  Sungpack Hong ,  Alexander Weld ,  Hassan Chafi ,  Martijn Dwars

    IPC: G06F17/30 ,  G06F9/44 ,  G06F9/45

    Abstract: Techniques herein generate, such as during compilation, polymorphic dispatch logic (PDL) to switch between specialized implementations of a polymorphic graph algorithm. In an embodiment, a computer detects, within source logic of a graph algorithm, that the algorithm processes an instance of a generic graph type. The computer generates several alternative implementations of the algorithm. Each implementation is specialized to process the graph instance as an instance of a respective graph subtype. The computer generates PDL that performs dynamic dispatch as follows. At runtime, the PDL receives a graph instance of the generic graph type. The PDL detects which particular graph subtype is the graph instance. The PDL then invokes whichever alternative implementation that is specialized to process the graph instance as an instance of the detected particular graph subtype. In embodiments, the source logic is expressed in a domain specific language (DSL), e.g. for analysis, traversal, or querying of graphs.

    DEFINING SUBGRAPHS DECLARATIVELY WITH VERTEX AND EDGE FILTERS
    28.
    发明申请
    DEFINING SUBGRAPHS DECLARATIVELY WITH VERTEX AND EDGE FILTERS 审中-公开

    公开(公告)号：US20180329953A1

    公开(公告)日：2018-11-15

    申请号：US15592050

    申请日：2017-05-10

    Applicant: Oracle International Corporation

    Inventor： Alexander Weld ,  Korbinian Schmid ,  Sungpack Hong ,  Hassan Chafi ,  Hyungyu Shin

    IPC: G06F17/30

    CPC classification number: G06F16/24535 ,  G06F16/248 ,  G06F16/252 ,  G06F16/278 ,  G06F16/9024

    Abstract: Techniques herein optimally distribute graph query processing across heterogeneous tiers. In an embodiment, a computer receives a graph query to extract a query result (QR) from a graph in a database operated by a database management system (DBMS). The graph has vertices interconnected by edges. Each vertex has vertex properties, and each edge has edge properties. The computer decomposes the graph query into filter expressions (FE's). Each FE is processed as follows. A filtration tier to execute the FE is selected from: the DBMS which sends at least the QR to a stream, a stream evaluator that processes the stream as it arrives without waiting for the entire QR to arrive and that stores at least the QR into memory, and an in-memory evaluator that identifies the QR in memory. A translation of the FE executes on the filtration tier to obtain vertices and/or edges that satisfy the FE.

Patent Agency Ranking