Interactive schedulability analysis

Unmesh D. Bordoloi, Samarjit Chakraborty

Research output: Contribution to journalArticlepeer-review

1 Scopus citations


A typical design process for real-time embedded systems involves choosing the values of certain system parameters and performing a schedulability analysis to determine whether all deadline constraints can be satisfied. If such an analysis returns a negative answer, then some of the parameters are modified and the analysis is invoked once again. This iteration is repeated until a schedulable design is obtained. However, the schedulability analysis problem for most task models is intractable (usually co-NP hard) and, hence, such an iterative design process is often very expensive. To get around this problem, we introduce the concept of interactive schedulability analysis. It is based on the observation that if only a small number of system parameters are changed, then it is not necessary to rerun the full schedulability analysis algorithm, thereby making the iterative design process considerably faster. We refer to this analysis as being interactive because it is supposed to be run in an interactive mode. This concept is fairly general and can be applied to a wide variety of task models. In this paper, we have chosen the recurring real-time task model, because it can be used to represent realistic applications from the embedded systems domain (containing conditional branches and fine-grained deadline constraints). Our experimental results show that using our scheme can lead to more than 20× speedup for each invocation of the schedulability analysis algorithm, compared to the case where the full algorithm is run.

Original languageEnglish
Article number7
JournalACM Transactions on Embedded Computing Systems
Issue number1
StatePublished - 1 Dec 2007
Externally publishedYes


  • Interactive design
  • Nonfunctional constraints
  • Performance debugging
  • Recurring real-time task model
  • Schedulability analysis


Dive into the research topics of 'Interactive schedulability analysis'. Together they form a unique fingerprint.

Cite this