parallel calculation
Recently Published Documents


TOTAL DOCUMENTS

93
(FIVE YEARS 18)

H-INDEX

9
(FIVE YEARS 1)

2022 ◽  
Vol 70 (1) ◽  
pp. 491-504
Author(s):  
Hyun-Sun Hwang ◽  
Jae-Hyun Ro ◽  
Chan-Yeob Park ◽  
Young-Hwan You ◽  
Hyoung-Kyu Song

2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Bingjie Zhang ◽  
Yiming Liu

With the rapid development of information society, a large amount of vague or uncertain English interpretation information appears in daily life. Uncertain information processing is an important research content in the field of artificial intelligence. In this paper, we combine the three-branch concept lattice and linguistic values with the digital elevation model and propose the three-branch fuzzy linguistic concept lattice as well as the attribute approximation method. In this paper, an improved serial algorithm for sink accumulation is proposed. The improved algorithm changes the order of cell calculation; after the cumulative amount of a “sub-basin” is calculated, all cells of the next “sub-basin” are calculated until all cells are calculated. The improved algorithm reduces the overhead space in the calculation process, reduces the pressure of cells entering and leaving the queue, and improves the calculation efficiency. The improved cumulant algorithm is compared with the commonly used recursive cumulant algorithm and the nonrecursive cumulant algorithm, and the improved algorithm improves by about 17% compared with the nonrecursive algorithm at 106 cell level, and the computation time of the recursive algorithm is about 3 times of the improved algorithm. Because the sink accumulation serial algorithm is an important part of the parallel calculation of sink accumulation, and the execution time is shorter by using the improved algorithm, this paper applies the proposed improved accumulation serial algorithm to the process of parallel calculation of accumulation.


2021 ◽  
Vol 2021 ◽  
pp. 1-10
Author(s):  
Zhihua Xu

Aiming at the problem of slow convergence in the parallel calculation of patch area landscape art index, a parallel calculation method of patch area landscape art index based on land cover data was proposed. Firstly, patch type area index, patch connectivity index, patch number index, and fragmentation index were selected as patch area landscape art spatial staggered pattern indexes to conduct characteristic analysis and establish a 3D visual reconstruction model with actual colors. Then, the coordinate points of the landscape space staggered pattern are transformed into three-dimensional visual coordinate points to realize the reconstruction of landscape art space staggered pattern in patch area. The aerial landscape image of patch area is preprocessed and input into GPU to build a Gaussian difference pyramid model. The feature points of the patch area in the aerial landscape image are calculated by the parallel computing process, and the patch boundary in the aerial landscape image is determined. The landscape perimeter of the patch area was calculated according to the boundary. The experimental results show that the complete convergence time of the horizontal axis error and the vertical axis error is 2.13 s and 1.81 s, respectively, and the absolute error and relative error of the perimeter measurement are controlled below 0.60 m and 1.00%, respectively.


2021 ◽  
Vol 2021 ◽  
pp. 1-19
Author(s):  
Xuanhua Fan ◽  
Jun Liang ◽  
Keying Wang ◽  
Huan Zhou

The reentry vehicle is in an unconstrained free-flight state during the reentry process. The pressure of air fluctuations acts on the external surface of the vehicle and induces a random vibration environment with a wide-frequency range, which makes great influences on the structural dynamic properties of vehicles. This paper aims at the parallel calculation of the wide-frequency random vibration problems for the free body under multipoint fluctuating pressure loads. The calculation method is based on the self-developed JAUMIN framework and PANDA platform. The novel algorithm based on the modal superposition method reduces the computational complexity, realizes the parallel calculation, and achieves the maximum numerical simulation calculation capacity of 1.045 billion degrees of freedom (DOFs) while improving the calculation efficiency and the accuracy of the results. Finally, this article also uses typical examples to verify the correctness and parallel scalability of algorithms and programs.


2021 ◽  
Vol 11 (5) ◽  
pp. 2076
Author(s):  
Gregorio Sánchez-Olivares ◽  
Antonio Tomás

A simple formulation for the optimal design of reinforced concrete sections under compression and biaxial bending was established in a previous work by the authors. In that work, it was found that the formulation produced satisfactory results when used together with three algorithms that belong to the nature-inspired meta-heuristic algorithm group. However, despite the favorable results obtained, the necessary calculation times were extensive in all the cases. In order to solve this problem, the authors implemented a parallel calculation strategy in the algorithm that gave better results in the previous work. It was possible to verify, through two examples, that this strategy reduces calculation times as more processes are used in parallel, and that the adjustments made in the algorithm favor reaching designs close to the global optimum independently of the number of parallel processes adopted.


Sign in / Sign up

Export Citation Format

Share Document