Empirical and theoretical lower bounds on energy consumption for networks on chip

Authors:
George Bezerra;Dorian Arnold;Stephanie Forrest
Affiliations:
Massachusetts Institute of Technology, CSAIL, Cambridge, MA;University of New Mexico, Albuquerque, NM;University of New Mexico, Albuquerque, NM
Venue:
Proceedings of the Sixth International Workshop on Network on Chip Architectures
Year:
2013

Citing 8
Cited 0

The SPLASH-2 programs: characterization and methodological considerations

ISCA '95 Proceedings of the 22nd annual international symposium on Computer architecture
The Raw Microprocessor: A Computational Fabric for Software Circuits and General-Purpose Programs

IEEE Micro
Energy-aware mapping for tile-based NoC architectures under performance constraints

ASP-DAC '03 Proceedings of the 2003 Asia and South Pacific Design Automation Conference
Implications of Rent's Rule for NoC Design and Its Fault-Tolerance

NOCS '07 Proceedings of the First International Symposium on Networks-on-Chip
A 5-GHz Mesh Interconnect for a Teraflops Processor

IEEE Micro
Rent's rule and parallel programs: characterizing network traffic behavior

Proceedings of the 2008 international workshop on System level interconnect prediction
ORION 2.0: a fast and accurate NoC power and area model for early-stage design space exploration

Proceedings of the Conference on Design, Automation and Test in Europe
The 48-core SCC Processor: the Programmer's View

Proceedings of the 2010 ACM/IEEE International Conference for High Performance Computing, Networking, Storage and Analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper focuses on the network on chip of multi-core systems and proposes empirical and theoretical lower bounds on the energy consumption of applications. The empirical method consists of an linear programming model that simultaneously reduces communication distances and network traffic. When applied to standard benchmarks, our method shows that locality exploitation can lead to 50% energy reduction on average compared to no optimization. The theoretical lower bound is based on the Rent's rule model from VLSI design, and is obtained analytically from the communication graph structure of applications. The theoretical results show excellent agreement with the empirical lower bound.