Towards connectivity-guaranteed power-gating large-scale on-chip networks


In this work, we present an efficient and practical algorithm, named COPAL (Connectivity preserving algorithm), to identify routers, that will cause network disconnection in an off position, based on a distributed depth-first search (DFS) through &#x201C;neighbor-to-neighbor&#x201D; communication. The algorithm allows the runtime system to make effective power-gating decisions in on-chip network based systems. For an N-node network, the time complexity of COPAL is O(N) and the total number of messages sent in classifying nodes' criticality in optimizing network connectivity is of the order of 2Nlog<inf>2</inf>(N). FPGA implementation shows that the algorithm is scalable and the required hardware resource overhead is minimal.

DOI: 10.1109/IGCC.2016.7892613

6 Figures and Tables

Cite this paper

@article{Ren2016TowardsCP, title={Towards connectivity-guaranteed power-gating large-scale on-chip networks}, author={Pengju Ren and Michel A. Kinsy and Mengjiao Zhu and Nanning Zheng}, journal={2016 Seventh International Green and Sustainable Computing Conference (IGSC)}, year={2016}, pages={1-6} }