Scaling and Resilience in Numerical Algorithms for Exascale Computing
Graph Chatbot
Chattez avec Graph Search
Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.
AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.
We consider elliptic PDEs (partial differential equations) in the framework of isogeometric analysis, i.e., we treat the physical domain by means of a B-spline or NURBS mapping which we assume to be regular. The numerical solution of the PDE is computed by ...
It is important to consider the microstructure of a material when studying the macroscopic mechanical properties. Although special equipments have been used for micromechanics study through experimental tests, it is limited by instruments and reproducibili ...
Replication has recently gained attention in the context of fault tolerance for large scale MPI HPC applications. Existing implementations try to cover all MPI codes and to be independent from the underlying library. In this paper, we evaluate the advantag ...
Every wave solver serving the computational study of waves meets a trade-off of two figures of merit—its computational speed and its accuracy. The use of Discontinuous Galerkin (DG) methods on graphical processing units (GPUs) significantly lowers the cost ...
In this thesis we study the efficient implementation of the finite element method for the numerical solution of partial differential equations (PDE) on modern parallel computer archi- tectures, such as Cray and IBM supercomputers. The domain-decomposition ...
Growth codes are a subclass of Rateless codes that have found interesting applications in data dissemination problems. Compared to other Rateless and conventional channel codes, Growth codes show improved intermediate performance which is particularly usef ...
Institute of Electrical and Electronics Engineers2013
In this paper we present a compact review on the mostly used techniques for computational reduction in numerical approximation of partial differential equations. We highlight the common features of these techniques and provide a detailed presentation of th ...
The objective of this thesis is to develop reduced models for the numerical solution of optimal control, shape optimization and inverse problems. In all these cases suitable functionals of state variables have to be minimized. State variables are solutions ...
When representing realistic physical phenomena by partial differential equations (PDE), it is crucial to approximate the underlying physics correctly, to get precise results, and to efficiently use the computer architecture. Incorrect results can appear in ...
High performance computing will probably reach exascale in this decade. At this scale, mean time between failures is expected to be a few hours. Existing fault tolerant protocols for message passing applications will not be efficient anymore since they eit ...
