Low Energy Mapping for Tree Based Networks-on-Chip
doi: 10.3969/j.issn.1001-0548.2010.04.029
- Received Date: 2008-11-17
- Rev Recd Date: 2009-04-13
- Publish Date: 2010-08-15
-
Key words:
- bipartitioning /
- energy optimization /
- mapping /
- networks-on-chip /
- tree based topology
Abstract: A recursive bipartitioning algorithm, RPM, is proposed for low energy mapping in tree-based Network-on-Chip (NoC) architectures subject to communication latency constraints. The mapping problem is formulated to multi-level IP core communication task graph partitioning problems, and the modified Kernighan-Lin mincut heuristic is used to solve them. Experimental results show that RPM obtains lower energy mapping solutions compared with existing algorithms.
Citation: | CHANG Zheng-wei, SANG Nan, XIONG Guang-ze. Low Energy Mapping for Tree Based Networks-on-Chip[J]. Journal of University of Electronic Science and Technology of China, 2010, 39(4): 607-611. doi: 10.3969/j.issn.1001-0548.2010.04.029 |