• Post Reply Bookmark Topic Watch Topic
  • New Topic

Schedulability Bounds of Static Priority Schedulers.  RSS feed

Nicholas Jordan
Ranch Hand
Posts: 1282
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
In the papaer: Schedulability Bounds of Static. Priority Schedulers. Jianjia Wu, Jyh-Charn Liu, and Wei Zhao. Department of Computer Science. Texas A&M University ...

The authors state:
Unlike previous work, we analyze the systems in such a way that the schedulability bound is derived by solving a minimization problem over the entire task set population. Our approach effectively eliminates the difficulty encountered in previous studies, where the search for utilization bound was usually made along the boundary between the spaces of schedulable and non-schedulable task sets. Knowing that finding an analytical representation of the boundary alone is already a major undertaking, it is not surprising to see the piecemeal results under different workload and scheduler assumptions. On the other hand, our method greatly extends the applicability of utilization-based schedulability testing to a wide range of task models and schedulers.

This would have deep impact on my primary project, but would be beyond my skills. To pass it up would be unthinkable right now. Does anyone have any experience with the "greatly extends the applicability" part, iow - has anybody seen any reports of attempts to implement the knowledge gained here, whether in prototyping / speculative work or not ?

I am going to read the paper anyway, and I understand the futility of trying to write a scheduler on consumer grade boxes ... but then Ravi Mohan gave up on writing ai in java, that didn't stop me either. My question here narrowly is if anyone has heard of attempts to apply techniques or knowldege gained in the paper.
  • Post Reply Bookmark Topic Watch Topic
  • New Topic
Boost this thread!