Publication

Parallelization of the LEMan Code with MPI and OpenMP

Wilfred Anthony Cooper, Nicolas Mellet
2009
Conference Papers

Résumé

The low-frequency wave propagation code LEMan has been parallelized. Due to large memory requirement but fast computation with the cold model, the parallelization is limited to a low number of processors. The specific block-tridiagonal structure of the matrix to be solved has been taken into account for the MPI implementation. It has then been compared with the performance of OpenMP in order to determine the optimal method depending on the case studied.

Source officielle

https://infoscience.epfl.ch/entities/publication/f2f46b45-be48-4a06-905a-adf7720105d9

À propos de ce résultat

Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.

Wilfred Anthony Cooper, Nicolas Mellet
2009
Conference Papers

Résumé

Source officielle

https://infoscience.epfl.ch/entities/publication/f2f46b45-be48-4a06-905a-adf7720105d9

À propos de ce résultat

Concepts associés (9)

Computer memory

Computer memory stores information, such as data and programs for immediate use in the computer. The term memory is often synonymous with the term primary storage or main memory. An archaic synonym for memory is store. Computer memory operates at a high speed compared to storage which is slower but less expensive and higher in capacity. Besides storing opened programs, computer memory serves as disk cache and write buffer to improve both reading and writing performance.

Gestion de la mémoire

La gestion de la mémoire est une forme de gestion des ressources appliquée à la mémoire de l'ordinateur. L'exigence essentielle de la gestion de la mémoire est de fournir des moyens d'allouer dynamiquement des portions de mémoire aux programmes à leur demande, et de les libérer pour réutilisation lorsqu'elles ne sont plus nécessaires. Ceci est essentiel pour tout système informatique avancé où plus d'un processus peuvent être en cours à tout moment. Catégorie:Architecture informatique Catégorie:Pages avec

Computational complexity

In computer science, the computational complexity or simply complexity of an algorithm is the amount of resources required to run it. Particular focus is given to computation time (generally measured by the number of needed elementary operations) and memory storage requirements. The complexity of a problem is the complexity of the best algorithms that allow solving the problem. The study of the complexity of explicitly given algorithms is called analysis of algorithms, while the study of the complexity of problems is called computational complexity theory.

Afficher plus

Publications associées (26)

Systematic Assessment of Hyperdimensional Computing for Epileptic Seizure Detection

David Atienza Alonso, Una Pale, Tomas Teijeiro Campo

Hyperdimensional computing is a promising novel paradigm for low-power embedded machine learning. It has been applied on different biomedical applications, and particularly on epileptic seizure detection. Unfortunately, due to differences in data preparati ...

2021

Computation Of A 30750-Bit Binary Field Discrete Logarithm

Arjen Lenstra, Thorsten Kleinjung, Benjamin Pierre Charles Wesolowski, Robert Granger

This paper reports on the computation of a discrete logarithm in the finite field F-230750, breaking by a large margin the previous record, which was set in January 2014 by a computation in F-29234. The present computation made essential use of the elimina ...

AMER MATHEMATICAL SOC2021

Path Replay Backpropagation: Differentiating Light Paths using Constant Memory and Linear Time

Sébastien Nicolas Speierer, Wenzel Alban Jakob, Delio Aleardo Vicini

Differentiable physically-based rendering has become an indispensable tool for solving inverse problems involving light. Most applications in this area jointly optimize a large set of scene parameters to minimize an objective function, in which case revers ...

ASSOC COMPUTING MACHINERY2021

Afficher plus