A3MAP: architecture-aware analytic mapping for networks-on-chip
Wooyoung Jang,David Z. Pan +1 more
- pp 523-528
Reads0
Chats0
TLDR
This paper proposes a novel and global A3MAP (Architecture-Aware Analytic Mapping) algorithm applied to NoC based MPSoC (Multi-Processor System-on-Chip) not only with homogeneous cores on regular mesh architecture as done by most previous mapping algorithms but also with heterogeneity cores on irregular mesh or custom architecture.Abstract:
In this paper, we propose a novel and global A3MAP (Architecture-Aware Analytic Mapping) algorithm applied to NoC (Networks-on-Chip) based MPSoC (Multi-Processor System-on-Chip) not only with homogeneous cores on regular mesh architecture as done by most previous mapping algorithms but also with heterogeneous cores on irregular mesh or custom architecture. As a main contribution, we develop a simple yet efficient interconnection matrix that models any task graph and network. Then, task mapping problem is exactly formulated to an MIQP (Mixed Integer Quadratic Programming). Since MIQP is NP-hard [15], we propose two effective heuristics, a successive relaxation algorithm and a genetic algorithm. Experimental results show that A3MAP by the successive relaxation algorithm reduces an amount of traffic up to 5.7%, 16.1% and 7.3% on average in regular mesh, irregular mesh and custom network, respectively, compared to the previous state-of-the-art work [1]. A3MAP by the genetic algorithm reduces more traffic up to 8.8%, 29.4% and 16.1 % on average than [1] in regular mesh, irregular mesh and custom network, respectively even if its runtime is longer.read more
Citations
More filters
Journal ArticleDOI
A survey on application mapping strategies for Network-on-Chip design
TL;DR: A detailed survey of the work done in last one decade in the domain of application mapping is presented, apart from classifying the reported techniques, it also performs a quantitative comparison among them.
Journal ArticleDOI
UNISM: Unified Scheduling and Mapping for General Networks on Chip
TL;DR: A unified task scheduling and core mapping algorithm called UNISM is proposed for different NOC architectures including regular mesh, irregular mesh and custom networks, and a novel graph model is proposed to consider the network irregularity and estimate communication energy and latency.
Journal ArticleDOI
A Voltage-Frequency Island Aware Energy Optimization Framework for Networks-on-Chip
Wooyoung Jang,David Z. Pan +1 more
TL;DR: This paper presents a partitioning, mapping, routing and interface optimization framework for energy-efficient voltage-frequency island (VFI) based networks-on-chip and proves that this framework achieves better power-performance trade-offs.
Journal ArticleDOI
A3MAP: Architecture-aware analytic mapping for networks-on-chip
Wooyoung Jang,David Z. Pan +1 more
TL;DR: This paper proposes a novel and global A3MAP (Architecture-Aware Analytic Mapping) algorithm applied to NoC based MPSoC (Multi-Processor System-on-Chip) not only with homogeneous cores on regular mesh architecture as done by most previous mapping algorithms but also with heterogeneity cores on irregular mesh or custom architecture.
Proceedings ArticleDOI
A Gracefully Degrading and Energy-Efficient Fault Tolerant NoC Using Spare Core
TL;DR: The simulation outcomes of many fault injection tests indicate that the proposed energy efficient fault tolerant NoC architecture using spare core results in performance enhancement while also saving communication energy.
References
More filters
Proceedings ArticleDOI
Route packets, not wires: on-chip interconnection networks
William J. Dally,Brian Towles +1 more
TL;DR: This paper introduces the concept of on-chip networks, sketches a simple network, and discusses some challenges in the architecture and design of these networks.
Journal ArticleDOI
P-Complete Approximation Problems
Sartaj Sahni,Teofilo F. Gonzalez +1 more
TL;DR: For P- complete problems such as traveling salesperson, cycle covers, 0-1 integer programming, multicommodity network flows, quadratic assignment, etc., it is shown that the approximation problem is also P-complete.
Book
Lectures on Discrete Geometry
TL;DR: This book is primarily a textbook introduction to various areas of discrete geometry, in which several key results and methods are explained, in an accessible and concrete manner, in each area.
Proceedings Article
A study of permutation crossover operators on the traveling salesman problem
TL;DR: In this paper, three permutation crossovers are analyzed to characterize how they sample the o-schema space, and hence what type of problems they may be applicable to.
TGFF: task graphs for free
TL;DR: A user-controllable, general-purpose, pseudorandom task graph generator called Task Graphs For Free, which has the ability to generate independent tasks as well as task sets which are composed of partially ordered task graphs.