View in EDS

Minimum Deadline Calculation for Periodic Real-Time Tasks in Dynamic Priority Systems.

Saved in:
Bibliographic Details
Title: Minimum Deadline Calculation for Periodic Real-Time Tasks in Dynamic Priority Systems.
Authors: Balbastre, Patricia1 patricia@disca.upv.es, Ripoll, Ismael1 iripoll@disca.upv.es, Crespo, Alfons1 acrespo@disca.upv.es
Source: IEEE Transactions on Computers. Jan2008, Vol. 57 Issue 1, p96-109. 14p. 3 Black and White Photographs, 3 Charts, 15 Graphs.
Subjects: Real-time computing software, Real-time programming software, Time series analysis software, Computer scheduling, Computer science research, Computer systems management, Computer engineering
Abstract: Real-time systems are often designed using a set of periodic tasks. Task periods are usually set by the system requirements, but deadlines and computation times can be modified in order to improve system performance. Sensitivity analysis in real-time systems has focused on changes in task computation times using fixed priority analysis. Only a few studies deal with the modification of deadlines in dynamic-priority scheduling. The aim of this work is to provide a sensitivity analysis for task deadlines in the context of dynamic-priority, preemptive, uniprocessor scheduling. In this paper, we present a deadline minimization method that computes the shortest deadline of a periodic task. As undertaken in other studies concerning computation times, we also define and calculate the critical scaling factor for task deadlines. Our proposal is evaluated and compared with other works. The deadline minimization proposed strongly reduces jitter and the response time of control tasks, which can lead to a significant improvement in system performance. [ABSTRACT FROM AUTHOR]
Copyright of IEEE Transactions on Computers is the property of IEEE 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: 28153253
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Minimum Deadline Calculation for Periodic Real-Time Tasks in Dynamic Priority Systems.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Balbastre%2C+Patricia%22">Balbastre, Patricia</searchLink><relatesTo>1</relatesTo><i> patricia@disca.upv.es</i><br /><searchLink fieldCode="AR" term="%22Ripoll%2C+Ismael%22">Ripoll, Ismael</searchLink><relatesTo>1</relatesTo><i> iripoll@disca.upv.es</i><br /><searchLink fieldCode="AR" term="%22Crespo%2C+Alfons%22">Crespo, Alfons</searchLink><relatesTo>1</relatesTo><i> acrespo@disca.upv.es</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22IEEE+Transactions+on+Computers%22">IEEE Transactions on Computers</searchLink>. Jan2008, Vol. 57 Issue 1, p96-109. 14p. 3 Black and White Photographs, 3 Charts, 15 Graphs.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Real-time+computing+software%22">Real-time computing software</searchLink><br /><searchLink fieldCode="DE" term="%22Real-time+programming+software%22">Real-time programming software</searchLink><br /><searchLink fieldCode="DE" term="%22Time+series+analysis+software%22">Time series analysis software</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+scheduling%22">Computer scheduling</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+science+research%22">Computer science research</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+systems+management%22">Computer systems management</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+engineering%22">Computer engineering</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: Real-time systems are often designed using a set of periodic tasks. Task periods are usually set by the system requirements, but deadlines and computation times can be modified in order to improve system performance. Sensitivity analysis in real-time systems has focused on changes in task computation times using fixed priority analysis. Only a few studies deal with the modification of deadlines in dynamic-priority scheduling. The aim of this work is to provide a sensitivity analysis for task deadlines in the context of dynamic-priority, preemptive, uniprocessor scheduling. In this paper, we present a deadline minimization method that computes the shortest deadline of a periodic task. As undertaken in other studies concerning computation times, we also define and calculate the critical scaling factor for task deadlines. Our proposal is evaluated and compared with other works. The deadline minimization proposed strongly reduces jitter and the response time of control tasks, which can lead to a significant improvement in system performance. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of IEEE Transactions on Computers is the property of IEEE 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=28153253
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1109/TC.2007.70787
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 14
        StartPage: 96
    Subjects:
      – SubjectFull: Real-time computing software
        Type: general
      – SubjectFull: Real-time programming software
        Type: general
      – SubjectFull: Time series analysis software
        Type: general
      – SubjectFull: Computer scheduling
        Type: general
      – SubjectFull: Computer science research
        Type: general
      – SubjectFull: Computer systems management
        Type: general
      – SubjectFull: Computer engineering
        Type: general
    Titles:
      – TitleFull: Minimum Deadline Calculation for Periodic Real-Time Tasks in Dynamic Priority Systems.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Balbastre, Patricia
      – PersonEntity:
          Name:
            NameFull: Ripoll, Ismael
      – PersonEntity:
          Name:
            NameFull: Crespo, Alfons
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 01
              Text: Jan2008
              Type: published
              Y: 2008
          Identifiers:
            – Type: issn-print
              Value: 00189340
          Numbering:
            – Type: volume
              Value: 57
            – Type: issue
              Value: 1
          Titles:
            – TitleFull: IEEE Transactions on Computers
              Type: main
ResultId 1