Schedulability test for multiprocessor scheduling based on hyperbolic bound

Hong Ya Wang, Wei Yin, Hui Song, Lih Chyun Shu, Mei Wang

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

The utilization bound for multiprocessor systems using the rate-monotonic scheduling algorithm and first fit allocation policy proposed by Lopez, et al. offers the best performance among all O(m) complexity schedulability tests. In this paper, a utilization bound is derived for the same target problem. The main difference between these two bounds lies in the technique to verify the schedulability of task sets on uniprocessors; the schedulability test here is performed based on the hyperbolic bound proposed by Bini, et al. The new bound surpasses the existing one under quite a lot parameter settings, and the combination of these two schedulability test methods, which are compatible with each other, can significantly improve the number of schedulable task sets with little extra overhead.

Original languageEnglish
Pages (from-to)2223-2234
Number of pages12
JournalRuan Jian Xue Bao/Journal of Software
Volume23
Issue number8
DOIs
Publication statusPublished - 2012 Aug 1

All Science Journal Classification (ASJC) codes

  • Software

Fingerprint Dive into the research topics of 'Schedulability test for multiprocessor scheduling based on hyperbolic bound'. Together they form a unique fingerprint.

  • Cite this