sensitivity-driven co-synthesis of distributed embedded systems
Abstract: Describes a new, sensitivity-driven algorithm for the co-synthesis of real-time distributed embedded systems. Many embedded computing systems are distributed systems: communicating periodic processes executing on several CPUs/ASICs connected by communication links. We use performance estimates to compute a local sensitivity of the design to process allocation. We propose a priority prediction method to schedule processes. Based on these techniques, we develop a gradient-search algorithm which co-synthesizes heterogeneous distributed systems of arbitrary topology and the associated application software architecture. Experimental results show that our algorithm can find good implementation architectures in small amounts of CPU time.
sensitive sensitivity-driven co-synthesis distributed embedding embedded systems systems abstraction algorithm real-time real-time distributed embedded systems computation distributed systems communication communicating periodic processes process asics communication links links use performance estimates locality local sensitivity design process allocation allocation priority prediction method priorities predict method scheduling gradient-search algorithm heterogeneity heterogeneous distributed systems arbitrary topology topologies association applications application software architecture software architecture architecture experimentation implementation cpu time timing search algorithm software engineering process scheduling synthesis logic design real-time systems distributed processing processor scheduling