Abstract
The problem of effectively scheduling soft tasks whilst guaranteeing the behaviour of hard tasks has been addressed in many papers with a large number of techniques being proposed. The dual priority mechanism is an intuitively simple method with low overheads. A hard task is assigned two priorities; it starts with a low priority and is then promoted at a time that will guarantee that its deadline is met. Soft tasks are assigned medium priorities; they can thus preempt any hard task that is executing before its promotion time. This paper shows how this scheduling method can be implemented in Ada and C/POSIX. A key difference between these two is their approach to asynchronous communication. Examples are give and a comparison is made.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
