Heuristics for scheduling reconfigurable devices with consideration of reconfiguration overheads
Authors:
- 1 April 2008
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE) in 2008 IEEE International Symposium on Parallel and Distributed Processing
- No. 15302075,p. 1-8
Abstract
When using dynamically and partially reconfigurable FPGAs in embedded systems, the scheduler needs to fulfill area and time requirements for each task. While those demands are already well studied in literature, another characteristic peculiarity of reconfigurable systems has been rather neglected: the reconfiguration overhead. However, scheduling algorithms considering the exclusive access to the reconfiguration port can improve the latency of obtained schedules considerably. In this paper, we present new scheduling heuristics and a methodology to compare approaches which take into consideration the reconfiguration overheads with those which disregard them. Furthermore, our experimental results give insight into possible performance increases and present problem instances for which the reconfiguration latency is negligible.Keywords
This publication has 14 references indexed in Scilit:
- The Erlangen Slot Machine: A Dynamically Reconfigurable FPGA-based ComputerJournal of Signal Processing Systems, 2007
- The Erlangen slot machine: increasing flexibility in FPGA-based reconfigurable platforms2006
- Physically-aware HW-SW partitioning for reconfigurable architectures with partial dynamic reconfiguration2005
- Equal processing and equal setup time cases of scheduling parallel machines with a single serverComputers & Operations Research, 2004
- A Runtime Environment for Reconfigurable Hardware Operating Systems2004
- Scheduling parallel machines with a single server: some solvable cases and heuristicsComputers & Operations Research, 2002
- Parallel machine scheduling with a common serverDiscrete Applied Mathematics, 2000
- Parallel machine scheduling problems with a single serverMathematical and Computer Modelling, 1997
- Scheduling Theory. Single-Stage Systems1994
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey1979