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
FullText Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 10908488
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Efficient Online Schedulability Tests for Real-Time Systems.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Tei-Wei+Kuo%22">Tei-Wei Kuo</searchLink><relatesTo>1</relatesTo><i> {ktw, d6526009}@csie.ntu.edu.tw</i><br /><searchLink fieldCode="AR" term="%22Li-Pin+Chang%22">Li-Pin Chang</searchLink><relatesTo>2</relatesTo><br /><searchLink fieldCode="AR" term="%22Yu-Hua+Liu%22">Yu-Hua Liu</searchLink><relatesTo>3</relatesTo><i> klin@uci.edu</i><br /><searchLink fieldCode="AR" term="%22Kwei-Jay+Lin%22">Kwei-Jay Lin</searchLink>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22IEEE+Transactions+on+Software+Engineering%22">IEEE Transactions on Software Engineering</searchLink>. Aug2003, Vol. 29 Issue 8, p734-751. 18p. 7 Black and White Photographs, 1 Diagram, 7 Charts, 3 Graphs.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Computer+systems%22">Computer systems</searchLink><br /><searchLink fieldCode="DE" term="%22Real-time+computing%22">Real-time computing</searchLink><br /><searchLink fieldCode="DE" term="%22Online+data+processing%22">Online data processing</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: 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]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>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.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=10908488
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1109/TSE.2003.1223647
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 18
        StartPage: 734
    Subjects:
      – SubjectFull: Computer systems
        Type: general
      – SubjectFull: Real-time computing
        Type: general
      – SubjectFull: Online data processing
        Type: general
    Titles:
      – TitleFull: Efficient Online Schedulability Tests for Real-Time Systems.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Tei-Wei Kuo
      – PersonEntity:
          Name:
            NameFull: Li-Pin Chang
      – PersonEntity:
          Name:
            NameFull: Yu-Hua Liu
      – PersonEntity:
          Name:
            NameFull: Kwei-Jay Lin
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 08
              Text: Aug2003
              Type: published
              Y: 2003
          Identifiers:
            – Type: issn-print
              Value: 00985589
          Numbering:
            – Type: volume
              Value: 29
            – Type: issue
              Value: 8
          Titles:
            – TitleFull: IEEE Transactions on Software Engineering
              Type: main
ResultId 1