liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • 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
Heuristiska algoritmer för schemaläggning i real-tidssystem med hänsyn till data beroenden
Linköping University, Department of Mathematics, Optimization . Linköping University, Faculty of Science & Engineering.
Linköping University, Department of Mathematics, Optimization . Linköping University, Faculty of Science & Engineering.
2018 (Swedish)Independent thesis Basic level (degree of Bachelor), 10,5 credits / 16 HE creditsStudent thesisAlternative title
Heuristic minimization of data latency in offline scheduling of periodic real-time jobs (English)
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.

Place, publisher, year, edition, pages
2018. , p. 49
Keywords [en]
Scheduling, heuristics, data latency, jitter, single-processor scheduling
National Category
Other Mathematics
Identifiers
URN: urn:nbn:se:liu:diva-144794ISRN: LiTH-MAT-EX--2018/01--SEOAI: oai:DiVA.org:liu-144794DiVA, id: diva2:1178644
External cooperation
Arcticus
Subject / course
Mathematics
Supervisors
Examiners
Available from: 2018-02-13 Created: 2018-01-30 Last updated: 2018-02-13Bibliographically approved

Open Access in DiVA

fulltext(2882 kB)120 downloads
File information
File name FULLTEXT01.pdfFile size 2882 kBChecksum SHA-512
b8c1b3aa89abda4918095d6090efedf37a2ed8a3c681e49204b5dd35a07ef63c98686580cf1891ef89e1ca92fc20f2611291f2fb4100db53f7e6f9e2c16d978c
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Abdulla, AriyanAndersson, Erik
By organisation
Optimization Faculty of Science & Engineering
Other Mathematics

Search outside of DiVA

GoogleGoogle Scholar
Total: 120 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 2567 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • 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