Conference Paper

Improved SIRAP analysis for synchronization in hierarchical scheduled real-time systems

Malardalen Real-Time Res. Centre, Vasteras, Sweden
DOI: 10.1109/ETFA.2009.5347234 Conference: Emerging Technologies & Factory Automation, 2009. ETFA 2009. IEEE Conference on
Source: IEEE Xplore

ABSTRACT We present our ongoing work on synchronization in hierarchical scheduled real-time systems, where tasks are scheduled using fixed-priority pre-emptive scheduling. In this paper, we show that the original local schedulability analysis of the synchronization protocol SIRAP [4] is very pessimistic when tasks of a subsystem access many global shared resources. The analysis therefore suggests that a subsystem requires more CPU resources than necessary. A new way to perform the schedulability analysis is presented which can make the SIRAP protocol more efficient in terms of calculated CPU resource needs.

0 Bookmarks
 · 
76 Views
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: As the bandwidth of CPUs and networks continues to grow, it becomes more attractive, for efficiency reasons, to share such resources among several applications with the minimum level of interference. This can be achieved using temporal partitions, with each application assigned to its own partition and executing as if it was executing alone on a resource with lower bandwidth. The partitions are associated to servers that execute the application tasks according to a given application-level scheduler. On the other hand, the set of servers is scheduled by a system-level scheduler. This paper addresses the particular case of fixed priorities-based application-level schedulers together with a periodic server model at the system level. It starts with an adequate response time analysis based on the notion of server availability for a known server. Then it addresses the inverse problem of designing a server with minimum system-level resource requirements to fulfill the application time constraints. In this context, the paper shows that response time based schedulability tests with linear time bounds do not need to consider all tasks but just a small subset, which may lead to substantial speed-ups. The proposed method goes a step further with respect to other recent works in the literature by considering a more complete task model, effectively computing the server parameters and establishing a better trade-off concerning complexity and tightness.
    EMSOFT 2004, September 27-29, 2004, Pisa, Italy, Fourth ACM International Conference On Embedded Software, Proceedings; 01/2004
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: We present our ongoing work to improve an existing syn-chronization protocol SIRAP [4] for hierarchically sched-uled real-time systems. A less pessimistic schedulability analysis is presented which can make the SIRAP protocol more efficient in terms of calculated CPU resource needs. In addition and for the same reason, an extended version of SIRAP is proposed, which decreases the interference from lower priority tasks. The new version of SIRAP has the po-tential to make the protocol more resource efficient than the original one.
    Interfaces and Free Boundaries - INTERFACE FREE BOUND. 01/2009;
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: This paper presents a protocol for resource sharing in a hi- erarchical real-time scheduling framework. Targeting real- time open systems, the protocol and the scheduling frame- work 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.
    Proceedings of the 7th ACM & IEEE International conference on Embedded software, EMSOFT 2007, September 30 - October 3, 2007, Salzburg, Austria; 01/2007

Full-text

View
0 Downloads
Available from