Abstract: Multi-core processor is often used to improve the calculation speed of the embedded system
with high real-time requirement, therefore, it needs to disintegrate the functional task of the embedded
electronic system with high complexity, mapping it into different sizes of processors to reliably perform
the function of complex systems. Combining with the relevant graph theoretical basis, a task graph
partitioning method is proposed with the Manhattan distance as the partitioning criteria. Take the binary
multiplier as an example, dividing its task graph, and comparing the method with the re-partitioning
method. Results analysis show that the number of nodes in task subgraphs is reduced by the partition,
and the communication time between the task subgraphs is short relatively, this verifies the
effectiveness of the partitioning method, which is conducive to the implementation of complex
embedded electronic systems.

Key words: embedded electronic systems, Manhattan distance, task graph, partitioning