44 results about "Graph partition" patented technology

Methods, machines, and stored instructions are provided for partitioning a graph of nodes into clusters of nodes by iteratively excluding edges in the graph. For each node of at least a subset of nodes in the graph, a graph partitioning module determines whether to exclude edges for the node and, if so, selects for exclusion edge(s) to at least a subset of the node's neighbor(s). The module selects edge(s) to the node's neighbor(s) for exclusion based at least in part on a degree of overlap between the node's neighbor(s) and neighbor(s) of the node's neighbor(s). For any subset(s) that are yet not sufficiently partitioned into clusters, the module repeats the step of determining whether to exclude edges and, if so, selecting nodes for exclusion, and determining whether or not the nodes are sufficiently partitioned. Subset(s) of nodes that are already sufficiently partitioned may be skipped during the repeated steps.

A method, computer program product, and a data processing system for determining an edge for inversion in a cyclic compound directed graph. A plurality of graph nodes of a graph are evaluated for generation of a first node order subset pair. A determination that the graph requires a recursive evaluation for completing node ordering of the plurality of graph nodes is made. The graph is divided into a plurality of graph partitions, and respective node order subset pairs are generated for the graph partitions.

The invention discloses a multi-scale fusion network simulation task mapping method in a heterogeneous environment, which solves the deployment problem of a virtual network topology in a heterogeneous computing cluster environment. The steps of the method include: reading into a heterogeneous computing environment; Mark the edge routers and host nodes in the topology as lightweight virtualization mapping areas, and mark the remaining nodes as converged virtualization mapping areas; according to the throughput threshold of each server, use lightweight virtualization mapping for lightweight virtualization mapping Nodes in the area; calculate the load balance parameters of the remaining servers, use the multi-level graph partition algorithm to allocate nodes in the fusion mapping area, judge whether the server is redundant, and use different optimization algorithms to optimize and map reasonably according to the results. The invention ensures load balance between computing clusters, reduces remote communication, improves the performance of large-scale network simulation, and has good scalability and scalability for large-scale network topology, and can be used for various network research and experimental networks.

The present application relates to a method, system, device, and storage medium for counting the number of vertices and edges in a graph database, wherein the method includes: obtaining a task request for counting the number of vertices and edges in the graph space, and checking the preset preparation queue in the preparation queue according to the task request. Task, returns the ID of the preset preparatory task, writes the information record of the preset preparatory task in the system table of the preset preparatory task according to the ID of the preset preparatory task, and writes the graph in the system table of statistical information according to the ID of the graph space For spatial information records, the preset preparatory tasks are grouped according to the Leader node to which the graph partition belongs, and several preset execution tasks are obtained, and the preset execution tasks are run through the storage node. It solves the problem of how to reduce the waste of computing resources and improve the efficiency of real-time statistical data, and realizes an efficient parallel strategy for point-edge statistical tasks based on the job mechanism and task mechanism in Nebula Graph.

The invention discloses a block-based subgraph construction and distributed graph processing method. The block-based subgraph construction method comprises partitioning a graph, relabeling summits in the graph, associating intervals with shards, partitioning blocks and constructing subgraphs, and employs a heuristic and lightweight SGP (Streaming Graph Partition) method to partition a graph, and a user-defined heuristic function to designate the summits to P subgraphs in order; the method possesses the characteristics of high performance and low edge cutting rate, and considers subgraph work load balance. According to a distributed graph processing system, after partitioning, subgraphs perform communication by employing a whole memory block as a unit; compared with the fine grit communication mode of the prior art, the distributed graph processing system exchanges data based on a memory block, and can fully utilize network bandwidth and reduce communication time.