| 1. |
- Danielsson, Jakob, et al.
(author)
-
Performance Evaluation of Network Convergence Time Measurement Techniques
- 2017
-
In: International Conference on Emerging Technologies And Factory Automation ETFA'17. - 9781509065059 ; , s. 1-7
-
Conference paper (peer-reviewed)abstract
- In this paper we evaluate solutions that provide measurements for the network convergence time in switched Ethernet networks when links failures happen. We evaluate three solutions to measure the network convergence time in a faulty situation. Compared to the commercially available solutions, our proposals are cost-effective, portable, and open source. Thus, they are easy to deploy on many testbeds. We show the performance of the solutions by measuring different metrics including jitter, network convergence time and packet loss during the network recovery time. Our measurements indicate that it is possible to accurately measure the network convergence time using a packet sender which does not suffer interference from the overlying operating system. Furthermore, we noticed that the packet sniffer TShark did not suffer from kernel interrupts from overlying operating systems.
|
|
| 2. |
- Behnam, Moris
(author)
-
Hierarchical Real Time Scheduling and Synchronization
- 2008
-
Licentiate thesis (other academic/artistic)abstract
- The Hierarchical Scheduling Framework (HSF) has been introduced to enable compositional schedulability analysis and execution of embedded software systems with real-time constraints. In this thesis, we consider a system consisting of a number of semi-independent components called subsystems, and these subsystems are allowed to share logical resources. The HSF provides CPU-time to the subsystems and it guarantees that the individual subsystems respect their allocated CPU budgets. However, if subsystems are allowed to share logical resources, extra complexity with respect to analysis and run-time mechanisms is introduced. In this thesis we address three issues related to hierarchical scheduling of semi-independent subsystems. In the first part, we investigate the feasibility of implementing the hierarchical scheduling framework in a commercial operating system, and we present the detailed figures of various key properties with respect to the overhead of the implementation. In the second part, we studied the problem of supporting shared resources in a hierarchical scheduling framework and we propose two different solutions to support resource sharing. The first proposed solution is called SIRAP, a synchronization protocol for resource sharing in hierarchically scheduled open real-time systems, and the second solution is an enhanced overrun mechanism. In the third part, we present a resource efficient approach to minimize system load (i.e., the collective CPU requirements to guarantee the schedulability of hierarchically scheduled subsystems). Our work is motivated from a tradeoff between reducing resource locking times and reducing system load. We formulate an optimization problem that determines the resource locking times of each individual subsystem with the goal of minimizing the system load subject to system schedulability. We present linear complexity algorithms to find an optimal solution to the problem, and we prove their correctness
|
|
| 3. |
- Behnam, Moris, et al.
(author)
-
Independent Abstraction and Dynamic Slack Reclaiming in Hierarchical Real-Time Open Systems
- 2007
-
In: Proceedings of the Work-In-Progress (WIP) session of the 19th Euromicro Conference on Real-Time Systems (ECRTS'07), Pisa, Italy. ; , s. 1-4
-
Conference paper (peer-reviewed)abstract
- Independent subsystem abstraction allows subsystems to be developed and validated separately and supports an easier subsystem integration. In particular, this approach is desirable in open systems, since it does not require knowledge of temporal behaviour of other subsystems. However, independentabstraction, assuming the worst-case CPU supply pattern, requires extra CPU allocations. We present our work in progress on dynamic slack reclamation, which keeps track of such extra CPU allocations at run time. We are also investigating how to utilize those extra resources for supporting soft real-time tasks.
|
|
| 4. |
- Behnam, Moris, et al.
(author)
-
Multi-core Composability in the Face of Memory Bus Contention
- 2012
-
Conference paper (peer-reviewed)abstract
- In this paper we describe the problem of achieving composability of independently developed real-time subsystems to be executed on a multicore platform.We evaluate existing work for achieving real-time performance on multicores and illustrate their lack with respect to composability. To better address composability we present a multi-resource server-based scheduling technique to provide predictable performance when composing multiple subsystems on a multicore platform. To achieve composability also on multicore platforms, we propose to add memory-bandwidth as an additional server resource. Tasks within our multi-resource servers are guaranteed both CPU- and memory-bandwidth; thus the performance of a server will become independent of resource usage by tasks in other servers. We are currently implementing multi-resource servers for the Enea’s OSE operating system for a P4080 8-core processor to be tested with software for a 3G-basestation.
|
|
| 5. |
- Behnam, Moris, 1973-, et al.
(author)
-
Overrun Methods and Resource Holding Times for Hierarchical Scheduling of Semi-Independent Real-Time Systems
- 2010
-
In: IEEE Transactions on Industrial Informatics. - 1551-3203. ; 6:1, s. 93-104
-
Journal article (peer-reviewed)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.
|
|
| 6. |
- Behnam, Moris, et al.
(author)
-
Overrun Methods for Semi-Independent Real-Time Hierarchical Scheduling
- 2009
-
Reports (other academic/artistic)abstract
- The Hierarchical Scheduling Framework (HSF) has been introduced as a design-time framework to enable compositional schedulability analysis of embedded software systems with real-time properties. In this 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 design process, in the paper, the proposed methods allow non-intrusive configuration and tuning of subsystem timing-behaviour via subsystem interfaces for selecting scheduling parameters. This paper considers three methods to handle overruns due to resource sharing between subsystems in the HSF. For each one of these three overrun methods corresponding scheduling algorithms The work in this paper is supported by the Swedish Foundation for Strategic Research (SSF), via the research programme PROGRESS. and associated schedulability 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 technique of calculating resource-holding times within the framework under different scheduling algorithms. The resource holding times being an important parameter in the global schedulability analysis.
|
|
| 7. |
- Behnam, Moris, et al.
(author)
-
Real-Time Subsystem Integration in the Presence of Shared Resources
- 2006
-
In: Proceedings of the Work-In-Progress (WIP) session of the 27th IEEE Real-Time Systems Symposium (RTSS'06), Rio de Janeiro, Brazil.
-
Conference paper (peer-reviewed)abstract
- We present our ongoing work to support the difficult, time consuming, and error-prone process of subsystem integration in the real-time domain. Our work will result in methods where independently developed subsystems, including both hard real-time and soft real-time functions, can be easily integrated without resulting unpredictable timing behaviour. The methods will also facilitate subsystem reuse, since a subsystem can easily be integrated in a new environment. Related research and methods are presented, together with our ongoing work in the area.
|
|
| 8. |
- Behnam, Moris, et al.
(author)
-
SIRAP: A Global Resource Sharing Protocol Facilitating Integration of Semi-independent Real-Time Systems
- 2007
-
Reports (other academic/artistic)abstract
- This paper presents a protocol for resource sharing in a hierarchical real-time scheduling framework. Together, the protocol and the scheduling framework significantly reduce the efforts and errors associated with integrating multiple semi-independent subsystems on a single processor. Thus, our proposed techniques facilitate modern software development processes, where subsystems are developed by independent teams (or subcontractors) and at a later stage integrated into a single product. Using our solution, a subsystem need not know, and is not dependent on, the timing behaviour of other subsystems; even though they share mutually exclusive resources. In this paper we also prove the correctness of our approach and evaluate its efficiency.
|
|
| 9. |
- Behnam, Moris, 1973-
(author)
-
Synchronization Protocols for a Compositional Real-Time Scheduling Framework
- 2010
-
Doctoral thesis (other academic/artistic)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.
|
|
| 10. |
- Fredriksson, Johan, et al.
(author)
-
Clustering Worst-Case Execution Times for Software Components
- 2007
-
In: Proceedings of the 7th International Workshop on Worst Case Execution Time Analysis (WCET'07), Pisa, Italy. - 9783939897057 ; , s. 19-25
-
Conference paper (peer-reviewed)abstract
- For component-based systems, classical techniques for WCET-estimation produce unacceptable overestimations of the WCET. This is because software components have more general behavior in order to support reuse. Existing tools and methods for component-based software engineering (CBSE) do not yet adequately consider reusable analyses.We present a method that allows different WCETs to be associated with subsets of the component behavior by clustering WCETs with respect to behavior. The method is intended to be used for facilitating reusable WCET analysis for reusable software components. We illustrate our technique and demonstrate its potential in achieving tight WCET-estimates for components with rich behavior.
|
|
