Optimization of dynamic hardware reconfigurations

DOI10.1023/A:1011188411132MaRDI QIDQ5945702zbMATH OpenFDO

Authors Jürgen Teich, Sándor P. Fekete, Jörg Schepers

Publication date 22 July 2002

Published in The Journal of Supercomputing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/A:1011188411132

zbMATH Keywords

field programmable gate arrayspacking classes

Mathematics Subject Classification ID

Computer system organization (68M99)

Recommendations

• On dynamic task scheduling for FPGA-based systems
• An evolutionary approach to dynamic task scheduling on FPGAs with restricted buffer.
• Interprocedural compiler optimization for partial run-time reconfiguration
• Dynamic reconfiguration architectures for multi-context FPGAs
• Hyperreconfigurable architectures and the partition into hypercontexts problem

Cited in

(12)

• Dynamic reconfiguration architectures for multi-context FPGAs
• An evolutionary approach to dynamic task scheduling on FPGAs with restricted buffer.
• An efficient list scheduling algorithm for time placement problem
• Interprocedural compiler optimization for partial run-time reconfiguration
• PackLib\(^{2}\): an integrated library of multi-dimensional packing problems
• The datapath merging problem in reconfigurable systems
• An efficient placement algorithm for run-time reconfigurable embedded system
• scientific article; zbMATH DE number 1844669 (Why is no real title available?)
• On dynamic task scheduling for FPGA-based systems
• Finding an optimal set of breakpoint locations in a control flow graph
• Hyperreconfigurable architectures and the partition into hypercontexts problem
• Dynamic reconfiguration: abstraction and optimal asynchronous solution

This page was built for publication: Optimization of dynamic hardware reconfigurations

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