Δ-stepping is a famous parallel algorithm for the single-source shortest path problem. It requires a tuning parameter (delta) to achieve a good trade-off between parallelism and work efficiency. The performance of Δ...
详细信息
In this article, a self-driving vehicle controller that optimizes the path a vehicle follows from its initial position to its destination is presented. The methods include clustering-based k-means, hierarchical, Gauss...
详细信息
In this article, a self-driving vehicle controller that optimizes the path a vehicle follows from its initial position to its destination is presented. The methods include clustering-based k-means, hierarchical, Gaussian matrix model, and self-organizing mapping. The real-time parallel implementation of the unsupervised machine learning algorithms could provide fast response times of under one microsecond during the lateral, longitudinal, and angular motion control of the autonomous vehicle. It was observed that a random selection of one of the machine learning methods may not always guarantee the optimality of the position and velocity variables as compared to the desired values. The proposed parallel implementation and optimization of the algorithms could have a significant contribution towards making transportation mobility more reliable and sustainable for future vehicular systems.
This paper presents the performance portable implementation of a kinetic plasma simulation code with C++ parallel algorithm to run across multiple CPUs and GPUs. Relying on the language standard parallelism stdpar and...
详细信息
With the rapid development of society and the continuous improvement of science and technology, people have higher and higher requirements for the quality of life. At the same time, they have put forward higher, stric...
详细信息
The paper considers the NP-hard problem of calculation the reliability of a network, which elements are subject to accidental failures. As network reliability, we mean the probabilistic connectivity of a random graph ...
详细信息
The paper considers the NP-hard problem of calculation the reliability of a network, which elements are subject to accidental failures. As network reliability, we mean the probabilistic connectivity of a random graph with unreliable edges. To evaluate the reliability of a network, a parallel Monte Carlo method is used, improved by checking the connectivity of a particular graph realization simultaneously with the generation of this realization. Based of multi-agent simulation, we study the scalability of this algorithm and tune the parameters for an execution using high-performance supercomputers.
We are concerned with the mapping on high performance hybrid architectures of a parallel software implementing a two level overlapping domain decomposition, that is, along space and time directions, of the four dimens...
详细信息
The matching and linear matroid intersection problems are solvable in quasi-NC, meaning that there exist deterministic algorithms that run in polylogarithmic time and use quasi-polynomially many parallel processors. H...
详细信息
In the maximum satisfiability problem (max-sat) we are given a propositional formula in conjunctive normal form and have to find an assignment that satisfies as many clauses as possible. We study the parallel paramete...
详细信息
Given a text and a pattern over an alphabet, the pattern matching problem searches for all occurrences of the pattern in the text. An equivalence relation ≈ is a substring consistent equivalence relation (SCER), if f...
详细信息
We design a parallel algorithm for the Constrained Shortest Path (CSP) problem. The CSP problem is known to be NP-hard and there exists a pseudo-polynomial time sequential algorithm that solves it. To design the paral...
详细信息
暂无评论