Optimal Static Task Scheduling on Reconfigurable Hardware Devices Using Model-Checking
Authors:
- 1 April 2007
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE) in 13th IEEE Real Time and Embedded Technology and Applications Symposium (RTAS'07)
- No. 15453421,p. 32-44
Abstract
Real-time scheduling for FPGAs presents unique challenges to traditional real-time scheduling theory, since it is similar to, but more general than multi-processor scheduling. In his paper, we address two problems of static task scheduling on a partially runtime reconfigurable FPGA: finding an optimal static schedule for a task graph with the optimization objective of minimizing the total schedule length, and finding a feasible static schedule for a set of periodic tasks within a hyper-period with the objective of meeting all deadlines. We model the multi-tasking system with timed automata and use reachability analysis of the UPPAAL model-checker to explore the design space and find an optimal or feasible scheduleKeywords
This publication has 9 references indexed in Scilit:
- An Efficient Algorithm for Online Management of 2D Area of Partially Reconfigurable FPGAs2007
- Improved Schedulability Analysis of EDF Scheduling on Reconfigurable Hardware Devices2007
- Schedulability analysis of fixed-priority systems using timed automataTheoretical Computer Science, 2006
- Solving Real-Time Scheduling Problems with Model-CheckingLecture Notes in Computer Science, 2005
- Programming models for hybrid FPGA-cpu computational components: a missing linkIEEE Micro, 2004
- An optimal algorithm for minimizing run-time reconfiguration delayACM Transactions on Embedded Computing Systems, 2004
- Optimal FPGA module placement with temporal precedence constraints2002
- Configuration prefetching techniques for partial reconfigurable coprocessor with relocation and defragmentation2002
- HYTECH: a model checker for hybrid systemsInternational Journal on Software Tools for Technology Transfer, 1997