Automatic Adaptation of Resources to Workload requirements in Nested Fork-join Programming Model
2012 (English)Report (Other academic)
We provide a work-stealing scheduling method for nested fork/join parallelism that is mathematically proven to self- adapt multiprogrammed applications resource allocation to the current workloads’ individual needs while it takes avail- able resources into account. The scheduling method both scales up the allocated resources when needed and down, when possible.The theoretical model has been implemented in the Bar- relﬁsh distributed multikernel operating system and demon- strated to function on a simulated x86 64 multicore plat- form.The work presented here is the ﬁrst step towards a com- plete framework for the system-wide scheduling and load balancing of multiprogrammed many-core systems, assum- ing a variety of workload types and guaranteeing at least av- erage execution for each running program.
Place, publisher, year, edition, pages
KTH Royal Institute of Technology, 2012. , 12 p.
, TRITA-ICT/ECS R, ISSN 1653-7238 ; 12:04
Scheduling, parallel programming, multicore, manycore
Research subject SRA - ICT
IdentifiersURN: urn:nbn:se:kth:diva-107668ISRN: KTH/ICT/ECS/R-12-04-SEOAI: oai:DiVA.org:kth-107668DiVA: diva2:577048
FunderSwedish e‐Science Research Center
QC 201301092013-01-092012-12-142013-09-10Bibliographically approved