Sökning: onr:"swepub:oai:DiVA.org:mdh-10442" >
Overrun Methods and...
Overrun Methods and Resource Holding Times for Hierarchical Scheduling of Semi-Independent Real-Time Systems
-
- Behnam, Moris, 1973- (författare)
- Mälardalens högskola,Akademin för innovation, design och teknik
-
- Nolte, Thomas (författare)
- Mälardalens högskola,Akademin för innovation, design och teknik
-
- Sjödin, Mikael (författare)
- Mälardalens högskola,Akademin för innovation, design och teknik
-
visa fler...
-
- Shin, Insik (författare)
- Department of Computer Science, KAIST University , Korea
-
visa färre...
-
(creator_code:org_t)
- 2010
- 2010
- Engelska.
-
Ingår i: IEEE Transactions on Industrial Informatics. - 1551-3203. ; 6:1, s. 93-104
- Relaterad länk:
-
https://urn.kb.se/re...
-
visa fler...
-
https://doi.org/10.1...
-
visa färre...
Abstract
Ämnesord
Stäng
- The Hierarchical Scheduling Framework (HSF) has been introduced as a design-time framework toenable compositional schedulability analysis of embedded software systems with real-time properties. Inthis paper a software system consists of a number of semi-independent components called subsystems.Subsystems are developed independently and later integrated to form a system. To support this designprocess, in the paper, the proposed methods allow non-intrusive configuration and tuning of subsystemtiming-behaviour via subsystem interfaces for selecting scheduling parameters.This paper considers three methods to handle overruns due to resource sharing between subsystemsin the HSF. For each one of these three overrun methods corresponding scheduling algorithms and associatedschedulability analysis are presented together with analysis that shows under what circumstances one or the other is preferred. The analysis is generalized to allow for both Fixed Priority Scheduling (FPS)and Earliest Deadline First (EDF) scheduling. Also, a further contribution of the paper is the techniqueof calculating resource-holding times within the framework under different scheduling algorithms; theresource holding times being an important parameter in the global schedulability analysis.
Ämnesord
- NATURVETENSKAP -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences -- Computer Sciences (hsv//eng)
Nyckelord
- Real time scheduling
- resource sharing
- hierarchical scheduling
- Computer science
- Datavetenskap
- Computer Science
- datavetenskap
Publikations- och innehållstyp
- ref (ämneskategori)
- art (ämneskategori)
Hitta via bibliotek
Till lärosätets databas