Transformational partitioning for co-design of multiprocessor systems
ICCAD '97 Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design
A codesign experiment in acoustic echo cancellation: GMDFα
ACM Transactions on Design Automation of Electronic Systems (TODAES)
A path analysis based partitioning for time constrained embedded systems
Proceedings of the 6th international workshop on Hardware/software codesign
A hardware-software cosynthesis technique based on heterogeneous multiprocessor scheduling
CODES '99 Proceedings of the seventh international workshop on Hardware/software codesign
DATE '99 Proceedings of the conference on Design, automation and test in Europe
Optimal message-passing for data coherency in distributed architecture
Proceedings of the 15th international symposium on System Synthesis
Hardware/Software Partitioning using Integer Programming
EDTC '96 Proceedings of the 1996 European conference on Design and Test
A generic multi-unit architecture for codesign methodologies
CODES '97 Proceedings of the 5th International Workshop on Hardware/Software Co-Design
A Codesign Experiment in Acoustic Echo Cancellation: GMDFa
ISSS '96 Proceedings of the 9th international symposium on System synthesis
Hardware/Software Partitioning for Telecommunications Systems
COMPSAC '96 Proceedings of the 20th Conference on Computer Software and Applications
Partitioning of embedded applications onto heterogeneous multiprocessor architectures
Proceedings of the 2003 ACM symposium on Applied computing
Reliability-Centric Hardware/Software Co-Design
ISQED '05 Proceedings of the 6th International Symposium on Quality of Electronic Design
A clustering technique to optimize hardware/software synchronization
Proceedings of the 2005 Asia and South Pacific Design Automation Conference
Efficient design methods for embedded communication systems
EURASIP Journal on Embedded Systems
Using Genetic Algorithms for solving partitioning problem in codesign
IWANN '03 Proceedings of the 7th International Work-Conference on Artificial and Natural Neural Networks: Part II: Artificial Neural Nets Problem Solving Methods
Solving partitioning problem in codesign with ant colonies
IWINAC'05 Proceedings of the First international work-conference on the Interplay Between Natural and Artificial Computation conference on Artificial Intelligence and Knowledge Engineering Applications: a bioinspired approach - Volume Part II
Hi-index | 0.00 |
The extended partitioning problem is the joint problem of mapping nodes in a precedence graph to hardware or software, and within each mapping, selecting an appropriate implementation for each node. The end-goal is to minimize the hardware area, subject to architectural and performance constraints. This is an NP-complete problem; we present an efficient heuristic called MIBS to solve it. The MIBS (Mapping and Implementation-Bin Selection) algorithm solves the extended partitioning problem by decomposing it into an iterative process consisting of two steps: mapping and implementation-bin selection (IBS). The GCLP (Global Criticality/Local Phase-driven) algorithm computes a mapping by using an adaptive optimization objective at each iteration. This objective is selected on the basis of a global time criticality measure and local optimality measures. The IBS algorithm solves the implementation-bin selection problem. It uses a bin sensitivity measure which correlates the implementation bin motion with the overall hardware area reduction, to determine the implementation bin of a node for a given mapping. Experimental results indicate that the added dimension of design flexibility (offered by implementation bins) can be used effectively in partitioning to reduce the overall area. The MIBS algorithm has O(|N|/sup 3/) complexity, with a solution quality comparable to that of ILP (integer linear programming).