Brice GOGLIN

Author's posts

Talk by Emmanuel Jeannot on May 29th

Emmanuel Jeannot will present us an empirical study he achieved in the domain of process affinity. Title : Process Affinity, Metrics and Impact on Performance: an Empirical Study Abstract: Process placement, also called topology mapping, is a well-known strategy to improve parallel program execution by reducing the communication cost between processes. It requires two inputs: …

Continue reading

Scotch 6.0.7 released!

Scotch, the software package for graph/mesh/hypergraph partitioning, graph clustering, and sparse matrix ordering, has a new 6.0.7 release. It extends the target architecture API and adds MeTiS v5 compatibility. https://gforge.inria.fr/frs/?group_id=248

Talk by Valentin Honoré on April 11th

Valentin Honoré will present in this talk his recent works about in situ scheduling. This work has been done with G. Aupy, B. Goglin and B. Raffin (Inria Grenoble) Title : Modeling High-throughput Applications for in situ Analytics Abstract : With the goal of performing exascale computing, the importance of I/O management becomes more and …

Continue reading

Talk by Andres Rubio and Brice Goglin on April 9th

Brice & Andres will present us new trends in non-volatile memory technologies.

Talk by Navjot Kukreja (Imperial College London) on December 13th

Combining checkpointing and data compression for large scale seismic inversion Seismic inversion is a class of adjoint-based optimization problems that process up to terabytes of data, regularly exceeding the memory capacity of available computers.Data compression is an effective strategy to reduce this memory requirement by a certain factor, particularly if some loss in accuracy is …

Continue reading

Talk by Paul Hovland (Argonne Nat Lab) on December 13th

Compressing Checkpoints in MITgcm Adjoint Computations Efficient computation of the gradients used for state estimation in the MITgcm general circulation model requires saving intermediate states to disk.  We present some preliminary experiments on compressing these checkpoints in order to reduce the time to read and write checkpoints or to increase the number of checkpoints written …

Continue reading

Hugo Taboada defends his PhD thesis

Hugo Taboada will defend his PhD thesis entitled “MPI Non-Blocking Collective Overlap on Manycore Processor” on Tuesday, December 11th at 10:00 AM.   Supercomputers used in HPC are composed of severals inter-connected machines. Usually, they are programmed using MPI which specify an API for messages exchanges between machines. To amortize the cost of MPI collective …

Continue reading

Nicolas Denoyelle defends his PhD thesis

Nicolas Denoyelle will defend his PhD thesis entitled “From Software Locality to Hardware Locality in Shared Memory Systems with Heterogeneous and Non-Uniform memory“, on Monday,  November 5th at 2:00 PM. Through years, the complexity of High Performance Computing (HPC) systems’ memory hierarchy has increased. Nowadays, large scale machines typically embed several levels of caches and …

Continue reading

Andres Rubio Proano and Nicolas Vidal join the team as PhD students

Andres will work on task- and data-placement for HPC platforms with heterogeneous and non-volatile memories.  

Talk by Yves Robert on March 12th, 2018

Optimal Cooperative Checkpointing for Shared High-Performance Computing Platforms joint work with Dorian Arnold, George Bosilca, Aurelien Bouteiller, Jack Dongarra, Kurt Ferreira and Thomas Hérault Abstract: In high-performance computing environments, input/output (I/O) from various sources often contend for scarce available bandwidth. Adding to the I/O operations inherent to the failure-free execution of an application, I/O from …

Continue reading