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

Abstract

quickly. A reconfigurable functional unit (RFU) will likely have a much larger internal state (configuration data + In this paper, we investigate the usability of several wellintermediate results) than a typical processor core executing known real-time scheduling algorithms for a system a software task, so algorithms used to schedule software consisting of a single processor core and multiple tasks onto a processor core in a time-shared manner might dynamically reconfigurable functional units, running a not work very well for scheduling hardware tasks onto a number of processes in parallel. A SystemC simulation RFU. In this paper, we investigate the usability of several model of a wireless sensor network node serves as a case well-known real-time scheduling algorithms for a system study for assessing the performance of the different consisting of a single processor core and multiple RFUs, algorithms. Specific emphasis is given to the analysis of the running a number of processes in quasi-parallel. A wireless configuration cache miss ratio and the number of context sensor network node serves as a case study for assessing the switches, which are indicators of costly operations of the performance of the different algorithms. All results were reconfigurable units, respectively reconfiguration and obtained from simulating a system model written in saving internal state.

Network Coding on Heterogeneous Multi-Core Processors for Wireless Sensor Networks

“…On the other hand, multi-core processors have recently become widespread and can be found in a variety of systems [ 17 ], from high performance servers to special purpose wireless sensor networks [ 18 , 19 ]. In fact, the current research on sensor networks mainly uses a light-weighted processing node as a sensor node.…”