| 1. |
- Behnam, Moris, 1973-, et al.
(författare)
-
Bounding the number of self-blocking occurrences of SIRAP
- 2010
-
Ingår i: Proceedings - Real-Time Systems Symposium. - 9780769542980 ; , s. 61-72
-
Konferensbidrag (refereegranskat)abstract
- This paper presents a new schedulability analysis for hierarchically scheduled real-time systems executing on a single processor using SIRAP; a synchronization protocol for inter subsystem task synchronization. We show that it is possible to bound the number of self-blocking occurrences that should be taken into consideration in the schedulability analysis of subsystems. Correspondingly, we present two novel schedulability analysis approaches with proof of correctness for SIRAP. An evaluation suggests that this new schedulability analysis can decrease the analytical subsystem utilization significantly
|
|
| 2. |
- Behnam, Moris, et al.
(författare)
-
On Optimal Real-time Subsystem-Interface Generation in the Presence of Shared Resources
- 2010
-
Ingår i: Proceedings of the 15th IEEE International Conference on Emerging Technologies and Factory Automation, ETFA 2010. - Bilbao, Spain. - 9781424468508
-
Konferensbidrag (refereegranskat)abstract
- The Hierarchical Scheduling Framework (HSF) has been introduced as a design-time framework enabling compositional schedulability analysis of embedded software systems with real-time properties. However, supporting resource sharing in HSF is a major challenge, since it increases the amount of CPU resources required to guarantee schedulability of the hard real time tasks, and it decreases the composability at the system level. In this paper, we focus on a compositional framework called the bounded-delay resource open environment (BROE) server, and we identify key parameters of this framework that have a great effect on how the framework will utilize CPU resources. In addition, we show how to select optimal values for these parameters in order to reduce the required CPU resource
|
|
| 3. |
- Behnam, Moris, 1973-, et al.
(författare)
-
Overrun Methods and Resource Holding Times for Hierarchical Scheduling of Semi-Independent Real-Time Systems
- 2010
-
Ingår i: IEEE Transactions on Industrial Informatics. - 1551-3203. ; 6:1, s. 93-104
-
Tidskriftsartikel (refereegranskat)abstract
- 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.
|
|
| 4. |
- Behnam, Moris, 1973-, et al.
(författare)
-
Schedulability analysis of synchronization protocols based on overrun without payback for hierarchical scheduling frameworks revisited
- 2010
-
Rapport (övrigt vetenskapligt/konstnärligt)abstract
- In this paper, we show that both global as well as local schedulability analysis of synchronization protocols based on the stack resource protocol (SRP) and overrun without payback for hierarchical scheduling frameworks based on fixed-priority pre-emptive scheduling (FPPS) are pessimistic.We present improved global and local schedulability analysis,illustrate the improvements by means of examples, and show that the improved global analysis is both uniform and sustainable.We evaluate the improved global and local schedulabilityanalysis based on an extensive simulation study and comparethe results with the existing analysis.
|
|
| 5. |
- Behnam, Moris, 1973-
(författare)
-
Synchronization Protocols for a Compositional Real-Time Scheduling Framework
- 2010
-
Doktorsavhandling (övrigt vetenskapligt/konstnärligt)abstract
- In this thesis we propose techniques to simplify the integration of subsystems while minimizing the overall amount of CPU resources needed to guarantee the schedulability of real-time tasks. In addition, we provide solutions to the problem of allowing for the use of logical resources requiring mutual exclusion.The contribution of the thesis is presented in three parts. In the first part, we propose a synchronization protocol, called SIRAP, to facilitate sharing of logical resources in a hierarchical scheduling framework. In addition, we extend an existing synchronization protocol, called HSRP, such that each subsystem can be developed independently. The performance of the proposed protocols is evaluated by extensive simulations. In the second part, we present an efficient schedulability analysis that exploits the lower scheduling overhead introduced by each of the proposed protocols. Finally, in the third part, we propose new methods and algorithms that find the optimal system parameters (e.g., optimal resource ceiling), that minimize the amount of CPU resources required to ensure schedulability, when using the proposed synchronization protocols in a hierarchical scheduling framework.The motivation of this work comes from an emerging industrial trend in embedded software systems development to integrate multiple applications (subsystems) on a small number of processors. The purpose of this integration is to reduce the hardware related costs as well as the communication complexity between processors. In this setting a large number of industrial applications face the problem of preserving their real-time properties after their integration onto a single processor. In addition, temporal isolation between the applications during runtime may be required to prevent failure propagation between different applications.Specifically, we propose a hierarchical scheduling framework that allows for a simplified integration of subsystems. The framework preserves the essential temporal characteristics of the subsystems, both when running in isolation as well as when they are integrated with other subsystems. In this thesis, we assume a model where a system consists of a number of subsystems. The subsystems can interact with each other using shared logical resources. The framework ensures that the individual subsystem respects its allocated share of the processor. The difficulty lies in allowing two or more subsystems to share logical resources, which introduces an additional complexity in the schedulability analysis and also increases the system load.
|
|
| 6. |
- Hansson, Hans, et al.
(författare)
-
Real-Time Systems
- 2010
-
Bok (övrigt vetenskapligt/konstnärligt)abstract
- This is a textbook developed for use in the Master Programme Module E-M.6 "Real-Time Systems" as part of the Postgraduate Distance studies organized by Fraunhofer IESE and the Distance and International Studies Center at the Technical University of Kaiserslauten, Germany.
|
|
| 7. |
|
|
| 8. |
- Keskin, Ugur, et al.
(författare)
-
Improving the global schedulability analysis of overrun without payback
- 2010
-
Ingår i: Proceedings of the Work-In-Progress (WIP) session of the 22nd Euromicro Conference on Real-Time Systems (ECRTS'10).
-
Konferensbidrag (refereegranskat)abstract
- Overrun without payback has been proposed asa mechanism for a stack resource policy (SRP) based synchronizationprotocol for hierarchical scheduling frameworks(HSFs). In this paper we reconsider the global schedulabilityanalysis of an HSF based on two-level fixed-priority preemptivescheduling (FPPS) using overrun without payback asa mechanism. Improved analysis is presented based on theobservation that there is no need to guarantee the overrunbudget before the end of the budget period, because thatadditional amount of resources is only meant to prevent depletionof a budget during global resource access. The resultingimprovement is illustrated by means of an example. Thepossibility to discard the remainder of an overrun budget upona replenishment is briefly considered as a further improvementand its potential is shown using the same example.
|
|
| 9. |
|
|
| 10. |
|
|
