To Örebro University

oru.seÖrebro universitets publikasjoner
Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • 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 (engelsk)Inngår i: Sixth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing, 2003: Proceedings, IEEE Computer Society, 2003, s. 121-128Konferansepaper, Publicerat paper (Fagfellevurdert)
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.

sted, utgiver, år, opplag, sider
IEEE Computer Society, 2003. s. 121-128
HSV kategori
Identifikatorer
URN: urn:nbn:se:oru:diva-65219DOI: 10.1109/ISORC.2003.1199244ISI: 000183434200018Scopus ID: 2-s2.0-84966839208ISBN: 0769519288 (tryckt)ISBN: 9780769519289 (digital)OAI: oai:DiVA.org:oru-65219DiVA, id: diva2:1185603
Konferanse
6th IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC 2003), Hakodate, Hokkaido, Japan, May 14-16, 2003
Tilgjengelig fra: 2018-02-26 Laget: 2018-02-26 Sist oppdatert: 2018-03-01bibliografisk kontrollert

Open Access i DiVA

Fulltekst mangler i DiVA

Andre lenker

Forlagets fulltekstScopus

Person

Lennvall, Tomas

Søk i DiVA

Av forfatter/redaktør
Carlson, JanLennvall, Tomas

Søk utenfor DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric

doi
isbn
urn-nbn
Totalt: 197 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf