MARCO: A High-performance Task M apping a nd R outing Co -optimization Framework for Point-to-Point NoC-based Heterogeneous Computing Systems
Authors:
Open Access
- 17 September 2021
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Embedded Computing Systems
- Vol. 20 (5s) , 1-21
Abstract
Heterogeneous computing systems (HCSs), which consist of various processing elements (PEs) that vary in their processing ability, are usually facilitated by the network-on-chip (NoC) to interconnect its components. The emerging point-to-point NoCs which support single-cycle-multi-hop transmission, reduce or eliminate the latency dependence on distance, addressing the scalability concern raised by high latency for long-distance transmission and enlarging the design space of the routing algorithm to search the non-shortest paths. For such point-to-point NoC-based HCSs, resource management strategies which are managed by compilers, scheduler, or controllers, e.g., mapping and routing, are complicated for the following reasons: (i) Due to the heterogeneity, mapping and routing need to optimize computation and communication concurrently (for homogeneous computing systems, only communication). (ii) Conducting mapping and routing consecutively cannot minimize the schedule length in most cases since the PEs with high processing ability may locate in the crowded area and suffer from high resource contention overhead. (iii) Since changing the mapping selection of one task will reconstruct the whole routing design space, the exploration of mapping and routing design space is challenging. Therefore, in this work, we propose MARCO, the m apping a nd r outing co -optimization framework, to decrease the schedule length of applications on point-to-point NoC-based HCSs. Specifically, we revise the tabu search to explore the design space and evaluate the quality of mapping and routing. The advanced reinforcement learning (RL)algorithm, i.e., advantage actor-critic, is adopted to efficiently compute paths. We perform extensive experiments on various real applications, which demonstrates that the MARCO achieves a remarkable performance improvement in terms of schedule length (+44.94% ∼ +50.18%) when compared with the state-of-the-art mapping and routing co-optimization algorithm for homogeneous computing systems. We also compare MARCO with different combinations of state-of-the-art mapping and routing approaches.Keywords
Funding Information
- Ministry of Education, Singapore (Tier 2 (MoE2019-T2-1-071) and Tier 1 (MoE2019-T1-001-072))
- Nanyang Technological University, Singapore (NAP (M4082282) and SUG (M4082087))
This publication has 27 references indexed in Scilit:
- A Hybrid Task Mapping Algorithm for Heterogeneous MPSoCsACM Transactions on Embedded Computing Systems, 2015
- Mapping Non-trivial Network Topologies Onto Chips2013
- Approaching the theoretical limits of a mesh NoC with a 16-node chip prototype in 45nm SOI2012
- Communication-aware heuristics for run-time task mapping on NoC-based MPSoC platformsJournal of Systems Architecture, 2010
- Run-time Spatial Mapping of Streaming Applications to Heterogeneous Multi-Processor SystemsInternational Journal of Parallel Programming, 2009
- A methodology for design of application specific deadlock-free routing algorithms for NoC systems2006
- DyAD2004
- The odd-even turn model for adaptive routingIEEE Transactions on Parallel and Distributed Systems, 2000
- Robust taboo search for the quadratic assignment problemParallel Computing, 1991
- An adaptive optimal controller for discrete-time Markov environmentsInformation and Control, 1977