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
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
Online Scheduling and Placement of Real-time Tasks to Partially Reconfigurable Devices
RTSS '03 Proceedings of the 24th IEEE International Real-Time Systems Symposium
A Reconfigurable RTOS with HW/SW Co-scheduling for SOPC
ICESS '05 Proceedings of the Second International Conference on Embedded Software and Systems
An Efficient Algorithm for Online Soft Real-Time Task Placement on Reconfigurable Hardware Devices
ISORC '07 Proceedings of the 10th IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing
An efficient algorithm for online management of 2D area of partially reconfigurable FPGAs
Proceedings of the conference on Design, automation and test in Europe
A Methodology for Automating Co-Scheduling for Reconfigurable Computing Systems
MEMOCODE '07 Proceedings of the 5th IEEE/ACM International Conference on Formal Methods and Models for Codesign
Online Hardware Task Scheduling and Placement Algorithm on Partially Reconfigurable Devices
ARC '08 Proceedings of the 4th international workshop on Reconfigurable Computing: Architectures, Tools and Applications
| Hi-index | 0.00 |
Reconfigurable computing systems use reconfigurable processing unit in conjunction with a processor to make us able to execute tasks in a true multitasking manner. This leads to highly dynamic allocation situations. To manage such systems at runtime, a reconfigurable operating system is needed. On-line scheduling and placement algorithms are the main parts of this operating system. In this paper, we present a technique for on-line integrated scheduling and placement which focuses on on-line, real-time and non-preemptive reconfigurable computing systems. The main characteristic of our method includes using a new metric for selecting the best feasible placements for arriving tasks. This new metric is based on temporal and spatial constraints. A large variety of experiments has been conducted on the proposed algorithm using synthetic and real tasks. Obtained results show the benefits of this algorithm.