An Optimal Approach to Hardware/software Partitioning for Synchronous Model

Computer aided hardware/software partitioning is one of the key challenges in hardware/software co-design. This paper describes a new approach to hardware/software partitioning for synchronous communication model. We transform the partitioning into a reachability problem of timed automata. By means of an optimal reachability algorithm, an optimal solution can be obtained in terms of limited resources in hardware. To relax the initial condition of the partitioning for optimization, two algorithms are designed to explore the dependency relations among processes in the initial specification. Moreover, we propose a scheduling algorithm to improve the synchronous communication e#ciency further after partitioning stage. Some experiments are conducted with model checker UPPAAL to show our approach is both e#ective and e#cient. Pu Geguang is a fellow at UNU/IIST on leave from the School of Mathematical of Bejing University, China, where he is a Ph.D candidate. His research interest includes programming theory, codesign techniques for real-time systems, object-oriented technology. Email: [email protected] Wang Yi is a professor at Uppsala University, Sweden. His research interests are mainly in methods and tools for the design, verification and implementation of embedded and real time systems. Email: [email protected] Dang van Hung is a research fellow of UNU/IIST, on leave of absence from the Institute of Information Technology, Hanoi, Vietnam. His research interests include formal techniques of programming, concurrent and distributed systems, real-time systems. Email: [email protected] He Jifeng is a senior research-fellow of UNU/IIST. He is also a professor of computer science at the Software Engineering Institute of East China Normal University. His research interests include t..