Software Allocation in Automotive Networked Embedded Systems: A Graph-Based Approach

Complex automotive networked embedded systems require novel algorithms for exploring different design decisions at early stages of the design flow. The problem of allocating the software components on electronic control units lies at the core of these design decisions. This chapter formalizes this allocation problem using graph theory. The proposed formalism allows the designer to use a wide variety of graph-theoretic optimization algorithms, which are capable of minimizing more than one criterion simultaneously. The proposed algorithm is then proven, by means of numerical examples, to find the same solution as mathematical optimization, but it is 15 times faster in computation time.

[1]  Xiao Xun,et al.  An Application of Vertex Partition for Parallel Test Tasks Scheduling in Automatic Test System , 2008, 2008 International Conference on Computer Science and Software Engineering.

[2]  Luca P. Carloni,et al.  Synthesis of Distributed Execution Platforms for Cyber-Physical Systems with Applications to High-Performance Buildings , 2011, 2011 IEEE/ACM Second International Conference on Cyber-Physical Systems.

[3]  Franco Fummi,et al.  Modeling of Communication Infrastructure for Design-Space Exploration , 2010, FDL.

[4]  J.G.F. Coutinho,et al.  Integrated Hardware/Software Codesign for Heterogeneous Computing Systems , 2008, 2008 4th Southern Conference on Programmable Logic.

[5]  Yen-Tai Lai,et al.  Graph-theory-based simplex algorithm for VLSI layout spacingproblems with multiple variable constraints , 2001, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[6]  R. M. Mattheyses,et al.  A Linear-Time Heuristic for Improving Network Partitions , 1982, 19th Design Automation Conference.

[7]  Vinay Srinivasan Honnavara.  Cost Optimization by Method of Allocating Software Component Units to Electronic Control Units for Model-Driven Designs , 2008 .

[8]  P. Sadayappan,et al.  Task allocation onto a hypercube by recursive mincut bipartitioning , 1988, C3P.

[9]  Vipin Kumar,et al.  A New Algorithm for Multi-objective Graph Partitioning , 1999, Euro-Par.

[10]  Xiaowen Wu,et al.  Satisfiability Modulo Graph Theory for Task Mapping and Scheduling on Multiprocessor Systems , 2011, IEEE Transactions on Parallel and Distributed Systems.

[11]  Li Shuiping,et al.  A global method for the limited K‐partitioning of hypergraphs representing optimal design problems in complex machine systems , 2010 .

[12]  George Karypis,et al.  Multilevel algorithms for partitioning power-law graphs , 2006, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium.

[13]  Brian W. Kernighan,et al.  An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..