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
Improved Cache-Related Preemption Delay Estimation for Fixed Preemption Point Scheduling
Mälardalen University, School of Innovation, Design and Engineering, Embedded Systems.
Mälardalen University, School of Innovation, Design and Engineering.ORCID iD: 0000-0002-8461-0230
Mälardalen University, School of Innovation, Design and Engineering.ORCID iD: 0000-0003-4157-3537
2018 (English)In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Volume 10873, 2018Conference paper, Published paper (Refereed)
Abstract [en]

Cache-Related Preemption Delays (CRPD) can significantly increase tasks’ execution time in preemptive real-time scheduling, potentially jeopardising the system schedulability. In order to reduce the cumulative CRPD, Limited Preemptive Scheduling (LPS) has emerged as a scheduling approach which limits the maximum number of preemptions encountered by real-time tasks, thus decreasing CRPD compared to fully preemptive scheduling. Furthermore, an instance of LPS, called Fixed Preemption Point Scheduling (LP-FPP), defines the exact points where the preemptions are permitted within a task, which enables a more precise CRPD estimation. The majority of the research, in the domain of LP-FPP, estimates CRPD with pessimistic upper bounds, without considering the possible sources of over-approximation: 1) accounting for the infeasible preemption combinations, and 2) accounting for the infeasible cache block reloads. In this paper, we improve the analysis by accounting for those two cases towards a more precise estimation of the CRPD upper bounds. The evaluation of the approach on synthetic tasksets reveals a significant reduction of the pessimism in the calculation of the CRPD upper bounds, compared to the existing approaches.

Place, publisher, year, edition, pages
2018.
Series
Lecture Notes in Computer Science, ISSN 0302-9743 ; 10873
Keywords [en]
Real-time systems, CRPD Analysis, WCET analysis, Limited Preemptive Scheduling, Fixed Preemption Point Approach
National Category
Computer Systems
Identifiers
URN: urn:nbn:se:mdh:diva-38962DOI: 10.1007/978-3-319-92432-8_6Scopus ID: 2-s2.0-85049013263ISBN: 9783319924311 (print)OAI: oai:DiVA.org:mdh-38962DiVA, id: diva2:1204633
Conference
23rd International Conference on Reliable Software Technologies -Ada-Europe 2018 Ada-Europe-2018 , 18 Jun 2018, Lisbon, Portugal
Available from: 2018-05-08 Created: 2018-05-08 Last updated: 2018-07-05Bibliographically approved
In thesis
1. Improving the Schedulability of Real Time Systems under Fixed Preemption Point Scheduling
Open this publication in new window or tab >>Improving the Schedulability of Real Time Systems under Fixed Preemption Point Scheduling
2018 (English)Licentiate thesis, comprehensive summary (Other academic)
Abstract [en]

During the past decades of research in Real-Time systems, non-preemptive scheduling and fully preemptive scheduling have been extensively investigated, as well as compared with each other. However, it has been shown that none of the two scheduling paradigms dominates over the other in terms of schedulability. In this context, Limited Preemptive Scheduling (LPS) has emerged as an attractive alternative with respect to, e.g., increasing the overall system schedu- lability, efficiently reducing the blocking by lower priority tasks (compared to non-preemptive scheduling) as well as efficiently controlling the number of preemptions, thus controlling the overall preemption-related delay (compared to fully-preemptive scheduling).

Several approaches within LPS enable the above mentioned advantages. In our work, we consider the Fixed Preemption Point Scheduling (LP-FPP) as it has been proved to effectively reduce the preemption-related delay compared to other LPS approaches. In particular, LP-FPP facilitates more precise estimation of the preemption-related delays, since the preemption points of a task in LP-FPP are explicitly selected during the design phase, unlike the other LPS approaches where the preemption points are determined at runtime.

The main goal of the proposed work is to improve the schedulability of real-time systems under the LP-FPP approach. We investigate its use in different domains, such as: single core hard real-time systems, partitioned multi-core systems and real-time systems which can occasionally tolerate deadline misses. We enrich the state of the art for the single core hard real-time systems by proposing a novel cache-related preemption delay analysis, towards reducing the pessimism of the previously proposed methods. In the context of partitioned multi-core scheduling we propose a novel partitioning criterion for the Worst-Fit Decreasing based partitioning, and we also contribute with the comparison of existing partitioning strategies for LP-FPP scheduling. Finally, in the context of real-time systems which can occasionally tolerate deadline misses, we contribute with a probabilistic response time analysis for LP-FPP scheduling and a preemption point selection method for reducing the deadline-misses of the tasks.

Place, publisher, year, edition, pages
Stockholm: E-Print AB, 2018. p. 180
Series
Mälardalen University Press Licentiate Theses, ISSN 1651-9256 ; 270
Keywords
Real-Time Systems, Limited Preemptive Scheduling, Fixed Preemption Points Scheduling, Probabilistic response time analysis, Cache-Related Preemption Delay Analysis
National Category
Computer Sciences
Research subject
Computer Science
Identifiers
urn:nbn:se:mdh:diva-39828 (URN)978-91-7485-390-2 (ISBN)
Presentation
2018-09-21, Kappa, Mälardalen University, Västerås, 13:15 (English)
Opponent
Supervisors
Available from: 2018-06-15 Created: 2018-06-14 Last updated: 2018-06-15Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records BETA

Markovic, Filip

Search in DiVA

By author/editor
Markovic, FilipCarlson, JanDobrin, Radu
By organisation
Embedded SystemsSchool of Innovation, Design and Engineering
Computer Systems

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 5 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