An evolutionary approach to dynamic task scheduling on FPGAs with restricted buffer.

DOI10.1006/JPDC.2002.1853MaRDI QIDQ1867336zbMATH OpenOpenAlexFDO

Authors Bernd Scheuermann, Hartmut Schmeck, Hossam ElGindy, Martin Middendorf

Publication date 2 April 2003

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jpdc.2002.1853

zbMATH Keywords

genetic algorithmsreconfigurable computingdynamic taskFPGAsscheduling.

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• On dynamic task scheduling for FPGA-based systems
• scientific article; zbMATH DE number 1941082
• Optimization of dynamic hardware reconfigurations
• An efficient list scheduling algorithm for time placement problem
• Maximal strips data structure to represent free space on partially reconfigurable FPGAs

Cited in

(8)

• Optimization of dynamic hardware reconfigurations
• Task scheduling in a finite-resource, reconfigurable hardware/software codesign environment
• An efficient list scheduling algorithm for time placement problem
• Finding an optimal set of breakpoint locations in a control flow graph
• scientific article; zbMATH DE number 1941082 (Why is no real title available?)
• Real Time Image Rotation Using Dynamic Reconfiguration
• On dynamic task scheduling for FPGA-based systems
• An efficient placement algorithm for run-time reconfigurable embedded system

This page was built for publication: An evolutionary approach to dynamic task scheduling on FPGAs with restricted buffer.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1867336)