Adaptation in natural and artificial systems
Adaptation in natural and artificial systems
Configuration prefetch for single context reconfigurable coprocessors
FPGA '98 Proceedings of the 1998 ACM/SIGDA sixth international symposium on Field programmable gate arrays
Proceedings of the 6th international workshop on Hardware/software codesign
Scheduling Multiprocessor Tasks with Genetic Algorithms
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Computers
Optimal FPGA module placement with temporal precedence constraints
Proceedings of the conference on Design, automation and test in Europe
A framework for reconfigurable computing: task scheduling and context management
IEEE Transactions on Very Large Scale Integration (VLSI) Systems - System Level Design
Reconfigurable computing: a survey of systems and software
ACM Computing Surveys (CSUR)
Constraints
Configuration relocation and defragmentation for run-time reconfigurable computing
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Fast Template Placement for Reconfigurable Computing Systems
IEEE Design & Test
A Genetic Algorithm for Multiprocessor Scheduling
IEEE Transactions on Parallel and Distributed Systems
Run-time compaction of FPGA designs
FPL '97 Proceedings of the 7th International Workshop on Field-Programmable Logic and Applications
Configuration Relocation and Defragmentation for Reconfigurable Computing
FCCM '00 Proceedings of the 2000 IEEE Symposium on Field-Programmable Custom Computing Machines
Configuration management techniques for reconfigurable computing
Configuration management techniques for reconfigurable computing
Configuration-Sensitive Process Scheduling for FPGA-Based Computing Platforms
Proceedings of the conference on Design, automation and test in Europe - Volume 1
The MOLEN Polymorphic Processor
IEEE Transactions on Computers
Operating Systems for Reconfigurable Embedded Platforms: Online Scheduling of Real-Time Tasks
IEEE Transactions on Computers
Reconfigurable Hardware SAT Solvers: A Survey of Systems
IEEE Transactions on Computers
Instruction Scheduling for Dynamic Hardware Configurations
Proceedings of the conference on Design, Automation and Test in Europe - Volume 1
Proceedings of the conference on Design, Automation and Test in Europe - Volume 1
Compiler-driven FPGA-area allocation for reconfigurable computing
Proceedings of the conference on Design, automation and test in Europe: Proceedings
A parallel configuration model for reducing the run-time reconfiguration overhead
Proceedings of the conference on Design, automation and test in Europe: Proceedings
SPIHT image compression on FPGAs
IEEE Transactions on Circuits and Systems for Video Technology
A Flexible system level design methodology targeting run-time reconfigurable FPGAs
EURASIP Journal on Embedded Systems - Reconfigurable Computing and Hardware/Software Codesign
Improving the efficiency of run time reconfigurable devices by configuration locking
Proceedings of the conference on Design, automation and test in Europe
Modern development methods and tools for embedded reconfigurable systems: A survey
Integration, the VLSI Journal
Dynamic dependent tasks assignment for grid computing
ICA3PP'10 Proceedings of the 10th international conference on Algorithms and Architectures for Parallel Processing - Volume Part II
Resource management of distributed virtual machines
International Journal of Ad Hoc and Ubiquitous Computing
Dynamic Dependent Tasks Assignment for Grid Computing
International Journal of Grid and High Performance Computing
International Journal of Communication Networks and Distributed Systems
Hi-index | 0.00 |
Dynamically reconfigurable hardware not only has high silicon reusability, but it can also deliver high performance for computation-intensive tasks. Advanced features such as run-time reconfiguration allow multiple tasks to be mapped onto the same device either simultaneously or multiplexed in time domain. These tasks need to be scheduled optimally or near optimally in order to efficiently utilize the device. It is a NP-hard problem, because task scheduling, allocation and configuration prefetching all need to be considered. In this paper, we target dependent task models and propose three static schedulers that use different problem solving strategies. The first is a heuristic approach developed from traditional list-based schedulers. It presents high efficiency but the least accuracy. The second is based on a full-domain search using constraint programming. It can guarantee to produce optimal solutions but requires significant searching effort. The last is a guided random search technique based on a genetic algorithm, which shows reasonable efficiency and much better accuracy than the heuristic approach.