Hyperbolic type explicit kinetic scheme of magneto gas dynamics for high performance computing systems

2015 ◽  
Vol 30 (1) ◽  
Author(s):  
Boris Chetverushkin ◽  
Nicola D’Ascenzo ◽  
Sergey Ishanov ◽  
Valeri Saveliev
Keyword(s):  
High Performance Computing ◽  
Gas Dynamics ◽  
High Performance ◽  
Main Idea ◽  
Kinetic Scheme ◽  
Computing Systems ◽  
Method Of Solution ◽  
Gas Dynamics Problems ◽  
Dynamics Problems ◽  
Performance Computing

AbstractThe article presents the developments of the kinetic consistent approach of solution of the magneto gas dynamics problems on the high performance computing systems with massive parallelism. The main idea is to derive the magneto gas dynamic equations from the Boltzmann equation using a complex distribution function, including the electromagnetic terms. The derived equations were used for the formulation of the explicit numerical method of solution for the high performance parallel computing systems. The numerical experiments were performed for the verification of the chosen method.

scholarly journals Application-based fault tolerance techniques for sparse matrix solvers

2017 ◽  
Vol 32 (5) ◽  
pp. 627-640
Author(s):  
Simon McIntosh–Smith ◽  
Rob Hunt ◽  
James Price ◽  
Alex Warwick Vesztrocy
Keyword(s):  
Fault Tolerance ◽  
High Performance Computing ◽  
High Performance ◽  
Sparse Matrix ◽  
Sparse Matrices ◽  
Error Correcting Codes ◽  
Computing Systems ◽  
Hardware Costs ◽  
Extreme Scale ◽  
Performance Computing

High-performance computing systems continue to increase in size in the quest for ever higher performance. The resulting increased electronic component count, coupled with the decrease in feature sizes of the silicon manufacturing processes used to build these components, may result in future exascale systems being more susceptible to soft errors caused by cosmic radiation than in current high-performance computing systems. Through the use of techniques such as hardware-based error-correcting codes and checkpoint-restart, many of these faults can be mitigated at the cost of increased hardware overhead, run-time, and energy consumption that can be as much as 10–20%. Some predictions expect these overheads to continue to grow over time. For extreme scale systems, these overheads will represent megawatts of power consumption and millions of dollars of additional hardware costs, which could potentially be avoided with more sophisticated fault-tolerance techniques. In this paper we present new software-based fault tolerance techniques that can be applied to one of the most important classes of software in high-performance computing: iterative sparse matrix solvers. Our new techniques enables us to exploit knowledge of the structure of sparse matrices in such a way as to improve the performance, energy efficiency, and fault tolerance of the overall solution.

Sign in / Sign up

Export Citation Format

Share Document