Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Garbage collecting reactive real-time systems
Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering.
2007 (English)Licentiate thesis, comprehensive summary (Other academic)
Abstract [en]

As real-time systems become more complex, the need for more sophisticated runtime kernel features arises. One such feature that substantially lessens the burden of the programmer is automatic memory management, or garbage collection. However, incorporating garbage collection in a real-time kernel is not an easy task. One needs to guarantee, not only that sufficient memory will be reclaimed in order to avoid out of memory errors, but also that the timing properties of the systems real-time tasks are unaffected. The first step towards such a garbage collector is to define the algorithm in a manageable way. It has to be made incremental in such way that induced pause times are small and bounded (preferably constant). The algorithm should not only be correct, but also provably useful. That is, in order to guarantee that sufficient memory is reclaimed each time the garbage collector is invoked, one need to define some measure of usefulness. Furthermore, the garbage collector must also be guaranteed to be schedulable in the system. That is, even though the collector is correct and proved useful, it still has to be able to do its work within the system. In this thesis, we present a model of an incremental copying garbage collector based on process terms in a labeled transition system. Each kind of garbage collector step is captured as an internal transition and each kind of external heap access (read, write, and allocate) is captured as a labeled transition. We prove correctness and usefulness of the algorithm. We also deploy the garbage collector in a real-time system, to wit, the runtime kernel of Timber. Timber is a strongly typed, object-oriented, purely reactive, real-time programming language based on reactive objects. We show how properties of the language can be used in order to accomplish very efficient and predictable garbage collection.

Place, publisher, year, edition, pages
Luleå: Luleå tekniska universitet, 2007.
Series
Licentiate thesis / Luleå University of Technology, ISSN 1402-1757 ; 2007:56
National Category
Computer Sciences
Research subject
Dependable Communication and Computation Systems
Identifiers
URN: urn:nbn:se:ltu:diva-16802Local ID: 01767110-984f-11dc-8ccb-000ea68e967bOAI: oai:DiVA.org:ltu-16802DiVA: diva2:989789
Note
Godkänd; 2007; 20071121 (ysko)Available from: 2016-09-29 Created: 2016-09-29 Last updated: 2017-11-24Bibliographically approved

Open Access in DiVA

fulltext(1040 kB)68 downloads
File information
File name FULLTEXT01.pdfFile size 1040 kBChecksum SHA-512
8da457a03fd11a8534fe379d10dd52cc809dc3dd1ee9f4d3679499f90691d9c79d24a5fa30a9cd64717e9eb5736c7c26057db4fc1707703e8740f81c58a73f84
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Kero, Martin
By organisation
Department of Computer Science, Electrical and Space Engineering
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar
Total: 68 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 106 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf