Low-complex dynamic programming algorithm for hardware/software partitioning

DOI10.1016/J.IPL.2005.12.008zbMATH Open1187.68688OpenAlexW2118737254WikidataQ58210207 ScholiaQ58210207MaRDI QIDQ844154FDOQ844154

Authors: Jigang Wu, Thambipillai Srikanthan 

Publication date: 18 January 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2005.12.008

Recommendations

• Algorithmic aspects for power-efficient hardware/software partitioning
• Algorithmic aspects for multiple-choice hardware/software partitioning
• Finding optimal hardware/software partitions
• An efficient heuristic for code partitioning
• Solving hardware/software partitioning via a discrete dynamic convexized method

zbMATH Keywords

algorithmsdynamic programmingcomplexityhardware/software partitioning

Mathematics Subject Classification ID

Dynamic programming (90C39) Nonnumerical algorithms (68W05) Computer system organization (68M99)

Cited In (5)

• Efficient heuristic algorithms for path-based hardware/software partitioning
• Algorithmic aspects for power-efficient hardware/software partitioning
• Hybrid algorithms for hardware/software partitioning and scheduling on reconfigurable devices
• Robust software partitioning with multiple instantiation
• Algorithmic aspects for multiple-choice hardware/software partitioning

This page was built for publication: Low-complex dynamic programming algorithm for hardware/software partitioning

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