https://www.mdu.se/

mdu.sePublikationer
Ä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
MINIMIZING INTER-CORE DATA-PROPAGATION DELAYS IN PARTITIONED MULTI-CORE REAL-TIME SYSTEMS USING SCHEDULING HEURISTICS
Mälardalens högskola, Akademin för innovation, design och teknik.
2021 (Engelska)Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
Abstract [en]

In the field of embedded systems, computers embedded into machines ranging from microwaveovensto assembly lines impact the physical world. They do so under tight real-time constraintswith ever-increasing demand for computing power and performance. Development of higher speedprocessors have been hampered by diminishing returns on power consumption as clock frequency isfurther increased. For this reason, today, embedded processor development is instead moving towardfurther concurrency with multi-core processors being considered more and more every day. Withparallelism comes challenges, such as interference caused by shared resources. Contention betweenprocessor cores, such as shared memory, result in inter-core interference which is potentially unpredictableand unbounded. The focus of this thesis is placed on minimizing inter-core interferencewhile meeting local task timing requirements by utilizing scheduling heuristics. A scheduling heuristicis designed and a prototype scheduler which implements this algorithm is developed. Thescheduler is evaluated on randomly generated test cases, where its ability to keep inter-core datapropagationdelays low across different core counts and utilization values was evaluated. The algorithmis also compared with constraint programming in a real world industrial test case. Theobtained results show that the algorithm can produce schedules with low inter-core delays in a veryshort time, although not being able to optimize them fully compared to constraint programming.

Ort, förlag, år, upplaga, sidor
2021. , s. 26
Nyckelord [en]
Embedded Systems Scheduling Heuristic Multi-Core
Nationell ämneskategori
Inbäddad systemteknik
Identifikatorer
URN: urn:nbn:se:mdh:diva-54616OAI: oai:DiVA.org:mdh-54616DiVA, id: diva2:1563140
Ämne / kurs
Datavetenskap
Presentation
2021-06-02, Västerås, 08:00 (Engelska)
Handledare
Examinatorer
Tillgänglig från: 2021-06-15 Skapad: 2021-06-09 Senast uppdaterad: 2021-06-15Bibliografiskt granskad

Open Access i DiVA

fulltext(840 kB)89 nedladdningar
Filinformation
Filnamn FULLTEXT01.pdfFilstorlek 840 kBChecksumma SHA-512
dff98563a77ff2820de7c6e3f1c74f3dabf34ad7d8d49b366cc26e7f3011fb652a17b044b31272367732fee94db35ea061b41a69f383c655e970f83a61d9da7e
Typ fulltextMimetyp application/pdf

Sök vidare i DiVA

Av författaren/redaktören
Åberg, Emil
Av organisationen
Akademin för innovation, design och teknik
Inbäddad systemteknik

Sök vidare utanför DiVA

GoogleGoogle Scholar
Totalt: 89 nedladdningar
Antalet nedladdningar är summan av nedladdningar för alla fulltexter. Det kan inkludera t.ex tidigare versioner som nu inte längre är tillgängliga.

urn-nbn

Altmetricpoäng

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