Till Örebro universitet

oru.seÖrebro universitets publikationer
Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat 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 (Engelska)Ingår i: Sixth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing, 2003: Proceedings, IEEE Computer Society, 2003, s. 121-128Konferensbidrag, Publicerat paper (Refereegranskat)
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.

Ort, förlag, år, upplaga, sidor
IEEE Computer Society, 2003. s. 121-128
Nationell ämneskategori
Elektroteknik och elektronik Datavetenskap (datalogi)
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
Konferens
6th IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC 2003), Hakodate, Hokkaido, Japan, May 14-16, 2003
Tillgänglig från: 2018-02-26 Skapad: 2018-02-26 Senast uppdaterad: 2018-03-01Bibliografiskt granskad

Open Access i DiVA

Fulltext saknas i DiVA

Övriga länkar

Förlagets fulltextScopus

Person

Lennvall, Tomas

Sök vidare i DiVA

Av författaren/redaktören
Carlson, JanLennvall, Tomas
Elektroteknik och elektronikDatavetenskap (datalogi)

Sök vidare utanför DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetricpoäng

doi
isbn
urn-nbn
Totalt: 197 träffar
RefereraExporteraLänk till posten
Permanent länk

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