SwePub
Sök i LIBRIS databas

  Utökad sökning

WFRF:(Dobrin Radu)
 

Sökning: WFRF:(Dobrin Radu) > (2020-2023) > Preemption-Delay Aw...

Preemption-Delay Aware Schedulability Analysis of Real-Time Systems

Marković, Filip, 1992- (författare)
Mälardalens högskola,Inbyggda system,Division of Computer Science and Software Engineering, Industrial Software Engineering
Carlson, Jan (preses)
Mälardalens högskola,Inbyggda system,Akademin för hälsa, vård och välfärd
Dobrin, Radu, 1970- (preses)
Mälardalens högskola,Inbyggda system
visa fler...
Lisper, Björn (preses)
Mälardalens högskola,Inbyggda system
Bini, Enrico, Associate professor (opponent)
University of Torino, Italy
visa färre...
 (creator_code:org_t)
ISBN 9789174854671
Västerås : Mälardalen University, 2020
Engelska 206 s.
Serie: Mälardalen University Press Dissertations, 1651-4238 ; 315
  • Doktorsavhandling (övrigt vetenskapligt/konstnärligt)
Abstract Ämnesord
Stäng  
  • Schedulability analysis of real-time systems under preemptive scheduling may often lead to false-negative results, deeming a schedulable taskset being unschedulable. This is the case due to the inherent over-approximation of many time-related parameters such as task execution time, system delays, etc., but also, in the context of preemptive scheduling, a significant over-approximation arises from accounting for task preemptions and corresponding preemption-related delays. To reduce false-negative schedulability results, it is highly important to as accurately as possible approximate preemption-related delays. Also, it is important to obtain safe approximations, which means that compared to the approximated delay, no higher corresponding delay can occur at runtime since such case may lead to false-positive schedulability results that can critically impact the analysed system. Therefore, the overall goal of this thesis is:To improve the accuracy of schedulability analyses to identify schedulable tasksets in real-time systems under fixed-priority preemptive scheduling, by accounting for tight and safe approximations of preemption-related delays.We contribute to the domain of timing analysis for single-core real-time systems under preemptive scheduling by proposing two novel cache-aware schedulability analyses: one for fully-preemptive tasks, and one for tasks with fixed preemption points. Also, we propose a novel method for deriving safe and tight upper bounds on cache-related preemption delay of tasks with fixed preemption points. Finally, we contribute to the domain of multi-core partitioned hard real-time systems by proposing a novel partitioning criterion for worst-fit decreasing partitioning, and by investigating the effectiveness of different partitioning strategies to provide task allocation which does not jeopardize the schedulability of a taskset in the context of preemptive~scheduling.

Ämnesord

TEKNIK OCH TEKNOLOGIER  -- Elektroteknik och elektronik -- Datorsystem (hsv//swe)
ENGINEERING AND TECHNOLOGY  -- Electrical Engineering, Electronic Engineering, Information Engineering -- Computer Systems (hsv//eng)

Nyckelord

Real-time systems
Scheduling
Schedulability analysis
Preemptions
Preemption delays
Embedded Systems
Preemptive scheduling
Response-time analysis
Cache-related preemption delay
Timing analysis
Worst-case execution time analysis
Limited-preemptive scheduling
Fixed preemption points
Computer Science
datavetenskap

Publikations- och innehållstyp

vet (ämneskategori)
dok (ämneskategori)

Hitta via bibliotek

Till lärosätets databas

Sök utanför SwePub

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy