Efficient On-Chip Task Scheduler and Allocator for Reconfigurable Operating Systems
- 12 September 2011
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Embedded Systems Letters
- Vol. 3 (3) , 85-88
Abstract
This letter presents efficient and modular task scheduler and allocator support for dynamically and partially reconfigurable electronic systems. This enables hardware tasks to be preempted and arbitrarily placed at an optimal position on the chip on-the-fly. In particular, we present a novel fault-tolerant allocating algorithm called “best-fit empty area compact (BF-EAC),” and its on-chip implementation on a Xilinx Virtex-4 field-programmable gate array (FPGA), which circumvents emerging faults while maintaining more compact empty areas for emerging tasks. We also present an implementation of the early deadline first (EDF) scheduling heuristic used to optimize the chronological order of execution of hardware tasks to meet real time constraints. Put together, the placement and scheduling architecture efficiently exploits chip resources with a μs-grade computing speed and a lightweight footprint (less than 500 slices).Keywords
This publication has 8 references indexed in Scilit:
- Methods and Mechanisms for Hardware Multitasking: Executing and Synchronizing Fully Relocatable Hardware Tasks in Xilinx FPGAs2011
- R3TOS: A reliable reconfigurable real-time operating system2010
- MetaWire: using FPGA configuration circuitry to emulate a network-on-chipIET Computers & Digital Techniques, 2010
- Modular partial reconfiguration in virtex FPGAs2005
- A Low Fragmentation Heuristic for Task Placement in 2D RTR HW Management2004
- A lightweight approach for embedded reconfiguration of FPGAs2003
- Dynamic hardware plugins in an FPGA with partial run-time reconfiguration2002
- Fast template placement for reconfigurable computing systemsIEEE Design & Test of Computers, 2000