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.
Document type :
Conference papers
Liste complète des métadonnées
https://hal.archives-ouvertes.fr/hal-00094632
Contributor : Tristan Crolard <>
Submitted on : Thursday, September 14, 2006 - 5:08:55 PM
Last modification on : Thursday, January 11, 2018 - 6:19:28 AM

Identifiers

  • 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〉

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

44

Contact

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