Parallel breadth-first search method based on shared memory system structure

A technology of breadth-first search and architecture, which is applied in the fields of instruments, computing, and electrical digital data processing, etc., can solve problems such as increased memory consumption, additional storage space, and limited program scalability, so as to reduce access conflicts and improve memory access efficiency , Improve the effect of program running speed

Inactive Publication Date: 2016-10-19
PEKING UNIV
View PDF4 Cites 8 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

In an application where only one breadth-first search is required, this preparation time is prohibitive
In order to maintain the information of the subgraphs divided into, this method requires additional storage space
In addition, for undirected graphs, this method needs to store two copies of an edge in different forms of incoming and outgoing e

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
  • Parallel breadth-first search method based on shared memory system structure
  • Parallel breadth-first search method based on shared memory system structure

Examples

Experimental program
Comparison scheme
Effect test

Example Embodiment

[0043] Below in conjunction with accompanying drawing, further describe the present invention through embodiment, but do not limit the scope of the present invention in any way.

[0044] The parallel breadth-first search method based on the shared memory architecture provided by the present invention includes worker thread grouping and binding process, data interval division process and task execution process.

[0045] figure 1 It is a flow chart of the process of grouping and binding worker threads in the present invention. like figure 1 As shown, the worker thread grouping and binding process includes obtaining the CPU topology, generating and grouping worker threads, and binding the worker thread group to the CPU socket; the details are as follows:

[0046] 1) Worker thread grouping and binding process:

[0047] 1.1) The main thread obtains the CPU topology of the running environment.

[0048] The specific implementation is in the Linux environment, by obtaining the CPU...

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 discloses a parallel breadth-first search method based on a shared memory system structure. The method comprises: a worker thread grouping and binding process, a data interval partition process, and a task execution process. The method specifically comprises: obtaining a CPU topological structure of an operating environment, partitioning and binding a worker thread group; partitioning data intervals, and making the data intervals corresponding to the worker thread groups; task execution using a hierarchical ergodic method, in an execution process, automatically selecting a proper state from a series top-down state, a parallel top-down state, and a bottom-up state, as a self execution state, and when count in an activated state in a certain layer is zero, ending task execution. The method reduces communication among CPU sockets through task partition, data consistency maintenance among the CPU sockets is eliminated, and improves data reading efficiency through data binding and automatic switching, so as to improve operation efficiency of program.

Description

technical field [0001] The invention relates to a parallel breadth-first search method, in particular to a high-efficiency parallel breadth-first search task division method and task scheduling strategy on a multi-socket shared memory architecture. Background technique [0002] Breadth-first search method is an important search method based on graph structure data. Graph structure data G usually consists of a set V of vertices and a set E of edges between the vertices. Any edge e=(u, v) means that there is an edge from vertex u to vertex v. Given a root vertex r, the breadth-first search method finds all vertices reachable by the root vertex r by expanding outward through the boundary between found and unfound vertices. In this search process, the breadth-first search method builds a breadth-first search tree. The parent-child vertex relationship in the tree means that the child vertex v is reached by the expansion of the parent vertex u. The execution time overhead of t...

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): G06F17/30
Inventor 余华山胡子千王娜孟佳
Owner PEKING UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

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

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap