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
Heuristiska algoritmer för schemaläggning i real-tidssystem med hänsyn till data beroenden
Linköpings universitet, Matematiska institutionen, Optimeringslära. Linköpings universitet, Tekniska fakulteten.
Linköpings universitet, Matematiska institutionen, Optimeringslära. Linköpings universitet, Tekniska fakulteten.
2018 (svensk)Independent thesis Basic level (degree of Bachelor), 10,5 poäng / 16 hpOppgaveAlternativ tittel
Heuristic minimization of data latency in offline scheduling of periodic real-time jobs (engelsk)
Abstract [en]

The schedule for the jobs in a real-time system can have a huge impact on how the system behave. Since real-time systems are common in safety applications it is important that the scheduling is done in a valid way. Furthermore, one can enhance the performance of the applications by minimizing data latency and jitter. A challenge is that jobs in real-time systems usually have complex constraints making it too time consuming to minimize data latency and jitter to optimality. The purpose of this report is to investigate the possibility of creating high quality schedules using heuristics, with the goal to keep the computational time under one minute. This will be done by comparing three different algorithms that will be used on real scheduling instances provided by the company Arcticus. The first algorithm is a greedy heuristic, the second one a local search and the third one is a metaheuristic, simulated annealing. The results indicate that the data latency can be reduced whilst keeping the computational time below one minute.

sted, utgiver, år, opplag, sider
2018. , s. 49
Emneord [en]
Scheduling, heuristics, data latency, jitter, single-processor scheduling
HSV kategori
Identifikatorer
URN: urn:nbn:se:liu:diva-144794ISRN: LiTH-MAT-EX--2018/01--SEOAI: oai:DiVA.org:liu-144794DiVA, id: diva2:1178644
Eksternt samarbeid
Arcticus
Fag / kurs
Mathematics
Veileder
Examiner
Tilgjengelig fra: 2018-02-13 Laget: 2018-01-30 Sist oppdatert: 2018-02-13bibliografisk kontrollert

Open Access i DiVA

fulltext(2882 kB)37 nedlastinger
Filinformasjon
Fil FULLTEXT01.pdfFilstørrelse 2882 kBChecksum SHA-512
b8c1b3aa89abda4918095d6090efedf37a2ed8a3c681e49204b5dd35a07ef63c98686580cf1891ef89e1ca92fc20f2611291f2fb4100db53f7e6f9e2c16d978c
Type fulltextMimetype application/pdf

Søk i DiVA

Av forfatter/redaktør
Abdulla, AriyanAndersson, Erik
Av organisasjonen

Søk utenfor DiVA

GoogleGoogle Scholar
Totalt: 37 nedlastinger
Antall nedlastinger er summen av alle nedlastinger av alle fulltekster. Det kan for eksempel være tidligere versjoner som er ikke lenger tilgjengelige

urn-nbn

Altmetric

urn-nbn
Totalt: 1056 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