Parallel Algorithms
Recently Published Documents


TOTAL DOCUMENTS

2282
(FIVE YEARS 271)

H-INDEX

54
(FIVE YEARS 8)

10.1142/12744 ◽  
2022 ◽  
Author(s):  
Muhammad Hamad Alsuwaiyel
Keyword(s):  

2022 ◽  
Vol 19 (3) ◽  
pp. 2700-2719
Author(s):  
Siyuan Yin ◽  
◽  
Yanmei Hu ◽  
Yuchun Ren

<abstract> <p>Many systems in real world can be represented as network, and network analysis can help us understand these systems. Node centrality is an important problem and has attracted a lot of attention in the field of network analysis. As the rapid development of information technology, the scale of network data is rapidly increasing. However, node centrality computation in large-scale networks is time consuming. Parallel computing is an alternative to speed up the computation of node centrality. GPU, which has been a core component of modern computer, can make a large number of core tasks work in parallel and has the ability of big data processing, and has been widely used to accelerate computing. Therefore, according to the parallel characteristic of GPU, we design the parallel algorithms to compute three widely used node centralities, i.e., closeness centrality, betweenness centrality and PageRank centrality. Firstly, we classify the three node centralities into two groups according to their definitions; secondly, we design the parallel algorithms by mapping the centrality computation of different nodes into different blocks or threads in GPU; thirdly, we analyze the correlations between different centralities in several networks, benefited from the designed parallel algorithms. Experimental results show that the parallel algorithms designed in this paper can speed up the computation of node centrality in large-scale networks, and the closeness centrality and the betweenness centrality are weakly correlated, although both of them are based on the shortest path.</p> </abstract>


Mathematics ◽  
2021 ◽  
Vol 9 (22) ◽  
pp. 2966
Author(s):  
Petr Martyshko ◽  
Igor Ladovskii ◽  
Denis Byzov

The paper describes a method of gravity data inversion, which is based on parallel algorithms. The choice of the density model of the initial approximation and the set on which the solution is sought guarantees the stability of the algorithms. We offer a new upward and downward continuation algorithm for separating the effects of shallow and deep sources. Using separated field of layers, the density distribution is restored in a form of 3D grid. We use the iterative parallel algorithms for the downward continuation and restoration of the density values (by solving the inverse linear gravity problem). The algorithms are based on the ideas of local minimization; they do not require a nonlinear minimization; they are easier to implement and have better stability. We also suggest an optimization of the gravity field calculation, which speeds up the inversion. A practical example of interpretation is presented for the gravity data of the Urals region, Russia.


2021 ◽  
Author(s):  
Viktor I. Orlov ◽  
Ivan P. Rozhnov ◽  
Lev A. Kazakovtsev ◽  
Olga S. Stephanenko ◽  
Tatyana V. Strekaleva ◽  
...  

2021 ◽  
Vol 36 (1) ◽  
Author(s):  
Michael E. Akintunde ◽  
Elena Botoeva ◽  
Panagiotis Kouvaros ◽  
Alessio Lomuscio

AbstractWe introduce a model for agent-environment systems where the agents are implemented via feed-forward ReLU neural networks and the environment is non-deterministic. We study the verification problem of such systems against CTL properties. We show that verifying these systems against reachability properties is undecidable. We introduce a bounded fragment of CTL, show its usefulness in identifying shallow bugs in the system, and prove that the verification problem against specifications in bounded CTL is in coNExpTime and PSpace-hard. We introduce sequential and parallel algorithms for MILP-based verification of agent-environment systems, present an implementation, and report the experimental results obtained against a variant of the VerticalCAS use-case and the frozen lake scenario.


Sign in / Sign up

Export Citation Format

Share Document