Online Task Scheduling for the FPGA-Based Partially Reconfigurable Systems

Authors:
Yi Lu;Thomas Marconi;Koen Bertels;Georgi Gaydadjiev
Affiliations:
Computer Engineering, Delft University of Technology, The Netherlands;Computer Engineering, Delft University of Technology, The Netherlands;Computer Engineering, Delft University of Technology, The Netherlands;Computer Engineering, Delft University of Technology, The Netherlands
Venue:
ARC '09 Proceedings of the 5th International Workshop on Reconfigurable Computing: Architectures, Tools and Applications
Year:
2009

Citing 11
Cited 4

An Efficient Task Allocation Scheme for 2D Mesh Architectures

IEEE Transactions on Parallel and Distributed Systems
Configuration prefetch for single context reconfigurable coprocessors

FPGA '98 Proceedings of the 1998 ACM/SIGDA sixth international symposium on Field programmable gate arrays
An Efficient Submesh Allocation Scheme for Two-Dimensional Meshes with Little Overhead

IEEE Transactions on Parallel and Distributed Systems
Hardware-software cosynthesis for run-time incrementally reconfigurable FPGAs

ASP-DAC '00 Proceedings of the 2000 Asia and South Pacific Design Automation Conference
Fast Template Placement for Reconfigurable Computing Systems

IEEE Design & Test
An efficient algorithm for finding empty space for online FPGA placement

Proceedings of the 41st annual Design Automation Conference
The MOLEN Polymorphic Processor

IEEE Transactions on Computers
Operating Systems for Reconfigurable Embedded Platforms: Online Scheduling of Real-Time Tasks

IEEE Transactions on Computers
Physically-aware HW-SW partitioning for reconfigurable architectures with partial dynamic reconfiguration

Proceedings of the 42nd annual Design Automation Conference
An efficient algorithm for free resources management on the FPGA

Proceedings of the conference on Design, automation and test in Europe
Partitioned scheduling of periodic real-time tasks onto reconfigurable hardware

IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing

A (fault-tolerant)2 scheduler for real-time HW tasks

ARC'11 Proceedings of the 7th international conference on Reconfigurable computing: architectures, tools and applications
3D compaction: a novel blocking-aware algorithm for online hardware task scheduling and placement on 2D partially reconfigurable devices

ARC'10 Proceedings of the 6th international conference on Reconfigurable Computing: architectures, Tools and Applications
Energy-efficient scheduling on multi-FPGA reconfigurable systems

Microprocessors & Microsystems
MORP: makespan optimization for processors with an embedded reconfigurable fabric

Proceedings of the 2014 ACM/SIGDA international symposium on Field-programmable gate arrays

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given the FPGA-based partially reconfigurable systems, hardware tasks can be configured into (or removed from) the FPGA fabric without interfering with other tasks running on the same device. In such systems, the efficiency of task scheduling algorithms directly impacts the overall system performance. By using previously proposed 2D scheduling model, existing algorithms could not provide an efficient way to find all suitable allocations. In addition, most of them ignored the single reconfiguration port constraint and inter-task dependencies. Further more, to our best knowledge there is no previous work investigating in the impact on the scheduling result by reusing already placed tasks. In this paper, we focus on online task scheduling and propose task scheduling solution that takes the ignored constraints into account. In addition, a novel "reuse and partial reuse" approach is proposed. The simulation results show that our proposed solution achieves shorter application completion time up to 43.9% and faster single task response time up to 63.8% compared to the previously proposed stuffing algorithm.