Performance-targeted Resource-aware Task Scheduling for Heterogeneous Platforms

Visa enkel post
dc.contributor.authorFahlgren, Henrik
dc.contributor.authorRohlin, Agnes
dc.contributor.departmentChalmers tekniska högskola / Institutionen för data- och informationsteknik (Chalmers)sv
dc.contributor.departmentChalmers University of Technology / Department of Computer Science and Engineering (Chalmers)en
dc.date.accessioned2019-07-03T14:44:47Z
dc.date.available2019-07-03T14:44:47Z
dc.date.issued2018
dc.description.abstractEmbedded environments often come with strict energy requirements, especially in mobile devices. Heterogeneous architectures are often used in these systems as they provide resources useful in different scenarios. However, introducing more resources requires proper scheduling to be able to utilize the resources efficiently. XiTAO is a resource-aware runtime which dynamically allocates appropriate resources to provide interference-free execution. This thesis aims to extend the XiTAO runtime to consider heterogeneous scheduling as it currently only considers scheduling for a homogeneous platform. For this thesis, only architectures with heterogeneous cores using the same instruction set architecture are considered. Specifically, a Huawei processor with ARM big-LITTLE architecture nodes mounted on a Hikey960 board is used. After surveying related work, four scheduling extensions are presented and evaluated in the thesis. Two extensions target the critical path of the application of which one schedules tasks on the critical path on predefined big cores while the other uses a history-based method of finding the most suitable cores. The third extension uses a history-based method to recognize which tasks will get the greatest performance increase from running on a big core compared to a LITTLE core. The fourth extension changes the amount of resources given to each task dynamically by observing the load and history of the system together with a moldability feature of XiTAO. The last extension can be applied simultaneously as the other scheduling extensions or individually. The scheduling extensions were evaluated with synthetic benchmarks with three different kernels, highlighting specific scenarios. The results show a speedup up to 29% for a randomized directed acyclic graph with our extensions compared the original runtime scheduling.
dc.identifier.urihttps://hdl.handle.net/20.500.12380/255113
dc.language.isoeng
dc.setspec.uppsokTechnology
dc.subjectInformations- och kommunikationsteknik
dc.subjectData- och informationsvetenskap
dc.subjectInformation & Communication Technology
dc.subjectComputer and Information Science
dc.titlePerformance-targeted Resource-aware Task Scheduling for Heterogeneous Platforms
dc.type.degreeExamensarbete för masterexamensv
dc.type.degreeMaster Thesisen
dc.type.uppsokH
local.programmeEmbedded electronic system design (MPEES), MSc
Ladda ner
Original bundle
Visar 1 - 1 av 1
Bild (thumbnail)
Namn:
255113.pdf
Storlek:
2.5 MB
Format:
Adobe Portable Document Format
Beskrivning:
Fulltext
Ladda ner
Samling
Examensarbeten för masterexamen