Impossibility of essential real-time garbage collection in the general case

Danièle Beauquier 1 Tristan Crolard 1 Arnaud Durand 1 Anatol Slissenko 1
1 LACL - Laboratoire d'Algorithmique Complexité et Logique
Abstract : We give an example of a computational problem for which no RAM (random access machine) can ensure a non-trivial garbage collection though a large amount of used memory can be in principle freed starting from some time moment. This example is of theoretical nature and means only that there can be no universal algorithm for "sufficiently good" real-time garbage collection applicable in all situations.
Type de document :
Communication dans un congrès
Proceedings of the 3nd International Conferences on Computer Science and Information Technologies, 2001, Yerevan, Armenia. pp.113-117, 2001
Liste complète des métadonnées
https://hal.archives-ouvertes.fr/hal-00094632
Contributeur : Tristan Crolard <>
Soumis le : jeudi 14 septembre 2006 - 17:08:55
Dernière modification le : jeudi 11 janvier 2018 - 06:19:28

Identifiants

  • HAL Id : hal-00094632, version 1

Collections

LACL | UPEC | UPEC-UPEM

Citation

Danièle Beauquier, Tristan Crolard, Arnaud Durand, Anatol Slissenko. Impossibility of essential real-time garbage collection in the general case. Proceedings of the 3nd International Conferences on Computer Science and Information Technologies, 2001, Yerevan, Armenia. pp.113-117, 2001. 〈hal-00094632〉

Exporter

BibTeX TEI DC DCterms EndNote

Partager

Métriques

Consultations de la notice

42

Contact

support.ccsd.cnrs.fr
hal.support@ccsd.cnrs.fr
Logo CCSD