Optimal FPGA module placement with temporal precedence constraints
Proceedings of the conference on Design, automation and test in Europe
Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications
Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications
Fast Template Placement for Reconfigurable Computing Systems
IEEE Design & Test
Interconnection Networks Enable Fine-Grain Dynamic Multi-tasking on FPGAs
FPL '02 Proceedings of the Reconfigurable Computing Is Going Mainstream, 12th International Conference on Field-Programmable Logic and Applications
A Virtual Hardware Operating System for the Xilinx XC6200
FPL '96 Proceedings of the 6th International Workshop on Field-Programmable Logic, Smart Applications, New Paradigms and Compilers
Chip-Based Reconfigurable Task Management
FPL '01 Proceedings of the 11th International Conference on Field-Programmable Logic and Applications
A Methodology for Task Based Partitioning and Scheduling of Dynamically Reconfigurable Systems
FCCM '98 Proceedings of the IEEE Symposium on FPGAs for Custom Computing Machines
Fast Online Task Placement on FPGAs: Free Space Partitioning and 2D-Hashing
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
The Development of an Operating System for Reconfigurable Computing
FCCM '01 Proceedings of the the 9th Annual IEEE Symposium on Field-Programmable Custom Computing Machines
Packet Routing in Dynamically Changing Networks on Chip
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 3 - Volume 04
Dynamic Interconnection of Reconfigurable Modules on Reconfigurable Devices
IEEE Design & Test
The Erlangen Slot Machine: A Dynamically Reconfigurable FPGA-based Computer
Journal of VLSI Signal Processing Systems
Real-Time Management of Hardware and Software Tasks for FPGA-based Embedded Systems
IEEE Transactions on Computers
Schedulability analysis of preemptive and nonpreemptive EDF on partial runtime-reconfigurable FPGAs
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Intelligent merging online task placement algorithm for partial reconfigurable systems
Proceedings of the conference on Design, automation and test in Europe
Reconfigurable Multithreading Architectures: A Survey
SAMOS '09 Proceedings of the 9th International Workshop on Embedded Computer Systems: Architectures, Modeling, and Simulation
Online SystemC emulation acceleration
Proceedings of the 47th Design Automation Conference
ACM Transactions on Reconfigurable Technology and Systems (TRETS)
Efficient task scheduling for runtime reconfigurable systems
Journal of Systems Architecture: the EUROMICRO Journal
A new metric for on-line scheduling and placement in reconfigurable computing systems
ICA3PP'10 Proceedings of the 10th international conference on Algorithms and Architectures for Parallel Processing - Volume Part II
An approach to manage reconfigurations and reduce area cost in hard real-time reconfigurable systems
ACM Transactions on Embedded Computing Systems (TECS)
Clustering scheduling for hardware tasks in reconfigurable computing systems
Journal of Systems Architecture: the EUROMICRO Journal
| Hi-index | 0.00 |
This paper deals with online scheduling of tasks to partiallyreconfigurable devices. Such devices are able toexecute several tasks in parallel. All tasks share the reconfigurablesurface as a single resource which leads tohighly dynamic allocation situations. To manage such devicesat runtime, we propose a reconfigurable operatingsystem that splits into three main modules: scheduler,placer, and loader. The main characteristics of the resultingonline scheduling problem is the strong nexus betweenscheduling and placement. We discuss a fast online placementtechnique and then focus on scheduling real-timetasks. We devise guarantee-based schedulers for two scenarios,namely tasks with arbitrary and synchronous arrivaltimes. The schedulers exploit the knowledge about taskproperties to improve the system's performance. The experimentsshow that the developed schedulers lead tosubstantial performance gains at an acceptable run-timeoverhead.