Finding optimal hardware/software partitions

DOI10.1007/S10703-007-0039-0MaRDI QIDQ2461561zbMATH OpenOpenAlexFDO

Authors Zoltán Ádám Mann, András Orbán, Péter Arató

Publication date 28 November 2007

Published in Formal Methods in System Design (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10703-007-0039-0

zbMATH Keywords

Branch-and-boundHardware/software co-designHardware/software partitioningInteger linear programming

Mathematics Subject Classification ID

Computer system organization (68M99) Theory of software (68N99) Nonnumerical algorithms (68W05) Linear programming (90C05)

Recommendations

• Algorithmic aspects for multiple-choice hardware/software partitioning
• Algorithmic aspects for power-efficient hardware/software partitioning
• Efficient heuristic algorithms for path-based hardware/software partitioning
• Solving hardware/software partitioning via a discrete dynamic convexized method
• Integrated Formal Methods

Cites work

• A fast and robust network bisection algorithm
• An Efficient Heuristic Procedure for Partitioning Graphs
• scientific article; zbMATH DE number 1233950 (Why is no real title available?)
• scientific article; zbMATH DE number 1234104 (Why is no real title available?)
• SOS: Synthesis of application-specific heterogeneous multiprocessor systems

Cited in

(12)

• Algorithmic aspects for power-efficient hardware/software partitioning
• A constructive approach to hardware/software partitioning
• Exploring optimal solution to hardware/software partitioning for synchronous model
• A system level implementation strategy and partitioning heuristic for LUT-based applications
• Robust software partitioning with multiple instantiation
• Algorithmic aspects for multiple-choice hardware/software partitioning
• Optimal hardware/software co-synthesis for core-based SoC designs
• Solving hardware/software partitioning via a discrete dynamic convexized method
• Knapsack model and algorithm for hardware/software partitioning problem
• Integrated Formal Methods
• Low-complex dynamic programming algorithm for hardware/software partitioning
• Efficient heuristic algorithms for path-based hardware/software partitioning

Describes a project that uses

Uses Software

• MiBench

This page was built for publication: Finding optimal hardware/software partitions

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