An efficient placement algorithm for run-time reconfigurable embedded system

MaRDI QIDQ3619359zbMATH OpenFDO

Authors R. Guha, Nader Bagherzadeh, Pai H. Chou

Publication date 3 April 2009

zbMATH Keywords

application convergencereconfigurable computingtask mapping

Mathematics Subject Classification ID

Computer system organization (68M99) Nonnumerical algorithms (68W05)

Recommendations

• Resource management and task partitioning and scheduling on a run-time reconfigurable embedded system
• An efficient list scheduling algorithm for time placement problem
• scientific article; zbMATH DE number 1941082
• Optimization of dynamic hardware reconfigurations
• An evolutionary approach to dynamic task scheduling on FPGAs with restricted buffer.

Cited in

(3)

• Resource management and task partitioning and scheduling on a run-time reconfigurable embedded system
• An efficient list scheduling algorithm for time placement problem
• scientific article; zbMATH DE number 1941082 (Why is no real title available?)

This page was built for publication: An efficient placement algorithm for run-time reconfigurable embedded system

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