Comparing three heuristic search methods for functional partitioning in hardware–software codesign
This paper compares three heuristic search algorithms: genetic algorithm (GA), simulated
annealing (SA) and tabu search (TS), for hardware–software partitioning. The algorithms …
annealing (SA) and tabu search (TS), for hardware–software partitioning. The algorithms …
Low-complex dynamic programming algorithm for hardware/software partitioning
J Wu, T Srikanthan - Information processing letters, 2006 - Elsevier
A low-complex algorithm is proposed for the hardware/software partitioning. The proposed
algorithm employs dynamic programming principles while accounting for communication …
algorithm employs dynamic programming principles while accounting for communication …
Application partitioning on programmable platforms using the ant colony optimization
Modern digital systems consist of a complex mix of computational resources, eg
microprocessors, memory elements and reconfigurable logic. System partitioning–the …
microprocessors, memory elements and reconfigurable logic. System partitioning–the …
On a conjecture of Fefferman and Graham
S Kichenassamy - Advances in Mathematics, 2004 - Elsevier
In 1985, Fefferman and Graham have constructed a local embedding of an arbitrary real-
analytic manifold, of odd dimension n, into a Ricci-flat manifold of dimension n+ 2 admitting …
analytic manifold, of odd dimension n, into a Ricci-flat manifold of dimension n+ 2 admitting …
Hybrid approach to sonification of color images
I Kopecek, R Oslejsek - 2008 Third International Conference on …, 2008 - ieeexplore.ieee.org
This paper deals with the accessibility of graphics for visually impaired people. It presents a
novel method of sonification of complex graphical objects, such as color photographs, based …
novel method of sonification of complex graphical objects, such as color photographs, based …
A metaheuristic based on the tabu search for hardware-software partitioning
M Jemai, S Dimassi, B Ouni… - Turkish Journal of …, 2017 - journals.tubitak.gov.tr
Several metaheuristics have become increasingly interesting in solving combinatorial
problems. In this paper, we present an algorithm involving a metaheuristic based on tabu …
problems. In this paper, we present an algorithm involving a metaheuristic based on tabu …
[PDF][PDF] A new approach for task level computational resource bi-partitioning.
An essential problem for hardware/software codesign is the partitioning of an application
onto the computational resources. This paper presents a novel approach for the task level …
onto the computational resources. This paper presents a novel approach for the task level …
Task-based hardware reconfiguration in mobile robots using FPGAs
S Commuri, V Tadigotla, L Sliger - Journal of Intelligent and Robotic …, 2007 - Springer
This paper presents a methodology for the realization of intelligent, task-based
reconfiguration of the computational hardware for mobile robot applications. Task …
reconfiguration of the computational hardware for mobile robot applications. Task …
[BOOK][B] Synthesis techniques and optimizations for reconfigurable systems
R Kastner, A Kaplan, M Sarrafzadeh - 2003 - books.google.com
Synthesis Techniques and Optimization for Reconfigurable Systems discusses methods
used to model reconfigurable applications at the system level, many of which could be …
used to model reconfigurable applications at the system level, many of which could be …
Algorithmic aspects for functional partitioning and scheduling in hardware/software co-design
W Jigang, T Srikanthan, T Jiao - Design Automation for Embedded …, 2008 - Springer
Abstract Hardware/software (HW/SW) partitioning and scheduling are the crucial steps
during HW/SW co-design. It has been shown that they are classical combinatorial …
during HW/SW co-design. It has been shown that they are classical combinatorial …