A Parallel Method of Line Assignment to Remove Data Races in Parallel Particle Simulation Algorithms

A data competition and particle technology, applied in the direction of electrical digital data processing, computing, multi-programming devices, etc., can solve the problem of low parallel efficiency and achieve the effect of improving efficiency

Active Publication Date: 2019-05-14
UNIV OF ELECTRONICS SCI & TECH OF CHINA
View PDF6 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0008] In view of the above existing problems or deficiencies, in order to solve the problem of low parallel efficiency due to data competition in the parallel process of one-dimensional particle simulation programs, the present invention provides a line allocation parallel method for removing data competition in parallel particle simulation algorithms

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 Parallel Method of Line Assignment to Remove Data Races in Parallel Particle Simulation Algorithms
  • A Parallel Method of Line Assignment to Remove Data Races in Parallel Particle Simulation Algorithms
  • A Parallel Method of Line Assignment to Remove Data Races in Parallel Particle Simulation Algorithms

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0024] The present invention will be described in further detail below in conjunction with the accompanying drawings and embodiments.

[0025] Assuming nMax=3, then Ns=7.

[0026] Firstly, a continuous grid set with a length of Ns=7 is taken as a unit, numbered 1, 2, . Such as Figure 4 shown.

[0027] Then extract the grids with the same number and put them into a set, and finally 7 sets can be generated, such as Figure 5 shown. All grids numbered 1 form the first set, all grids numbered 2 form the second set, and so on until all grids numbered 7 form the seventh set.

[0028] In each of the seven collections, all the grids in it have no data race, so the collection can be directly parallelized. Execute serially between the last 7 collections.

[0029] In summary, the present invention eliminates the data competition in the parallelization of the particle simulation algorithm by adopting the above line allocation parallel method, and obviously improves the parallel eff...

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 belongs to the technical field of parallel particle simulation methods, in particular to a line allocation parallel method for removing data competition in parallel particle simulation algorithms. The present invention solves by setting: the data competition influence range of a grid in the one-dimensional particle simulation algorithm Ns=2×nMax+1 grid, and nMax is the maximum value of the data competition influence range of a grid in the one-dimensional particle simulation algorithm ; Then add a number for subsequent application of the method of removing data competition for all grids. The numbering rule takes the grid set with a length of Ns number as a unit, numbering 1‑Ns in turn, and looping like this until all grids are traversed Then extract the grids with the same number and put them into a collection to generate Ns collections, each of the Ns collections has no data competition in all the grids; finally serialize the Ns collections implement. The invention significantly improves the parallel efficiency of the particle simulation algorithm by eliminating data competition.

Description

technical field [0001] The invention belongs to the field of particle simulation method parallel technology. In the realization of one-dimensional particle simulation algorithm and its parallelization process through computer programs, it involves a parallel method of how to remove data competition in the parallel process of one-dimensional algorithm, specifically a line for removing data competition in parallel particle simulation algorithm Allocate parallel methods. Background technique [0002] In fields involving the interaction between fields and charged particles, such as gas discharge and vacuum electronic devices, the charged particles move under the action of the field, thereby changing the distribution of charged particles in space. The state of the particle in turn affects the field distribution in space. In the process of the interaction between the above-mentioned field and charged particles, sometimes the structure and physical properties satisfy the plane sy...

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 Patents(China)
IPC IPC(8): G06F9/52
CPCG06F9/526
Inventor 黄桃金晓林何英杰朱小芳李斌胡玉禄胡权徐立杨中海贺国贤
Owner UNIV OF ELECTRONICS SCI & TECH OF CHINA
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