Algorithmic aspects for power-efficient hardware/software partitioning
From MaRDI portal
Recommendations
- Finding optimal hardware/software partitions
- Algorithmic aspects for multiple-choice hardware/software partitioning
- Efficient heuristic algorithms for path-based hardware/software partitioning
- Low-complex dynamic programming algorithm for hardware/software partitioning
- Solving hardware/software partitioning via a discrete dynamic convexized method
Cites work
- A minimal algorithm for the multiple-choice knapsack problem
- Computational Science - ICCS 2004
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 1052006 (Why is no real title available?)
- scientific article; zbMATH DE number 1956466 (Why is no real title available?)
- Improved results on the 0--1 multidimensional knapsack problem
- New Greedy-Like Heuristics for the Multidimensional 0-1 Knapsack Problem
- The multidimensional 0-1 knapsack problem: an overview.
Cited in
(8)- Finding optimal hardware/software partitions
- Algorithmic aspects for multiple-choice hardware/software partitioning
- Power-Aware Variable Partitioning for DSPs With Hybrid PRAM and DRAM Main Memory
- scientific article; zbMATH DE number 862263 (Why is no real title available?)
- Knapsack model and algorithm for hardware/software partitioning problem
- A specification refinement methodology for power efficient partitioning of data-dominated algorithms within performance constraints
- Low-complex dynamic programming algorithm for hardware/software partitioning
- Efficient heuristic algorithms for path-based hardware/software partitioning
This page was built for publication: Algorithmic aspects for power-efficient hardware/software partitioning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1010046)