Optimal Static Task Scheduling on Reconfigurable Hardware Devices Using Model-Checking

Authors:
Zonghua Gu;Mingxuan Yuan;Xiuqiang He
Affiliations:
Hong Kong University of Science and Technology, Hong Kong;Hong Kong University of Science and Technology, Hong Kong;Hong Kong University of Science and Technology, Hong Kong
Venue:
RTAS '07 Proceedings of the 13th IEEE Real Time and Embedded Technology and Applications Symposium
Year:
2007

Citing 0
Cited 4

Schedulability analysis of preemptive and nonpreemptive EDF on partial runtime-reconfigurable FPGAs

ACM Transactions on Design Automation of Electronic Systems (TODAES)
Utilization bound for periodic task set with composite deadline

Computers and Electrical Engineering
Efficient task scheduling for runtime reconfigurable systems

Journal of Systems Architecture: the EUROMICRO Journal
Energy-efficient scheduling on multi-FPGA reconfigurable systems

Microprocessors & Microsystems

Quantified Score

Hi-index	0.00

Visualization

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 schedule.