Lecture

Hybrid Programming Models Comparison

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

In course

MATH-454: Parallel and high-performance computing

This course provides insight into a broad variety of High Performance Computing (HPC) concepts and the majority of modern HPC architectures. Moreover, the student will learn to have a feeling about what architectures are suited for several types of algorit ...

Description

This lecture covers a comparison between hybrid programming models, pure MPI, and MPI+Open MP, as well as how to write a production project proposal. It discusses the challenges of thread safety, problem fit with the targeted machine, and levels of parallelism. The instructor explains the differences between pure MPI and hybrid approaches, the structure of a project proposal, and the importance of considering physical topology in application development.

Instructors (2)

Pablo Antolin Sanchez

Teaching & PhD PhD Students Philipp Christoph Weder, Davor Dobrota Past EPFL PhD Students as codirector Ondine Chanon Courses Analysis III MATH-202(c) The course studies the fundamental concepts of vector analysis and Fourier-Laplace analysis with a view to their use in solving multidisciplinary problems in scientific engineering. Analysis III (for IC) MATH-203(d) The course studies the fundamental concepts of vector analysis and Fourier-Laplace analysis with a view to thei

Nicolas Richart

I graduated as an engineer in computer science in 2005 at the Ecole National Superieur en Electronique Informatique et Radiocomunication de Bordeaux (ENSEIRB). My degree is colored by an option od High Performance Computing (HPC). Then I made my thesis at LaBRI/INRIA Bordeaux in the ScalApplix/HiePACS team, on the in-situ steering of coupled parallel numerical simulations. I graduated as a Ph D. of computer science of the Universite de Bordeaux 1 in 2010. Since then I am working at EPFL in the Laboratoire de Simulations en Mechanique des Solides (LSMS) as a scientific collaborator.

Official source

Related concepts (32)

Topology

In mathematics, topology (from the Greek words τόπος, and λόγος) is concerned with the properties of a geometric object that are preserved under continuous deformations, such as stretching, twisting, crumpling, and bending; that is, without closing holes, opening holes, tearing, gluing, or passing through itself. A topological space is a set endowed with a structure, called a topology, which allows defining continuous deformation of subspaces, and, more generally, all kinds of continuity.

General topology

In mathematics, general topology (or point set topology) is the branch of topology that deals with the basic set-theoretic definitions and constructions used in topology. It is the foundation of most other branches of topology, including differential topology, geometric topology, and algebraic topology. The fundamental concepts in point-set topology are continuity, compactness, and connectedness: Continuous functions, intuitively, take nearby points to nearby points.

Final topology

In general topology and related areas of mathematics, the final topology (or coinduced, strong, colimit, or inductive topology) on a set with respect to a family of functions from topological spaces into is the finest topology on that makes all those functions continuous. The quotient topology on a quotient space is a final topology, with respect to a single surjective function, namely the quotient map. The disjoint union topology is the final topology with respect to the inclusion maps.

Order topology

In mathematics, an order topology is a certain topology that can be defined on any totally ordered set. It is a natural generalization of the topology of the real numbers to arbitrary totally ordered sets. If X is a totally ordered set, the order topology on X is generated by the subbase of "open rays" for all a, b in X. Provided X has at least two elements, this is equivalent to saying that the open intervals together with the above rays form a base for the order topology.

Initial topology

In general topology and related areas of mathematics, the initial topology (or induced topology or weak topology or limit topology or projective topology) on a set with respect to a family of functions on is the coarsest topology on that makes those functions continuous. The subspace topology and product topology constructions are both special cases of initial topologies. Indeed, the initial topology construction can be viewed as a generalization of these.

Related lectures (57)

Topology of Riemann Surfaces

Covers the topology of Riemann surfaces and the concept of triangulation using finitely many triangles.

Topologie: Exercice 4

Covers Exercise 4 in Topology, focusing on continuous functions and constructing functions.

Topologie: Attachment Applications

Covers exercises on attaching 1-cells to intervals in topology.

The Jordan Curve Theorem

Explores the Jordan Curve Theorem, illustrating the division of a plane by a simple closed curve into two regions.