Dynamic response time optimization for SDF graphs
Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design
Holistic scheduling and analysis of mixed time/event-triggered distributed embedded systems
Proceedings of the tenth international symposium on Hardware/software codesign
A fast pseudo-boolean constraint solver
Proceedings of the 40th annual Design Automation Conference
How OEMs and suppliers can face the network integration challenges
Proceedings of the conference on Design, automation and test in Europe: Designers' forum
Multiobjective network design for realistic traffic models
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Period optimization for hard real-time distributed automotive systems
Proceedings of the 44th annual Design Automation Conference
Efficient symbolic multi-objective design space exploration
Proceedings of the 2008 Asia and South Pacific Design Automation Conference
Multiobjective EA approach for improved quality of solutions for spanning tree problem
EMO'05 Proceedings of the Third international conference on Evolutionary Multi-Criterion Optimization
Combined system synthesis and communication architecture exploration for MPSoCs
Proceedings of the Conference on Design, Automation and Test in Europe
Static memory optimization by clustering and neural networks in embedded devices
Proceedings of the 12th International Conference on Computer Systems and Technologies
Symbolic system synthesis in the presence of stringent real-time constraints
Proceedings of the 48th Design Automation Conference
Considering diagnosis functionality during automatic system-level design of automotive networks
Proceedings of the 49th Annual Design Automation Conference
Hi-index | 0.00 |
In this paper, a novel automatic approach for the concurrent topology and routing optimization that achieves a high quality network layout is proposed. This optimization is based on a specialized binary Integer Linear Program (ILP) in combination with a Multi-Objective Evolutionary Algorithm (MOEA). The ILP is formulated such that each solution represents a topology and routing that fulfills all requirements and demands of the network. Thus, in an iterative process, this ILP is solved to obtain feasible networks whereas the MOEA is used for the optimization of multiple even non-linear objectives and ensures a fast convergence towards the optimal solutions. Additionally, a domain specific preprocessing algorithm for the ILP is presented that decreases the problem complexity and, thus, allows to optimize large and complex networks efficiently. The experimental results validate the performance of this methodology on two state-of-the-art prototype automotive networks.