Parallel computing has become extremely important in today's IT world. Almost all computers are now parallel systems. To efficiently use them one needs to divide a program into tasks and to schedule them onto the processors or cores of the system. Theoretically this is addressed by task scheduling where a program is described by a directed acyclic graph, a so called task graph. The primary objective of task scheduling is the fast execution of a program, but the energy consumption becomes more and more important too. So called slack reclamation algorithms slow down the execution of non-crucial tasks so that idle times (the slack) are filled and the energy consumption is reduced. But recently the question was raised how much slack is actually present in schedules produced by modern scheduling algorithms. This project will investigate this important question, whose answer can have a strong consequence on the design of future scheduling algorithms.
Good programming experience.
Lab allocations have not been finalised