PHAST Library — Enabling Single-Source and High Performance Code for GPUs and Multi-cores

Author(s):  
Biagio Peccerillo ◽  
Sandro Bartolini
2013 ◽  
Vol 9 (2) ◽  
pp. 620-629 ◽  
Author(s):  
Ciro Attaianese ◽  
Mauro Di Monaco ◽  
Giuseppe Tomasso

2016 ◽  
Vol 6 (1) ◽  
Author(s):  
Ping Fan ◽  
Di Gu ◽  
Guang-Xing Liang ◽  
Jing-Ting Luo ◽  
Ju-Long Chen ◽  
...  

ChemCatChem ◽  
2019 ◽  
Vol 11 (2) ◽  
pp. 885-892 ◽  
Author(s):  
Phil Preikschas ◽  
Julia Bauer ◽  
Xing Huang ◽  
Shenglai Yao ◽  
Raoul Naumann d'Alnoncourt ◽  
...  

2018 ◽  
Vol 54 (76) ◽  
pp. 10714-10717 ◽  
Author(s):  
Maofan Li ◽  
Kai Yang ◽  
Jiajie Liu ◽  
Xiaobing Hu ◽  
Defei Kong ◽  
...  

A heterobimetallic single-source precursor, NaCo(acac)3, featuring a 1D chain structure was for the first time designed to achieve layered oxide P2-NaxCoO2 with superior rate capability for Na-ion batteries (SIBs). It opens a new avenue to synthesize high-performance layered oxide cathode materials for SIBs.


Robotica ◽  
2019 ◽  
Vol 38 (2) ◽  
pp. 207-234
Author(s):  
Dmitry A. Sinyukov ◽  
Taşkin Padir

SummaryPath planning on a two-dimensional grid is a well-studied problem in robotics. It usually involves searching for a shortest path between two vertices on a grid given that some of the grid cells are impassable (occupied by obstacles). Single-source path planning finds shortest paths from a given source vertex to all other vertices of the grid. Singles-source path planning enhances robot autonomy by calculating multiple possible paths for various navigation scenarios when the destination state is unknown. A high-performance algorithm for single-source any-angle path planning on a grid called CWave is proposed here. Any-angle attribute implies that the algorithm calculates paths which can include line segments at any angle, as opposed to standard A* that runs on an 8-connected graph, which permits turns with 45° increments only. The key idea of CWave is to abandon the graph model and operate directly on the grid geometry using discrete geometric primitives (instead of individual vertices) to represent the wave front. In its most basic form (CWaveInt), CWave requires only integer arithmetics. CWaveInt, however, can accumulate the distance error at turning points. A modified version of CWave (CWaveFpuSrc) with minimal usage of floating-point calculations is also developed to eliminate any accumulative errors, which is proven mathematically and experimentally on several maps. The performance of the algorithm on most of the tested maps is demonstrated to be significantly faster than that of Theta*, Lazy Theta*, Field A*, ANYA, Block A*, and A* adapted for single-source planning (on maps with lower number of isolated obstacles, CWaveFpuSrc is 2−3 times faster than its fastest tested alternative Block A*). An N-threaded implementation (CWaveN) of CWave is presented and tested to demonstrate an improved performance (multithreaded implementation is 1.5−3 times faster than single-threaded CWave). The paper discusses foundations and experimental validation of CWave, and presents future work to address the limitations of the current implementations and obtain further performance enhancements.


Sign in / Sign up

Export Citation Format

Share Document