Automatic Adaptation of Resources to Workload requirements in Nested Fork-join Programming Model
Georgios Varisteas, Mats Brorsson · KTH Publication Database DiVA (KTH Royal Institute of Technology) · 2012
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- relfish distributed multikernel operating system and demon- strated to function on a simulated x86 64 multicore plat- form.The work presented here is the first 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.