A method for testing the big data processing capacity of a super computer based on heuristic traversal

A technology of big data processing and supercomputer, applied in the direction of electric digital data processing, calculation, error detection/correction, etc.

Active Publication Date: 2019-04-26
NAT UNIV OF DEFENSE TECH
View PDF2 Cites 3 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0011] The technical problem to be solved by the present invention is: using the characteristic that the preprocessing before BFS traversal is not counted as time-consuming, a heuristic traversal-based supercomputer big data processing ability testing method is proposed to reduce the number of memory accesses and avoid invalid memory accesses to the greatest extent Compared with Graph500, it accelerates the traversal of the graph and improves the test speed of supercomputer big data processing ability

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
  • A method for testing the big data processing capacity of a super computer based on heuristic traversal
  • A method for testing the big data processing capacity of a super computer based on heuristic traversal
  • A method for testing the big data processing capacity of a super computer based on heuristic traversal

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0066] Such as image 3 Shown, the steps of the present invention are as follows:

[0067] The first step, graph generation. Use the Kronecker graph generator to generate a random graph structure G=(V,E), V is a set of vertices, which contains N V vertices, N V is a positive integer, E is a set of edges, and E contains N E side, N E is a positive integer;

[0068] The second step is to construct the adjacency matrix A of the graph G. A ij = 0 means there is no edge between vertex i and vertex j, A ij =1 means there is an edge between vertex i and vertex j, 0≤i≤N V -1, 0≤j≤N V -1, i and j are both positive integers;

[0069] The third step, preprocessing, determines the degree of each vertex, the specific method is as follows:

[0070] Traverse each vertex in V, record the degree of each vertex, and get a set of binary groups The i-th element in Di ,deg(v i )> means the vertex v i The degree is deg(v i ), that is, deg(v i ) vertices and vertex v i There is an ...

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 method for testing the big data processing capacity of a super computer based on heuristic traversal. The method is used for improving the testing speed of the big data processing capacity of the super computer. The technical scheme includes: generating graph; constructing an adjacent matrix of the graph, determining degrees of vertexes through preprocessing, performing heuristic traversal search based on the degrees of the vertexes, exiting the traversal of sub-nodes of the current node in advance if all edges meeting the degrees of the vertexes are searched for alltimes in the same layer of traversal, not continuing to traverse other sub-nodes, and directly performing the traversal of the next layer. By adopting the method, blind traversal can be avoided, unnecessary search is reduced, unnecessary memory access is avoided, graph traversal is accelerated, and the test speed of the big data processing capacity of the super computer is increased.

Description

technical field [0001] The invention relates to a method for testing the large data processing capability of a supercomputer, in particular to a method for testing the large data processing capability of a supercomputer based on heuristic traversal. Background technique [0002] Graph structure is one of the most important data structures in big data applications, and has been widely used in many fields, such as social media, bioinformatics, astrophysics, artificial intelligence, data mining, etc. The common feature of these applications is the large amount of data and complex structure, which can often reach billions of edges and trillions of nodes, which leads to higher demands on data storage and computing power. Supercomputers are mainly used for numerical calculations, and most HPC benchmarks use computing power as a measure, such as HPL used by Top 500; in the era of big data where data-intensive applications are widely emerging, Graph500, as an important supplement to...

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
Patent Type & Authority Applications(China)
IPC IPC(8): G06F11/34
CPCG06F11/3428
Inventor 甘新标曾瑞庚吴涛杨志辉孙泽文刘杰龚春叶李胜国杨博徐涵晏益慧
Owner NAT UNIV OF DEFENSE TECH
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