Comparative Analysis of Multitask Scheduling Algorithms for Reconfigurable Computing Regarding Context Switches and Configuration Cache Usage

In this paper, we investigate the usability of several well-known real-time scheduling algorithms for a system consisting of a single processor core and multiple dynamically reconfigurable functional units, running a number of processes in parallel. A SystemC simulation model of a wireless sensor network node serves as a case study for assessing the performance of the different algorithms. Specific emphasis is given to the analysis of the configuration cache miss ratio and the number of context switches, which are indicators of costly operations of the reconfigurable units, respectively reconfiguration and saving internal state.