Abstract
This paper considers the design problems of processor specification and task allocation for embedded computer systems. A graph partitioning-based representation is proposed that allows these problems to be solved concurrently. A custom design automation algorithm bared on this representation is then presented. This algorithm, named CP*-2, was benchmarked against two baseline algorithms on a combination of real and synthetic test cases with respect to two figures of merit: hardware cost and run-time. The real test cases are based on commercially developed automotive applications and the benchmark algorithms consist of heuristic and simulated annealing approaches. On average, CP*-2 was found to generate solutions with quality comparable to simulated annealing with up to an order of magnitude improvement in run-time.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
