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
Scheduling garbage collection in realtime systems
Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering.
Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Embedded Internet Systems Lab.
2010 (English)In: CODES/ISSS '10 Proceedings of the eighth IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis, New York, NY: ACM Digital Library, 2010, 51-60 p.Conference paper, Published paper (Refereed)
Abstract [en]

The key to successful deployment of garbage collection in real-time systems is to enable provably safe schedulability tests of the real-time tasks. At the same time one must be able to determine the total heap usage of the system. Schedulability tests typically require a uniformed model of timing assumptions (inter-arrival times, deadlines, etc.). Incorporating the cost of garbage collection in such tests typically requires both artificial timing assumptions of the garbage collector and restricted capabilities of the task scheduler. In this paper, we pursue a different approach. We show how the reactive object model of the programming language Timber enables us to decouple the cost of a concurrently running copying garbage collector from the schedulability of the real-time tasks. I.e., we enable any regular schedulability analysis without the need of incorporating the cost of an interfering garbage collector. We present the garbage collection demand analysis, which determines if the garbage collector can be feasibly scheduled in the system.

Place, publisher, year, edition, pages
New York, NY: ACM Digital Library, 2010. 51-60 p.
National Category
Embedded Systems
Research subject
Embedded System
Identifiers
URN: urn:nbn:se:ltu:diva-28516DOI: 10.1145/1878961.1878971Local ID: 255107c0-c1ab-11df-a707-000ea68e967bISBN: 978-1-60558-905-3 (print)OAI: oai:DiVA.org:ltu-28516DiVA: diva2:1001714
Conference
International Conference on Hardware-Software Codesign and System Synthesis : 24/10/2010 - 29/10/2010
Note
Godkänd; 2010; 20100916 (keero)Available from: 2016-09-30 Created: 2016-09-30Bibliographically approved

Open Access in DiVA

fulltext(3207 kB)72 downloads
File information
File name FULLTEXT01.pdfFile size 3207 kBChecksum SHA-512
5bde9be011534d7ded54336972e19ce8f0626e2c97c8bada19ea4719e1aa96c318f1868c96209da778e02df4cea043bab861fb25a5df81f278d02dacc0cd1e7a
Type fulltextMimetype application/pdf

Other links

Publisher's full text

Search in DiVA

By author/editor
Kero, MartinAittamaa, Simon
By organisation
Department of Computer Science, Electrical and Space EngineeringEmbedded Internet Systems Lab
Embedded Systems

Search outside of DiVA

GoogleGoogle Scholar
Total: 72 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

Altmetric score

Total: 101 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