Feasibility problems for recurring tasks on one processor

Sanjoy K. Baruah; Rodney R. Howell; Louis E. Rosier

doi:10.1016/0304-3975(93)90360-6

Feasibility problems for recurring tasks on one processor

Sanjoy K. Baruah
, Rodney R. Howell
, Louis E. Rosier

Department of Computer Science & Engineering

Research output: Contribution to journal › Article › peer-review

63 Scopus citations

Abstract

We give a comprehensive summary of our recent research on the feasibility problems for various types of hard-real-time preemptive task systems on one processor. We include results on periodic, sporadic, and hybrid task systems. While many of the results herein have appeared elsewhere, this is the first paper presenting a holistic view of the entire problem.

Original language	English
Pages (from-to)	3-20
Number of pages	18
Journal	Theoretical Computer Science
Volume	118
Issue number	1
DOIs	https://doi.org/10.1016/0304-3975(93)90360-6
State	Published - Sep 13 1993

Access to Document

10.1016/0304-3975(93)90360-6

Cite this

@article{e6da602bc3a744469605d4b7f88c1b94,

title = "Feasibility problems for recurring tasks on one processor",

abstract = "We give a comprehensive summary of our recent research on the feasibility problems for various types of hard-real-time preemptive task systems on one processor. We include results on periodic, sporadic, and hybrid task systems. While many of the results herein have appeared elsewhere, this is the first paper presenting a holistic view of the entire problem.",

author = "Baruah, \{Sanjoy K.\} and Howell, \{Rodney R.\} and Rosier, \{Louis E.\}",

year = "1993",

month = sep,

day = "13",

doi = "10.1016/0304-3975(93)90360-6",

language = "English",

volume = "118",

pages = "3--20",

journal = "Theoretical Computer Science",

issn = "0304-3975",

number = "1",

}

TY - JOUR

T1 - Feasibility problems for recurring tasks on one processor

AU - Baruah, Sanjoy K.

AU - Howell, Rodney R.

AU - Rosier, Louis E.

PY - 1993/9/13

Y1 - 1993/9/13

N2 - We give a comprehensive summary of our recent research on the feasibility problems for various types of hard-real-time preemptive task systems on one processor. We include results on periodic, sporadic, and hybrid task systems. While many of the results herein have appeared elsewhere, this is the first paper presenting a holistic view of the entire problem.

AB - We give a comprehensive summary of our recent research on the feasibility problems for various types of hard-real-time preemptive task systems on one processor. We include results on periodic, sporadic, and hybrid task systems. While many of the results herein have appeared elsewhere, this is the first paper presenting a holistic view of the entire problem.

UR - https://www.scopus.com/pages/publications/0027656325

U2 - 10.1016/0304-3975(93)90360-6

DO - 10.1016/0304-3975(93)90360-6

M3 - Article

AN - SCOPUS:0027656325

SN - 0304-3975

VL - 118

SP - 3

EP - 20

JO - Theoretical Computer Science

JF - Theoretical Computer Science

IS - 1

ER -

Feasibility problems for recurring tasks on one processor

Abstract

Access to Document

Other files and links

Fingerprint

Cite this