Embedded 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.

Skapa referens, olika format (klipp och klistra)

BibTeX @mastersthesis{Fahlgren2018,author={Fahlgren, Henrik and Rohlin, Agnes},title={Performance-targeted Resource-aware Task Scheduling for Heterogeneous Platforms},abstract={Embedded 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.},publisher={Institutionen för data- och informationsteknik (Chalmers), Chalmers tekniska högskola},place={Göteborg},year={2018},keywords={runtime scheduling, heterogeneous hardware, computer science},note={64},}

RefWorks RT GenericSR ElectronicID 255113A1 Fahlgren, HenrikA1 Rohlin, AgnesT1 Performance-targeted Resource-aware Task Scheduling for Heterogeneous PlatformsYR 2018AB Embedded 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.PB Institutionen för data- och informationsteknik (Chalmers), Chalmers tekniska högskola,PB Institutionen för data- och informationsteknik (Chalmers), Chalmers tekniska högskola,LA engLK http://publications.lib.chalmers.se/records/fulltext/255113/255113.pdfOL 30