Supercharge Your Innovation With Domain-Expert AI Agents!

Large-scale graph parallel computing maximum flow acceleration algorithm based on cutting point segmentation mechanism

A maximum-flow, large-scale technology, applied in computing, program control design, resource allocation, etc., can solve the problem of low efficiency of the maximum flow method

Inactive Publication Date: 2019-07-26
HENAN UNIVERSITY OF TECHNOLOGY
View PDF4 Cites 1 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0005] The main purpose of the present invention is to solve the problem of low efficiency of the existing method for solving large-scale graph maximum flow, and propose a maximum flow acceleration method for large-scale graph calculation on the parallel framework GraphChi based on the cut point segmentation mechanism to improve computing efficiency

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Large-scale graph parallel computing maximum flow acceleration algorithm based on cutting point segmentation mechanism
  • Large-scale graph parallel computing maximum flow acceleration algorithm based on cutting point segmentation mechanism
  • Large-scale graph parallel computing maximum flow acceleration algorithm based on cutting point segmentation mechanism

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0079] by figure 1 , figure 2 and image 3 (in, figure 1 The solid circle in the figure on the left represents the vertex, the letter represents the label of the vertex, the dotted line represents the edge between two points, the shaded vertex s represents the sink point, and the shaded vertex t represents the sink point, figure 1 The dotted circle in the figure on the right indicates the vertices of the overlay graph, the uppercase letters indicate the vertex label, and the solid line indicates the edge between two overlay graph vertices; figure 2 The shaded vertices constitute the only path from the source point to the sink point of the covering graph, and the graph next to each vertex is the subgraph corresponding to the vertex; image 3 Rectangular points represent the parallel time-node scale relationship diagram, image 3 Filled dots represent serial line time-node scale relationship diagram) as an example, describe the implementation process of the present inventi...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention relates to a large-scale graph parallel computing maximum flow acceleration algorithm based on a cutting point segmentation mechanism. The method comprises the following key steps: 1) constructing a coverage map of a large-scale map; 2) determining a unique path corresponding to the coverage map from the source point to the sink point; and 3) submitting all the sub-graphs corresponding to the vertexes on the path to a GraphChi platform to carry out parallel maximum flow calculation and integrate the maximum flow of the sub-graphs. According to the method, the independence of maximum flow calculation of each subgraph is ensured, the number of communication times is reduced, the result is integrated through parallel calculation of the maximum flow, the calculation efficiency and correctness of the maximum flow are ensured, the maximum flow problem of a large-scale graph can be solved, and the calculation speed for solving the maximum flow is remarkably increased. Experimental results show that the method can make full use of the features of the problem to cope with the scene of calculating the maximum flow in a large-scale graph, and can effectively accelerate the calculation speed of the maximum flow compared with a classical algorithm.

Description

technical field [0001] The invention relates to an acceleration method for calculating the maximum flow of a large-scale graph, which is a method for quickly calculating the maximum flow on a parallel graph computing framework GraphChi in combination with a cut point segmentation algorithm. Background technique [0002] With the continuous development of science and technology, data generated in transportation, information services, telecommunications and other fields are growing at an explosive rate. Usually these data are presented in the form of large-scale graphs. The largest traffic flow in urban traffic, Double Eleven Many practical problems, such as the carrying capacity of user transaction information transmission and the number of simultaneous calls in a region, can be transformed into the maximum flow problem. The maximum flow problem in large-scale graphs has become an important research direction in the graph theory system. The existing network maximum flow probl...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
IPC IPC(8): G06F9/50G06F9/46
CPCG06F9/5016G06F9/466
Inventor 张永新魏蔚张如青邢征
Owner HENAN UNIVERSITY OF TECHNOLOGY
Features
  • R&D
  • Intellectual Property
  • Life Sciences
  • Materials
  • Tech Scout
Why Patsnap Eureka
  • Unparalleled Data Quality
  • Higher Quality Content
  • 60% Fewer Hallucinations
Social media
Patsnap Eureka Blog
Learn More

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2025 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com