S. Ramos-Thuel and J.P. Lehoczky. Online Scheduling of Hard Deadline Aperiodic Tasks in Fixed-Priority Systems. In Proc. of IEEE Real-Time Systems Symposium, pages 160--171, December 1993. Introduces an approach for scheduling aperiodic tasks in real-time systems based on the concept of "slack stealing". Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Aperiodic Scheduling in a Dynamic Real-Time Manufacturing System - Salaheddine (2001) (Correct)
....When aperiodic tasks have hard deadlines, the goal of the system is to allow the production of aperiodic tasks without jeopardizing the schedulability of hard periodic tasks. A number of algorithms that solve this problem in fixed priority systems can be found in the literature: 3] 6] 8] [10], 11] The same problem in the context of dynamic priority systems have been solved. It introduces in the system a special purpose process, called server, whose capacity is used to serve the aperiodic requests [13] The server is usually scheduled by a specific algorithm designed in such a way ....
S. Ramos-Thuel and J.P. Lehoczky. Online Scheduling of Hard Deadline Aperiodic Tasks in Fixed-Priority Systems. In Proc. of IEEE Real-Time Systems Symposium, pages 160--171, December 1993. Introduces an approach for scheduling aperiodic tasks in real-time systems based on the concept of "slack stealing".
Jitter Control in Time-Triggered Systems - Lin, Herkert (1996) (5 citations) (Correct)
....be finished as soon as possible. Compared with the RM model it is more difficult to have short response times for aperiodic tasks in the DC model since all DC tasks are executed at fixed times. Moreover, delaying any of the DC tasks in favor of aperiodic jobs (as in the slack stealing protocol [RL93]) will create jitters for DC tasks. In this section, we discuss some possible strategies. a) Aperiodic Server As in [LS87] it is possible to include a periodic polling server for aperiodic jobs in the DC task set. The server is scheduled like a periodic job with a predefined period and ....
S. Ramos-Thuel and J.P. Lehoczky, "Online scheduling of hard deadline aperiodic tasks in fixed-priority systems", Proceedings of IEEE Real-Time Systems Symposium, December 1993.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC