Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userComputational steering of complex flow simulations
128
0
0.0
(
0
)
Authors
Atanas Atanasov
Ask ChatGPT about the research
No Arabic abstract
Computational Steering, the combination of a simulation back-end with a visualisation front-end, offers great possibilities to exploit and optimise scenarios in engineering applications. Due to its interactivity, it requires fast grid generation, simulation, and visualisation and, therefore, mostly has to rely on coarse and inaccurate simulations typically performed on rather small interactive computing facilities and not on much more powerful high-performance computing architectures operated in batch-mode. This paper presents a steering environment that intends to bring these two worlds - the interactive and the classical HPC world - together in an integrated way. The environment consists of efficient fluid dynamics simulation codes and a steering and visualisation framework providing a user interface, communication methods for distributed steering, and parallel visualisation tools. The gap between steering and HPC is bridged by a hierarchical approach that performs fast interactive simulations for many scenario variants increasing the accuracy via hierarchical refinements in dependence of the time the user wants to wait. Finally, the user can trigger large simulations for selected setups on an HPC architecture exploiting the pre-computations already done on the interactive system.
rate research
Read More
There is currently limited understanding of the role played by haemodynamic forces on the processes governing vascular development. One of many obstacles to be overcome is being able to measure those forces, at the required resolution level, on vessels only a few micrometres thick. In the current paper, we present an in silico method for the computation of the haemodynamic forces experienced by murine retinal vasculature (a widely used vascular development animal model) beyond what is measurable experimentally. Our results show that it is possible to reconstruct high-resolution three-dimensional geometrical models directly from samples of retinal vasculature and that the lattice-Boltzmann algorithm can be used to obtain accurate estimates of the haemodynamics in these domains. We generate flow models from samples obtained at postnatal days (P) 5 and 6. Our simulations show important differences between the flow patterns recovered in both cases, including observations of regression occurring in areas where wall shear stress gradients exist. We propose two possible mechanisms to account for the observed increase in velocity and wall shear stress between P5 and P6: i) the measured reduction in typical vessel diameter between both time points, ii) the reduction in network density triggered by the pruning process. The methodology developed herein is applicable to other biomedical domains where microvasculature can be imaged but experimental flow measurements are unavailable or difficult to obtain.
Computational fluid dynamics is a direct modeling of physical laws in a discretized space. The basic physical laws include the mass, momentum and energy conservations, physically consistent transport process, and similar domain of dependence and influence between the physical reality and the numerical representation. Therefore, a physically soundable numerical scheme must be a compact one which involves the closest neighboring cells within the domain of dependence for the solution update under a CFL number $(sim 1 )$. In the construction of explicit high-order compact scheme, subcell flow distributions or the equivalent degree of freedoms beyond the cell averaged flow variables must be evolved and updated, such as the gradients of the flow variables inside each control volume. The direct modeling of flow evolution under generalized initial condition will be developed in this paper. The direct modeling will provide the updates of flow variables differently on both sides of a cell interface and limit high-order time derivatives of the flux function nonlinearly in case of discontinuity in time, such as a shock wave moving across a cell interface within a time step. The direct modeling unifies the nonlinear limiters in both space for the data reconstruction and time for the time-dependent flux transport. Under the direct modeling framework, as an example, the high-order compact gas-kinetic scheme (GKS) will be constructed. The scheme shows significant improvement in terms of robustness, accuracy, and efficiency in comparison with the previous high-order compact GKS.
The Python package fluidsim is introduced in this article as an extensible framework for Computational Fluid Mechanics (CFD) solvers. It is developed as a part of FluidDyn project (Augier et al., 2018), an effort to promote open-source and open-science collaboration within fluid mechanics community and intended for both educational as well as research purposes. Solvers in fluidsim are scalable, High-Performance Computing (HPC) codes which are powered under the hood by the rich, scientific Python ecosystem and the Application Programming Interfaces (API) provided by fluiddyn and fluidfft packages (Mohanan et al., 2018). The present article describes the design aspects of fluidsim, viz. use of Python as the main language; focus on the ease of use, reuse and maintenance of the code without compromising performance. The implementation details including optimization methods, modular organization of features and object-oriented approach of using classes to implement solvers are also briefly explained. Currently, fluidsim includes solvers for a variety of physical problems using different numerical methods (including finite-difference methods). However, this metapaper shall dwell only on the implementation and performance of its pseudo-spectral solvers, in particular the two- and three-dimensional Navier-Stokes solvers. We investigate the performance and scalability of fluidsim in a state of the art HPC cluster. Three similar pseudo-spectral CFD codes based on Python (Dedalus, SpectralDNS) and Fortran (NS3D) are presented and qualitatively and quantitatively compared to fluidsim. The source code is hosted at Bitbucket as a Mercurial repository bitbucket.org/fluiddyn/fluidsim and the documentation generated using Sphinx can be read online at fluidsim.readthedocs.io.
Huge data advent in high-performance computing (HPC) applications such as fluid flow simulations usually hinders the interactive processing and exploration of simulation results. Such an interactive data exploration not only allows scientiest to play with their data but also to visualise huge (distributed) data sets in both an efficient and easy way. Therefore, we propose an HPC data exploration service based on a sliding window concept, that enables researches to access remote data (available on a supercomputer or cluster) during simulation runtime without exceeding any bandwidth limitations between the HPC back-end and the user front-end.
Complexes of physically interacting proteins are one of the fundamental functional units responsible for driving key biological mechanisms within the cell. Their identification is therefore necessary not only to understand complex formation but also the higher level organization of the cell. With the advent of high-throughput techniques in molecular biology, significant amount of physical interaction data has been cataloged from organisms such as yeast, which has in turn fueled computational approaches to systematically mine complexes from the network of physical interactions among proteins (PPI network). In this survey, we review, classify and evaluate some of the key computational methods developed till date for the identification of protein complexes from PPI networks. We present two insightful taxonomies that reflect how these methods have evolved over the years towards improving automated complex prediction. We also discuss some open challenges facing accurate reconstruction of complexes, the crucial ones being presence of high proportion of errors and noise in current high-throughput datasets and some key aspects overlooked by current complex detection methods. We hope this review will not only help to condense the history of computational complex detection for easy reference, but also provide valuable insights to drive further research in this area.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
