oru.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Enhancing time triggered scheduling with value based overload handling and task migration
Department of Computer Science and Engineering, Mälardalen University, Västerås, Sweden.ORCID iD: 0000-0002-8461-0230
Department of Computer Science and Engineering, Mälardalen University, Västerås, Sweden.ORCID iD: 0000-0002-2902-7819
Department of Computer Science and Engineering, Mälardalen University, Västerås, Sweden.
2003 (English)In: Sixth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing, 2003: Proceedings, IEEE Computer Society, 2003, p. 121-128Conference paper, Published paper (Refereed)
Abstract [en]

Time triggered methods provide deterministic behaviour suitable for critical real-time systems. The), perform less favourably, however if the arrival times of some activities are not known in advance, in particular if overload situations have to be anticipated. In many systems, the criticality of only a subset of activities justify the cost associated with the time triggered methods.

In this paper we consider distributed systems where a subset of critical activities are handled in a time triggered fashion, via an offline schedule. At runtime, the arrival of aperiodic tasks may cause overload that demands to be handled in such a way that i) time triggered activities still meet all their original constraints, ii) execution of high-valued tasks are prioritised over tasks with lower value, iii) tasks can be quickly migrated to balance the overall system load.

We give a precise formulation of overload detection and value based task rejection in the presence of offline scheduled tasks, and present a heuristic algorithm to handle overload. To benefit from the distributed setting, the overload handling includes an algorithm that integrates migration of rejected tasks with resource reclaiming and an acceptance test of newly arrived tasks.

Simulation results underline the effectiveness of the presented approach.

Place, publisher, year, edition, pages
IEEE Computer Society, 2003. p. 121-128
National Category
Electrical Engineering, Electronic Engineering, Information Engineering Computer Sciences
Identifiers
URN: urn:nbn:se:oru:diva-65219DOI: 10.1109/ISORC.2003.1199244ISI: 000183434200018Scopus ID: 2-s2.0-84966839208ISBN: 0769519288 (print)ISBN: 9780769519289 (electronic)OAI: oai:DiVA.org:oru-65219DiVA, id: diva2:1185603
Conference
6th IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC 2003), Hakodate, Hokkaido, Japan, May 14-16, 2003
Available from: 2018-02-26 Created: 2018-02-26 Last updated: 2018-03-01Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records BETA

Lennvall, Tomas

Search in DiVA

By author/editor
Carlson, JanLennvall, Tomas
Electrical Engineering, Electronic Engineering, Information EngineeringComputer Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 32 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf