View in EDS

Efficient Online Schedulability Tests for Real-Time Systems.

Saved in:
Bibliographic Details
Title: Efficient Online Schedulability Tests for Real-Time Systems.
Authors: Tei-Wei Kuo1 {ktw, d6526009}@csie.ntu.edu.tw, Li-Pin Chang2, Yu-Hua Liu3 klin@uci.edu, Kwei-Jay Lin
Source: IEEE Transactions on Software Engineering. Aug2003, Vol. 29 Issue 8, p734-751. 18p. 7 Black and White Photographs, 1 Diagram, 7 Charts, 3 Graphs.
Subjects: Computer systems, Real-time computing, Online data processing
Abstract: Many computer systems, such as those for open system environments or multimedia services, need an efficient schedulability test for online admission control of new jobs. Although various polynomial time schedulability tests have been proposed, they often fail to decide the schedulability of the system precisely when the system is heavily loaded. On the other hand, most precise schedulability tests proposed to date have a high complexity and may not be suitable for online tests. In this paper, we present new efficient online schedulability tests for both the periodic process model and the multiframe process model in uniprocessor environments. The schedulability tests are shown to be more precise and efficient than any existing polynomial-time schedulability tests. Moreover, the tests can be done incrementally as each new task arrives at the system. Our proposed tests can also be used for the multiframe model where a task may have different computation times in different periods. We show the performance of the proposed schedulability tests in several simulation experiments. [ABSTRACT FROM AUTHOR]
Copyright of IEEE Transactions on Software Engineering is the property of IEEE Computer Society and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Description
Abstract:Many computer systems, such as those for open system environments or multimedia services, need an efficient schedulability test for online admission control of new jobs. Although various polynomial time schedulability tests have been proposed, they often fail to decide the schedulability of the system precisely when the system is heavily loaded. On the other hand, most precise schedulability tests proposed to date have a high complexity and may not be suitable for online tests. In this paper, we present new efficient online schedulability tests for both the periodic process model and the multiframe process model in uniprocessor environments. The schedulability tests are shown to be more precise and efficient than any existing polynomial-time schedulability tests. Moreover, the tests can be done incrementally as each new task arrives at the system. Our proposed tests can also be used for the multiframe model where a task may have different computation times in different periods. We show the performance of the proposed schedulability tests in several simulation experiments. [ABSTRACT FROM AUTHOR]
ISSN:00985589
DOI:10.1109/TSE.2003.1223647