FEASIBILITY PROBLEMS FOR RECURRING TASKS ON ONE PROCESSOR

Authors
BARUAH SK HOWELL RR ROSIER LE
Citation
Sk. Baruah et al., FEASIBILITY PROBLEMS FOR RECURRING TASKS ON ONE PROCESSOR, Theoretical computer science, 118(1), 1993, pp. 3-20
Citations number
19
Categorie Soggetti
Computer Sciences","Computer Applications & Cybernetics",Mathematics
Journal title
Theoretical computer science → ACNP
ISSN journal
03043975
Volume
118
Issue
1
Year of publication
1993
Pages
3 - 20
Database
ISI
SICI code
0304-3975(1993)118:1<3:FPFRTO>2.0.ZU;2-X
Abstract
We give a comprehensive summary of our recent research on the feasibil ity problems for various types of hard-real-time preemptive task syste ms on one processor. We include results on periodic, sporadic, and hyb rid task systems. While many of the results herein have appeared elsew here, this is the first paper presenting a holistic view of the entire problem.