Fuite de mémoire

Résumé

En informatique, une fuite de mémoire est un bogue expliqué par une occupation croissante et non contrôlée ou non désirée de la taille des données résidentes en mémoire, ce qui entraine la saturation de la mémoire de l’ordinateur. Présentation Causes Dans un programme qui stocke régulièrement de nouvelles données en mémoire, la cause la plus classique d'un tel bogue est l'absence de désallocation (de libération) de l'espace utilisé lorsque ces objets ne sont plus référencés. Au fur et à mesure du temps (tant que le programme continue de fonctionner), la taille des données résidentes en mémoire augmente donc. Une fuite de mémoire est un problème exclusivement logiciel. Il est totalement indépendant du bon ou du mauvais fonctionnement des composantes de la mémoire. Conséquences La conséquence d'une fuite est la saturation de la mémoire de la machine. Si la machine dispose d'un système d'exploitation évolué, ce dernier mettra un terme à l'exécution du

Source officielle

https://fr.wikipedia.org/wiki/Fuite_de_m%C3%A9moire

À 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.

Publications associées (21)

Publications associées

Chargement

Personnes associées (2)

Personnes associées

Chargement

Unités associées (3)

Unités associées

Chargement

Concepts associés (34)

C est un langage de programmation impératif, généraliste et de bas niveau. Inventé au début des années 1970 pour réécrire Unix, C est devenu un des langages les plus utilisés, encore de nos jours. De

thumb|Illustration d'un ramasse-miette compactant. Un ramasse-miettes, ou récupérateur de mémoire, ou glaneur de cellules (en anglais garbage collector, abrégé en GC), est un sous-sys

En programmation informatique, un pointeur est un objet qui contient l'adresse mémoire d'une donnée ou d'une fonction. C'est l'outil fondamental de l'adressage dit « indirect ». Utilité

Afficher plus

Concepts associés

Chargement

Cours associés (13)

Cours associés

Chargement

Séances de cours associées (23)

Séances de cours associées

Chargement

Efficient Data Structures for Decision Diagrams

Nacereddine Ouaret

Dynamic Programming OPtimization (DPOP) is an algorithm proposed for solving distributed constraint optimization problems. In this algorithm, Hypercubes are used as the format of the messages exchanged between the agents. Then, Hybrid-DPOP (H-DPOP), a hybrid algorithm based on DPOP was proposed as an improved solution. Its main advantage over DPOP lies under the use of Multi-valued Decision Diagrams (MDDs) instead of Hypercubes. Furthermore, MDDs give a more compact representation of the messages. The MDDs were implemented and presented in by Kumar even though it was presented as Constrained Decision Diagrams (CDD) which is a generalization of MDDs. The first part of this project aims at implementing Hypercubes. An Implementation already exists. Therefore, the goal is to propose an implementation which is more efficient in term of speed and memory usage for the already implemented functions (join, project and slice). The solution implemented during this project should also provide new functions (split and re-order) and the possibility of saving Hypercubes in the XML format. The second part of the project consists in proposing and implementing a data structure that is more efficient than the MDDs implemented in H-DPOP. This data structure should also provide more functions, and also provide the possibility of saving data in the XML format.

2008

Chargement

Multi-Lead Wavelet-Based ECG Delineation on a Wearable Embedded Sensor Platform

David Atienza Alonso, Nicolas Boichat, Nadia Khaled, Francisco Javier Rincon Vallejos

This work is dedicated to the sensible optimization and porting of a multi-lead (ML) wavelet-transform (WT)-based electrocardiogram (ECG) wave delineator to a state-of-the-art commercial wearable embedded sensor platform with limited processing and storage resources. The original offline algorithm was recently proposed and validated in the literature, as an extension of an earlier well-established single-lead (SL) WT-based ECG delineator. Several ML ECG delineation approaches, including SL selection according to various criteria and lead combination into a single root-mean-squared (RMS) curve, are carefully optimized for real-time operation on a state-of-the-art commercial wearable embedded sensor platform. Furthermore, these ML ECG delineation approaches are contrasted in terms of their delineation accuracy, complexity and memory usage, as well as suitability for ambulatory real-time operation. Finally, the robustness and stability of the ML ECG delineation approaches are benchmarked with respect to a validated SL implementation.

2009

Chargement

Development and Evaluation of Multi-Lead Wavelet-Based ECG Delineation Algorithms for Embedded Wireless Sensor Nodes

David Atienza Alonso, Nadia Khaled, Francisco Javier Rincon Vallejos

This work is devoted to the evaluation of multilead digital wavelet transform (DWT)-based electrocardiogram (ECG) wave delineation algorithms, which were optimized and ported to a commercial wearable sensor platform. More specifically, we investigate the use of root-mean squared (RMS)-based multi-lead followed by a single-lead online delineation algorithm, which is based on a state-of-the-art offline singlelead delineator. The algorithmic transformations and software optimizations necessary to enable embedded ECG delineation notwithstanding the limited processing and storage resources of the target platform are described, and the performance of the resulting implementations are analyzed in terms of delineation accuracy, execution time and memory usage. Interestingly, RMS-based multi-lead delineation is shown to perform equivalently to the best single-lead delineation for the 2-lead QT database (QTDB), within a fraction of a sample duration of the Common Standards for Electrocardiography (CSE) committee tolerances. Finally, a comprehensive evaluation of the energy consumption entailed by the considered algorithms is proposed, which allows very relevant insights into the dominant energy-draining functionalities and which suggests suitable design guidelines for longlasting wearable ECG monitoring systems.

Institute of Electrical and Electronics Engineers2011

Chargement