Application-aware deadlock-free oblivious routing based on extended turn-model

• Published in: 2011 IEEE/ACM International Conference on Computer-Aided Design (ICCAD) pp. 213 - 218
• Main Authors: Shafiee, A., Zolghadr, M., Arjomand, M., Sarbazi-azad, H.
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01.11.2011
• Subjects: Clocks; Genetic algorithms; Jitter; Resource management; Routing; System recovery; Throughput
• ISBN: 1457713993; 9781457713996
• ISSN: 1092-3152; 1558-2434
• DOI: 10.1109/ICCAD.2011.6105328

Programmable hardware is gaining popularity as it can keep pace with growing performance demand in tight power budget, design and test cost, and serious reliability concerns of future multiprocessor embedded systems. Compatible with this trend, Network-on-Chip, as a potential bottleneck of future multi-cores, should also support programmability. Here, we address this issue in design and implementation of routing algorithm for two-dimensional mesh. To this end, we allocate paths based on input traffic pattern and in parallel with customizing routing restriction for deadlock freedom. To achieve this, we propose extended turn model (ETM), a novel parametric deadlock-free routing for 2D meshes that generalize prior turn-based routing methods (e.g., odd-even) with great degree of freedoms. This model facilitates design of Mixed-Integer Linear Programming (MILP) approach, which considers channel dependency turns as independent variables and decides for both path allocation and routing restriction. We solve this problem by genetic algorithm and evaluate it using simulation experiments. Results reveal that application-aware ETM-based path allocation outperforms prior turn-based approaches under synthetic and real traffic loads.