Task period selection and schedulability in real-time systems

Danbing Seto, John P. Lehoczky, Lui Sha

Research output: Contribution to conferencePaperpeer-review


In many real-time applications, especially those involving computer-controlled systems, the application tasks often have a maximal acceptable latency, and small latency is preferred to large. The interaction between choosing task periods to meet the individual latency requirements and scheduling the resulting task set was investigated in [4] using dynamic priority scheduling methods. In this paper, we present algorithms based on static priority scheduling methods to determine optimal periods for each task in the task set. The solution to the period selection problem optimizes a system-wide performance measure subject to meeting the maximal acceptable latency requirements of each task. This paper also contributes to a new aspect of rate monotonic scheduling, the optimal design of task periods in connection with application related timing specifications and task set schedulability.

Original languageEnglish (US)
Number of pages11
StatePublished - 1998
Externally publishedYes
EventProceedings of the 1998 19th IEEE Real-Time Systems Symposium - Madrid, Spain
Duration: Dec 2 1998Dec 4 1998


OtherProceedings of the 1998 19th IEEE Real-Time Systems Symposium
CityMadrid, Spain

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications


Dive into the research topics of 'Task period selection and schedulability in real-time systems'. Together they form a unique fingerprint.

Cite this