for scheduling of preemptible periodic tasks in the context  

Oleh:

Chen, Peter C. Y. ; Wonham, W. M.

Jenis: Article from Article
Dalam koleksi: Final Program and Book of Abstracts: The 4th Asian Control Conference, September 25-27, 2002 (Sep. 2002), page 1904-1909.
Topik: Schedules; Execution; Periodic Tasks; Processor; Preemption
Fulltext: AC021364.PDF (397.58KB)

Isi artikel

for scheduling of preemptible periodic tasks in the context of supervisory control of timed discrete-event systems. We show that, with this method, the problems of determining schedulability and finding a scheduling algorithm are treated as dual problems: a solution to the former necessarily implies a solution for the latter and vice versa. Furthermore, the solution to the latter thus obtained is complete in the sense that it contains all schedules that meet the deadlines of the tasks.

Opini Anda

Klik untuk menuliskan opini Anda tentang koleksi ini!

Kembali