Presentation 2012-11-01
A Note on the Energy-Aware Mapping for NoCs
Satoshi TAYU, Shuichi UENO,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) The mapping problem for NoCs is to decide how to assign the tasks of an application onto the PEs of a network such that some objective function is optimized. The mapping problem is one of the most fundamental problems on the design of NoCs, since the application mapping onto the network greatly impacts both the performance and energy consumption of the NoC. It has been known that the energy-aware mapping problem is NP-hard even if an application graph is a caterpillar with degree at most four and a network graph is a square mesh. This paper considers a special case of the problem which is solvable in polynomial time.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) dilation / Energy-Aware Mapping / NoCs
Paper # CAS2012-51,MSS2012-31
Date of Issue

Conference Information
Committee MSS
Conference Date 2012/10/25(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Mathematical Systems Science and its applications(MSS)
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) A Note on the Energy-Aware Mapping for NoCs
Sub Title (in English)
Keyword(1) dilation
Keyword(2) Energy-Aware Mapping
Keyword(3) NoCs
1st Author's Name Satoshi TAYU
1st Author's Affiliation Department of Communications and Integrated Systems Tokyo Institute of Technology()
2nd Author's Name Shuichi UENO
2nd Author's Affiliation Department of Communications and Integrated Systems Tokyo Institute of Technology
Date 2012-11-01
Paper # CAS2012-51,MSS2012-31
Volume (vol) vol.112
Number (no) 274
Page pp.pp.-
#Pages 6
Date of Issue