Change search
ReferencesLink to record
Permanent link

Direct link
Programming embedded real-time systems: implementation techniques for concurrent reactive objects
Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Embedded Internet Systems Lab.
2011 (English)Licentiate thesis, comprehensive summary (Other academic)
Abstract [en]

An embedded system is a computer system that is a part of a larger device with hardware and mechanical parts. Such a system often has limited resources (such as processing power, memory, and power) and it typically has to meet hard real-time requirements. Today, as the area of application of embedded systems is constantly increasing, resulting in higher demands on system performance and a growing complexity of embedded software, there is a clear trend towards multi-core and multi-processor systems. Such systems are inherently concurrent, but programming concurrent systems using the traditional abstractions (i.e., explicit threads of execution) has been shown to be both difficult and error-prone. The natural solution is to raise the abstraction level and make concurrency implicit, in order to aid the programmer in the task of writing correct code. However, when we raise the abstraction level, there is always an inherent cost. In this thesis we consider one possible concurrency model, the concurrent reactive object approach that offers implicit concurrency at the object level. This model has been implemented in the programming language Timber, which primarily targets development of real-time systems. It is also implemented in TinyTimber, a subset of the C language closely matching Timber’s execution model. We quantify various costs of a TinyTimber implementation of the model (such as context switching and message passing overheads) on a number of hardware platforms and compare them to the costs of the more common thread-based approach. We then demonstrate how some of these costs can be mitigated using stack resource policy. On a separate track, we present a feasibility test for garbage collection in a reactive real-time system with automatic memory management, which is a necessary component for verification of correctness of a real-time system implemented in Timber

Place, publisher, year, edition, pages
Luleå: Luleå tekniska universitet, 2011.
Series
Licentiate thesis / Luleå University of Technology, ISSN 1402-1757
Research subject
Embedded System
Identifiers
URN: urn:nbn:se:ltu:diva-18171Local ID: 7427cde0-f70f-11df-8b95-000ea68e967bISBN: 978-91-7439-194-7OAI: oai:DiVA.org:ltu-18171DiVA: diva2:991178
Note
Godkänd; 2011; 20101123 (simait); LICENTIATSEMINARIUM Ämnesområde: Inbyggda system/Embedded Systems Examinator: Professor Per Lindgren, Institutionen för system- och rymdteknik, Luleå tekniska universitet Diskutant: Professor Mikael Sjödin, Mälardalens högskola, Västerås/Eskilstuna Tid: Måndag den 23 maj 2011 kl 13.00 Plats: A1514 - Demostudion, Luleå tekniska universitetAvailable from: 2016-09-29 Created: 2016-09-29Bibliographically approved

Open Access in DiVA

fulltext(3785 kB)9 downloads
File information
File name FULLTEXT01.pdfFile size 3785 kBChecksum SHA-512
0f7062821917217212495c158617f048faf4b29009697369693482581060ea4421be4fd2b041a9cc958e77a3d2265f0d0274ea2cd7e069e9298795c5022f76a8
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Aittamaa, Simon
By organisation
Embedded Internet Systems Lab

Search outside of DiVA

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

Total: 12 hits
ReferencesLink to record
Permanent link

Direct link