Many computer systems, such as those for open system envir onmentsor multimedia servic es, ne edan efcient schedulability test for on-line admission control of new jobs. A lthough various p olynomial time schedulability tests have been propose d, they often fail to decide the schedulability of the system precisely when the system is heavily loade d. This paper presents e cient on-line sche dulability tests which are are shown to be more p r ecise and e cient than any existing polynomialtime schedulability tests. Moreover, our proposed t e s t s can be u s e d for the multiframe model where a task may have di erent computation times in di erent periods. We show the performance of the prop ose dsche dulability tests in several simulation experiments.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.