mdh.sePublications
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
A Formal Approach for Flexible Modeling and Analysis of Transaction Timeliness and Isolation
Mälardalen University, School of Innovation, Design and Engineering, Embedded Systems. IS (Embedded Systems).
Mälardalen University, School of Innovation, Design and Engineering, Embedded Systems. IS (Embedded Systems).ORCID iD: 0000-0002-6952-1053
Mälardalen University, School of Innovation, Design and Engineering, Embedded Systems. IS (Embedded Systems).ORCID iD: 0000-0003-2898-9570
Mälardalen University, School of Innovation, Design and Engineering, Embedded Systems. IS (Embedded Systems).ORCID iD: 0000-0003-2870-2680
2016 (English)In: Proceedings of the 24th International Conference on Real-Time Networks and Systems, Brest, France, 2016Conference paper, Published paper (Refereed)
Abstract [en]

Traditional Concurrency Control (CC) mechanisms ensure absence of undesired interference in transaction-based systems and enforce isolation. However, CC may introduce unpredictable delays that could lead to breached timeliness, which is unwanted for real-time transactions. To avoid deadline misses, some CC algorithms relax isolation in favor of timeliness, whereas others limit possible interleavings by leveraging real-time constraints and preserve isolation. Selecting an appropriate CC algorithm that can guarantee timeliness at an acceptable level of isolation thus becomes an essential concern for system designers. However, trading-off isolation for timeliness is not easy with existing analysis techniques in database and real-time communities. In this paper, we propose to use model checking of a timed automata model of the transaction system, in order to check the traded-off timeliness and isolation. Our solution provides modularization for the basic transactional constituents, which enables flexible modeling and composition of various candidate CC algorithms, and thus reduces the effort of selecting the appropriate CC algorithm.

Place, publisher, year, edition, pages
Brest, France, 2016.
Keyword [en]
Transaction management, concurrency control, timeliness, isolation, model checking
National Category
Electrical Engineering, Electronic Engineering, Information Engineering
Identifiers
URN: urn:nbn:se:mdh:diva-33826DOI: 10.1145/2997465.2997495ISI: 000391255400001Scopus ID: 2-s2.0-84997170469OAI: oai:DiVA.org:mdh-33826DiVA: diva2:1048588
Conference
24th International Conference on Real-Time Networks and Systems RTNS'16, 19 Oct 2016, Brest, France
Projects
DAGGERS - Data aggregation for embedded real-time database systems
Available from: 2016-11-21 Created: 2016-11-21 Last updated: 2017-05-22Bibliographically approved
In thesis
1. Systematic Design of Data Management for Real-Time Data-Intensive Applications
Open this publication in new window or tab >>Systematic Design of Data Management for Real-Time Data-Intensive Applications
2017 (English)Licentiate thesis, comprehensive summary (Other academic)
Abstract [en]

Modern real-time data-intensive systems generate large amounts of data that are processed using complex data-related computations such as data aggregation. In order to maintain the consistency of data, such computations must be both logically correct (producing correct and consistent results) and temporally correct (completing before specified deadlines). One solution to ensure logical and temporal correctness is to model these computations as transactions and manage them using a Real-Time Database Management System (RTDBMS). Ideally, depending on the particular system, the transactions are customized with the desired logical and temporal correctness properties, which are achieved by the customized RTDBMS with appropriate run-time mechanisms. However, developing such a data management solution with provided guarantees is not easy, partly due to inadequate support for systematic analysis during the design. Firstly, designers do not have means to identify the characteristics of the computations, especially data aggregation, and to reason about their implications. Design flaws might not be discovered, and thus they may be propagated to the implementation. Secondly, trade-off analysis of conflicting properties, such as conflicts between transaction isolation and temporal correctness, is mainly performed ad-hoc, which increases the risk of unpredictable behavior.

In this thesis, we propose a systematic approach to develop transaction-based data management with data aggregation support for real-time systems. Our approach includes the following contributions: (i) a taxonomy of data aggregation, (ii) a process for customizing transaction models and RTDBMS, and (iii) a pattern-based method of modeling transactions in the timed automata framework, which we show how to verify with respect to transaction isolation and temporal correctness. Our proposed taxonomy of data aggregation processes helps in identifying their common and variable characteristics, based on which their implications can be reasoned about. Our proposed process allows designers to derive transaction models with desired properties for the data-related computations from system requirements, and decide the appropriate run-time mechanisms for the customized RTDBMS to achieve the desired properties. To perform systematic trade-off analysis between transaction isolation and temporal correctness specifically, we propose a method to create formal models of transactions with concurrency control, based on which the isolation and temporal correctness properties can be verified by model checking, using the UPPAAL tool. By applying the proposed approach to the development of an industrial demonstrator, we validate the applicability of our approach.

Place, publisher, year, edition, pages
Västerås: Mälardalen University, 2017
Series
Mälardalen University Press Licentiate Theses, ISSN 1651-9256 ; 258
National Category
Computer Systems
Identifiers
urn:nbn:se:mdh:diva-35369 (URN)978-91-7485-334-6 (ISBN)
Presentation
2017-06-12, Kappa, Mälardalens högskola, Västerås, 13:30 (English)
Opponent
Supervisors
Projects
DAGGERS
Funder
Knowledge Foundation
Available from: 2017-05-23 Created: 2017-05-22 Last updated: 2017-07-10Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopushttp://dl.acm.org/citation.cfm?id=2997495

Search in DiVA

By author/editor
Cai, SiminGallina, BarbaraNyström, DagSeceleanu, Cristina
By organisation
Embedded Systems
Electrical Engineering, Electronic Engineering, Information Engineering

Search outside of DiVA

GoogleGoogle Scholar

Altmetric score

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