Optimal Strategy for Modelling Turbulent Flows with Ensemble Averaging on High Performance Computing Systems

2018 ◽  
Vol 39 (4) ◽  
pp. 533-542
Author(s):  
B. I. Krasnopolsky
2011 ◽  
Vol 64 (2) ◽  
Author(s):  
Giancarlo Alfonsi

The direct numerical simulation of turbulence (DNS) has become a method of outmost importance for the investigation of turbulence physics, and its relevance is constantly growing due to the increasing popularity of high-performance-computing techniques. In the present work, the DNS approach is discussed mainly with regard to turbulent shear flows of incompressible fluids with constant properties. A body of literature is reviewed, dealing with the numerical integration of the Navier-Stokes equations, results obtained from the simulations, and appropriate use of the numerical databases for a better understanding of turbulence physics. Overall, it appears that high-performance computing is the only way to advance in turbulence research through the front of the direct numerical simulation.


Author(s):  
Simon McIntosh–Smith ◽  
Rob Hunt ◽  
James Price ◽  
Alex Warwick Vesztrocy

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