Synthesis of distributed embedded systems

This paper presents a new approach for modeling and synthesis of distributed embedded systems. These systems are represented as task graphs and modeled using finite domain constraints. The synthesis of such models into a distributed architecture consisting of microprocessors, ASICs and communication devices, is then defined as an optimization problem and it is solved using constraint solving techniques. The presented approach offers a powerful modeling technique of advanced features, such as conditional subtasks and functional pipelining. The experimental results prove the feasibility of this approach and runtimes which are of several orders of magnitude faster than the runtimes of respective MILP formulations