Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

A Volume Assignment Parallel Method for Removing Data Races in Parallel Particle Simulation Algorithms

A data competition and particle technology, applied in the fields of electrical digital data processing, special data processing applications, computing, etc., can solve the problems of low parallel efficiency and achieve the effect of improving efficiency

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

AI Technical Summary

Problems solved by technology

[0008] In view of the above-mentioned problems or deficiencies, in order to solve the problem of low parallel efficiency due to data competition in the parallel process of three-dimensional particle simulation programs, the present invention provides a volume allocation parallel method that removes 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 Volume Assignment Parallel Method for Removing Data Races in Parallel Particle Simulation Algorithms
  • A Volume Assignment Parallel Method for Removing Data Races in Parallel Particle Simulation Algorithms
  • A Volume Assignment Parallel Method for Removing Data Races in Parallel Particle Simulation Algorithms

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

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

[0026] Assuming nMax=1, then Ns=3, Nc=27.

[0027] Firstly, take the continuous grid set whose length, width and height are Ns=3 as the unit, number them 1, 2, ..., 27 in sequence, and repeat this until all the grids are traversed. like Figure 4 shown.

[0028] Then extract the grids with the same number and put them into a collection, and finally 27 collections 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 27 form the 27th set.

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

[0030] In summary, the present invention eliminates the data competition in the parallelization of the particle simulat...

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 volume allocation parallel method for removing data competition in parallel particle simulation algorithms. The present invention sets: the data competition influence range of a grid in the three-dimensional particle simulation algorithm Nc=Ns×Ns×Ns, wherein Ns=2×nMax+1, and nMax is the data competition influence of a grid in the three-dimensional particle simulation algorithm The maximum value of the range; then add a number to all grids for the subsequent application of the method of removing data competition. The numbering rule takes the grid set whose length, width and height are Ns as the unit, and is numbered 1-Ns in turn, and based on this Loop until all the grids are traversed; then extract the grids with the same number and put them into a set to generate Nc sets; finally execute the Nc sets in series. 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 process of realizing the three-dimensional particle simulation algorithm and its parallelization through computer programs, it involves a parallel method of how to remove data competition in the parallel process of the three-dimensional algorithm, specifically a volume allocation to remove data competition in the parallel process of the three-dimensional particle simulation algorithm Parallel method. 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 above-mentioned interaction process between the field and charged particles, neither the structure nor th...

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): G06F17/50
CPCG06F30/20
Inventor 黄桃金晓林谷晓梁朱小芳李斌胡玉禄胡权徐立杨中海贺国贤
Owner UNIV OF ELECTRONICS SCI & TECH OF CHINA
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

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

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