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 collection with hard real-time requirements
2004 (English)Independent thesis Advanced level (professional degree), 20 credits / 30 HE creditsStudent thesis
Abstract [en]

Automated memory management techniques, or garbage collection, reduces the complexity and problems of manual memory management. When used properly, it will lower development costs and save time by eliminating the need to test the product for faulty memory managed code. With the size and complexity in todays systems, this is becoming increasingly crucial. Even though this thesis addresses garbage collection in general, it is specially biased towards real-time garbage collection and an implementation to the language Timber. Timber is a reactive hard real-time language. Certain characteristics in the language will affect the choice and style of techniques chosen. In this thesis the fundamentals of the three different garbage collection techniques are surveyed to determine if their abilities and functionalities match the demands of Timber. The fact that most, if not all, of the specific implementations that have been made are only suitable for interactive and soft real-time systems makes this task severer. Although, when these basic techniques are made incremental they become eligible for hard real-time systems, at least in theory. The garbage collection and fragmentation techniques that are used in the implementation in this thesis are chosen in perspective to the characteristics of Timber. An implementation has been made that at least satisfies the hard real-time requirements of predictability and schedulability. When the suggested changes and modifications to the compiler is implemented, the implementation should be quite efficient.

Place, publisher, year, edition, pages
2004.
Keyword [en]
Technology, garbage collection, memory management, hard real-time, timber, reference counting
Keyword [sv]
Teknik
Identifiers
URN: urn:nbn:se:ltu:diva-48881ISRN: LTU-EX--04/262--SELocal ID: 64ca6156-7330-44a3-b11d-5b21f66ee800OAI: oai:DiVA.org:ltu-48881DiVA: diva2:1022225
Subject / course
Student thesis, at least 30 credits
Educational program
Computer Science and Engineering, master's level
Examiners
Note
Validerat; 20101217 (root)Available from: 2016-10-04 Created: 2016-10-04Bibliographically approved

Open Access in DiVA

fulltext(337 kB)23 downloads
File information
File name FULLTEXT01.pdfFile size 337 kBChecksum SHA-512
04ac50ac665dc170e027502b25429b5c7322387d16e8898885367e67e7a46648c7bc1a31910371fcbf7bcc7e003e08162544d75499c4b8aba1640ba68e7c448a
Type fulltextMimetype application/pdf

Search outside of DiVA

GoogleGoogle Scholar
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
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