Related papers: Accuracy and scalability of asynchronous compressi…
Recently, the general synthetic iterative scheme (GSIS) has been proposed to find the steady-state solution of the Boltzmann equation in the whole range of gas rarefaction, where its fast-converging and asymptotic-preserving properties lead…
In computational fluid dynamics, the demand for increasingly multidisciplinary reliable simulations, for both analysis and design optimization purposes, requires transformational advances in individual components of future solvers. At the…
In this work, we build upon the recently introduced Multiscale Robin Coupled Method with Oversampling and Smoothing (MRCM-OS) to develop two highly efficient iterative multiscale methods. The MRCM-OS methodology demonstrated the ability to…
In the finite element analysis with fast decoupled time integration scheme for viscoelastic fluid (the Leonov model) flow, we investigate strong nonlinear behavior in 2D creeping contraction flow. The algorithm is applicable in the whole…
In this study we have developed a flexible and efficient numerical scheme for the simulation of three-dimensional incompressible flows in spherical coordinates. The main idea, inspired by a similar strategy as (Verzicco, R., Orlandi, P.,…
This work presents the development, performance analysis and subsequent optimization of a GPU-based spectral hyperviscosity solver for turbulent flows described by the three dimensional incompressible Navier-Stokes equations. The method…
We use high resolution direct numerical simulations to study the anisotropic contents of a turbulent, statistically homogeneous flow with random transitions among multiple energy containing states. We decompose the velocity correlation…
The surge in generative AI workloads has created a need for scalable inference systems that can flexibly harness both GPUs and specialized accelerators while containing operational costs. This paper proposes a hardware-agnostic control loop…
We present an energy-stable scheme for numerically approximating the governing equations for incompressible two-phase flows with different densities and dynamic viscosities for the two fluids. The proposed scheme employs a scalar-valued…
We present a new approach to fault tolerance for High Performance Computing system. Our approach is based on a careful adaptation of the Algorithmic Based Fault Tolerance technique (Huang and Abraham, 1984) to the need of parallel…
This paper first presents a parallel solution for the Flowshop Scheduling Problem in parallel environment, and then proposes a novel load balancing strategy. The proposed Proportional Fairness Strategy (PFS) takes computational performance…
Numerical simulation of multi-component flow systems characterized by the simultaneous presence of pressure-velocity coupling and pressure-density coupling dominated regions remains a significant challenge in computational fluid dynamics.…
As a first step towards the asymptotic description of coherent structures in compressible shear flows, we present a description of nonlinear equilibrium solutions of the Navier--Stokes equations in the compressible asymptotic suction…
It is well-known that proper scaling can increase the efficiency of computational problems. In this paper we define and show that a balancing technique can substantially improve the computational efficiency of optimal control algorithms. We…
Multiphase, compressible and viscous flows are of crucial importance in a wide range of scientific and engineering problems. Despite the large effort paid in the last decades to develop accurate and efficient numerical techniques to address…
To improve the application-level communication performance, scheduling of coflows, a collection of parallel flows sharing the same objective, is prevalent in modern data center networks (DCNs). Meanwhile, a hybrid-switched DCN design…
Asynchronous iterations are more and more investigated for both scaling and fault-resilience purpose on high performance computing platforms. While so far, they have been exclusively applied within space domain decomposition frameworks,…
We show that asymptotically, completely asynchronous stochastic gradient procedures achieve optimal (even to constant factors) convergence rates for the solution of convex optimization problems under nearly the same conditions required for…
Many combinatorial problems deal with preferences and violations, the goal of which is to find solutions with the minimum cost. Weighted constraint satisfaction is a framework for modeling such problems, which consists of a set of cost…
This paper proposes an algorithm for synthesis of clock-follow-data designs that provides robustness against timing violations for RSFQ circuits while maintaining high performance and minimizing area costs. Since superconducting logic gates…