liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • 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
Database pointers: A predictable way of manipulating hot data in hard real-time systems
Mälardalen University, Sweden.
Linköping University, Department of Computer and Information Science, RTSLAB - Real-Time Systems Laboratory. Linköping University, The Institute of Technology.
Mälardalen University, Sweden.
Linköping University, Department of Computer and Information Science, RTSLAB - Real-Time Systems Laboratory. Linköping University, The Institute of Technology.
2005 (English)In: Real-Time and Embedded Computing Systems and Applications: 9th International Conference, RTCSA 2003, Tainan City, Taiwan, February 18-20, 2003. Revised Papers / [ed] Jing Chen and Seongsoo Hong, Springer Berlin/Heidelberg, 2005, Vol. 2968, 454-465 p.Chapter in book (Refereed)
Abstract [en]

Traditionally, control systems use ad hoc techniques such as shared internal data structures, to store control data. However, due to the increasing data volume in control systems, these internal data structures become increasingly difficult to maintain. A real-time database management system can provide an efficient and uniform way to structure and access data. However the drawback with database management systems is the overhead added when accessing data. In this paper we introduce a new concept called database pointers, which provides fast and deterministic accesses to data in hard real-time database management systems compared to traditional database management systems. The concept is especially beneficial for hard real-time control systems where many control tasks each use few data elements at high frequencies. Database pointers can co-reside with a relational data model, and any updates made from the database pointer interface are immediately visible from the relational view. We show the efficiency with our approach by comparing it to tuple identifiers and relational processing.

Place, publisher, year, edition, pages
Springer Berlin/Heidelberg, 2005. Vol. 2968, 454-465 p.
Series
Lecture Notes in Computer Science, ISSN 0302-9743 (print), 1611-3349 (online) ; 2968
National Category
Engineering and Technology
Identifiers
URN: urn:nbn:se:liu:diva-48319DOI: 10.1007/978-3-540-24686-2_28ISBN: 978-3-540-21974-3 (print)ISBN: e-978-3-540-24686-2 ISBN: 3-540-21974-9 (print)OAI: oai:DiVA.org:liu-48319DiVA: diva2:269215
Available from: 2009-10-11 Created: 2009-10-11 Last updated: 2013-11-06Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textfind book at a swedish library/hitta boken i ett svenskt bibliotekfind book in another country/hitta boken i ett annat land

Authority records BETA

Tesanovic, AleksandraHansson, Jörgen

Search in DiVA

By author/editor
Tesanovic, AleksandraHansson, Jörgen
By organisation
RTSLAB - Real-Time Systems LaboratoryThe Institute of Technology
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 24 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • 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