Computer architecture technology is moving towards more heteroge-neous solutions, which will contain a number of processing units with different capabilities that may increase the performance of the system as a whole. How-ever, with increased performance comes increased complexity; complexity that is now barely handled in homogeneous multiprocessing systems. The present study tries to solve a small piece of the heterogeneous puzzle; how can we exploit all system resources in a performance-effective and user-friendly way? Our proposed solution includes a run-time system capable of using a variety of different heterogeneous components while providing the user with the already familiar task-centric programming model interface. Furthermore, when dealing with non-uniform workloads, we show that traditional approaches based on centralized or work-stealing queue algorithms do not work well and propose a scheduling algorithm based on trend analysis to distribute work in a performance-effective way across resources. / <p>QC 20130429</p> / ENCORE
| Identifer | oai:union.ndltd.org:UPSALLA1/oai:DiVA.org:kth-120436 |
| Date | January 2012 |
| Creators | Podobas, Artur, Brorsson, Mats, Vlassov, Vladimir |
| Publisher | KTH, Programvaru- och datorsystem, SCS, KTH, Programvaru- och datorsystem, SCS, KTH, Programvaru- och datorsystem, SCS |
| Source Sets | DiVA Archive at Upsalla University |
| Language | English |
| Detected Language | English |
| Type | Conference paper, info:eu-repo/semantics/conferenceObject, text |
| Format | application/pdf |
| Rights | info:eu-repo/semantics/openAccess |
Page generated in 0.0035 seconds