Automating the Processes of Selecting an Appropriate Scheduling Algorithm and Configuring the Scheduler Implementation for Time-Triggered Embedded Systems

Authors:
Ayman K. Gendy;Michael J. Pont
Affiliations:
Embedded Systems Laboratory, University of Leicester, Leicester, UK LE1 7RH;Embedded Systems Laboratory, University of Leicester, Leicester, UK LE1 7RH
Venue:
SAFECOMP '08 Proceedings of the 27th international conference on Computer Safety, Reliability, and Security
Year:
2008

Citing 16
Cited 0

Scheduling Processes with Release Times, Deadlines, Precedence and Exclusion Relations

IEEE Transactions on Software Engineering
Allocating hard real-time tasks: an NP-hard problem made easy

Real-Time Systems
Software architecture for hard real-time applications: cyclic executives vs. fixed priority executives

Real-Time Systems
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
Priority Scheduling Versus Pre-Run-Time Scheduling

Real-Time Systems - Selected papers from IFAC/IFIP workshops on real-time programming
Patterns for time-triggered embedded systems: building reliable applications with the 8051 family of microcontrollers

Patterns for time-triggered embedded systems: building reliable applications with the 8051 family of microcontrollers
Real-Time Systems: Design Principles for Distributed Embedded Applications

Real-Time Systems: Design Principles for Distributed Embedded Applications
Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications

Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications
Managing Complex Temporal Requirements in Real-Time Control Systems

ECBS '02 Proceedings of the 9th IEEE International Conference on Engineering of Computer-Based Systems
Evaluation of Search Heuristics for Embedded System Scheduling Problems

CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
A Cyclic-Executive-Based QoS Guarantee over USB

RTAS '03 Proceedings of the The 9th IEEE Real-Time and Embedded Technology and Applications Symposium
Making Software Timing Properties Easier to Inspect and Verify

IEEE Software
Writing Temporally Predictable Code

WORDS '02 Proceedings of the The Seventh IEEE International Workshop on Object-Oriented Real-Time Dependable Systems (WORDS 2002)
Rate monotonic vs. EDF: judgment day

Real-Time Systems
Reducing Jitter in Embedded Systems Employing a Time-Triggered Software Architecture and Dynamic Voltage Scaling

IEEE Transactions on Computers
The Non-preemptive Scheduling of Periodic Tasks upon Multiprocessors

Real-Time Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Predictable system behaviour is a necessary (but not sufficient) condition when creating safety-critical and safety-related embedded systems. At the heart of such systems there is usually a form of scheduler: the use of time-triggered schedulers is of particular concern in this paper. It has been demonstrated in previous studies that the problem of determining the task parameters for such a scheduler is NP-hard. We have previously described an algorithm ("TTSA1") which is intended to address this problem. This paper describes an extended version of this algorithm ("TTSA2") which employs task segmentation to increase schedulability. We show that the TTSA2 algorithm is highly efficient when compared with alternative "branch and bound" search schemes.