Solving hardware/software partitioning via a discrete dynamic convexized method

DOI10.1007/S11859-019-1405-7MaRDI QIDQ5210394zbMATH OpenOpenAlexFDO

Authors Geng Lin

Publication date 22 January 2020

Published in Wuhan University Journal of Natural Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11859-019-1405-7

zbMATH Keywords

binary integer programmingdynamic convexized methodhardware/software partitioninglocal search

Mathematics Subject Classification ID

Integer programming (90C10) Convex programming (90C25)

Recommendations

• Finding optimal hardware/software partitions
• Algorithmic aspects for multiple-choice hardware/software partitioning
• A discrete dynamic convexized method for VLSI circuit partitioning
• Efficient heuristic algorithms for path-based hardware/software partitioning
• scientific article; zbMATH DE number 2204010

Cited in

(9)

• Algorithmic aspects for power-efficient hardware/software partitioning
• Finding optimal hardware/software partitions
• A discrete dynamic convexized method for VLSI circuit partitioning
• Algorithmic aspects for multiple-choice hardware/software partitioning
• Research of the method of software/hardware partitioning in the embedded system
• scientific article; zbMATH DE number 2204010 (Why is no real title available?)
• Knapsack model and algorithm for hardware/software partitioning problem
• Low-complex dynamic programming algorithm for hardware/software partitioning
• Efficient heuristic algorithms for path-based hardware/software partitioning

This page was built for publication: Solving hardware/software partitioning via a discrete dynamic convexized method

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