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

  • Authors:
  • Nan Guan;Qingxu Deng;Zonghua Gu;Wenyao Xu;Ge Yu

  • Affiliations:
  • Northeastern University, Shenyang, China;Northeastern University, Shenyang, China;Hong Kong University of Science and Technology, China;Zhejiang University, Hangzhou, China;Northeastern University, Shenyang, China

  • Venue:
  • ACM Transactions on Design Automation of Electronic Systems (TODAES)
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Field Programmable Gate Arrays (FPGAs) are very popular in today's embedded systems design, and Partial Runtime-Reconfigurable (PRTR) FPGAs allow HW tasks to be placed and removed dynamically at runtime. Hardware task scheduling on PRTR FPGAs brings many challenging issues to traditional real-time scheduling theory, which have not been adequately addressed by the research community compared to software task scheduling on CPUs. In this article, we consider the schedulability analysis problem of HW task scheduling on PRPR FPGAs. We derive utilization bounds for several variants of global preemptive/nonpreemptive EDF scheduling, and compare the performance of different utilization bound tests.