High Performance Algorithm and Computing Analysis Software of DEM Based on GPU Parallel Algorithm

Author(s):  
Shunying Ji ◽  
Lu Liu
Author(s):  
N. A. Likhoded ◽  
A. A. Tolstsikau

Locality is an algorithm characteristic describing a usage level of fast access memory. For example, in case of distributed memory computers we focus on memory of each computational node. To achieve the high performance of algorithm implementation one should choose the best possible locality option. Studying the parallel algorithm locality is to estimate the number and volume of data communications. In this work, we formulate and prove the statements for computers with distributed memory that allow us to estimate the asymptotic volume of data communication operations. These estimation results are useful while comparing alternative versions of parallel algorithms during data communication cost analysis.


Author(s):  
D A Zherdev ◽  
V V Prokudin

In the work there is a modernization of the parallel algorithm for the radar images formation of 3D models with the synthesis of the antenna aperture. In the formation of the scene description, the various structures are used in which it is possible to use more efficient and derived calculations. In addition, it is the topical task to recognize objects on radar images. Thus, on the basis of the implemented parallel program for modelling, the high performance required for simulating multiple radar images can be achieved.


ICGA Journal ◽  
1988 ◽  
Vol 11 (4) ◽  
pp. 165-166 ◽  
Author(s):  
Robert Morgan Hyatt

2016 ◽  
Vol 51 (8) ◽  
pp. 1-11 ◽  
Author(s):  
Ramakrishnan Kannan ◽  
Grey Ballard ◽  
Haesun Park

Author(s):  
R. C. Agarwal ◽  
F. G. Gustavson ◽  
M. Zubair

Sign in / Sign up

Export Citation Format

Share Document