research-article

Feed-Forward Routing for the Wormhole Switching Network-on-Chip of the Kalray MPPA2 Processor

Authors:

Benoît Dupont de Dinechin,

Amaury GraillatAuthors Info & Claims

NoCArc '17: Proceedings of the 10th International Workshop on Network on Chip Architectures

Article No.: 10, Pages 1 - 6

https://doi.org/10.1145/3139540.3139542

Published: 14 October 2017 Publication History

Abstract

The Kalray MPPA2-256 Bostan processor network-on-chip (NoC) implements wormhole switching without virtual channels and with source routing. As shown in earlier work, this NoC can be configured for guaranteed services by solving a set of linear inequalities based on deterministic network calculus (DNC). However, DNC assumes that a unique route is assigned to each flow and requires that the set of flows be feed-forward. We show that ensuring the feed-forward flows property is equivalent to deterministic deadlock-free routing on a wormhole switching NoC. While routing each flow between its given endpoints, minimal path diversity occurs and the choice of a particular unique path for each flow has an impact on the NoC bandwidth exploitation. We cast this choice as a max-min fairness with unsplittable paths problem, whose instances are solved by enumeration and by an efficient heuristic.

References

[1]

Edoardo Amaldi, Stefano Coniglio, Luca G. Gianoli, and Can Umut Ileri. 2013. On single-path network routing subject to max-min fair flow allocation. Electronic Notes in Discrete Mathematics 41 (2013), 543--550.

[2]

Hamdi Ayed, Jérôme Ermont, Jean-luc Scharbarg, and Christian Fraboul. 2016. Towards a unified approach for worst-case analysis of Tilera-like and Kalray-like NoC architectures. In Proc. of the 12th IEEE World Conf. on Factory Communication Systems (WFCS 2016), WiP Session. IEEE, Aveiro, Portugal.

[3]

Poona Bahrebar and Dirk Stroobandt. 2015. The Hamiltonian-based Odd-even Turn Model for Maximally Adaptive Routing in 2D Mesh Networks-on-chip. Comput. Electr. Eng. 45, C (July 2015), 386--401.

Digital Library

[4]

Anne Bouillard and Giovanni Stea. 2015. Worst-Case Analysis of Tandem Queue-ing Systems Using Network Calculus. In Quantitative Assessments of Distributed Systems, Bruneo and Distefano (Eds.).

[5]

Marc Boyer. 2016. Modlisation fine du NoC MPPA-256. Technical Report. ONERA.

[6]

Marc Boyer and Christian Fraboul. 2008. Tightening end to end delay upper bound for AFDX network calculus with rate latency FCFS servers using network calculus. In IEEE Inter. Workshop on Factory Communication Systems (WFCS), Dresden, Germany. IEEE, 11--20.

[7]

Shigang Chen and Klara Nahrstedt. 1998. Maxmin Fair Routing in Connection-Oriented Networks. In Proc. of Euro-Parallel and Distributed Systems Conference (Euro-PDS '98). 163--168.

[8]

Ge-Ming Chiu. 2000. The Odd-Even Turn Model for Adaptive Routing. IEEE Trans. Parallel Distrib. Syst. 11, 7 (July 2000), 729--738.

Digital Library

[9]

William Dally and Brian Towles. 2004. Principles and Practices of Interconnection Networks. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA.

Digital Library

[10]

W. J. Dally and C. L. Seitz. 1987. Deadlock-Free Message Routing in Multiprocessor Interconnection Networks. IEEE Trans. Comput. 36, 5 (May 1987), 547--553.

Digital Library

[11]

William J. Dally and Brian Towles. 2001. Route Packets, Not Wires: On-chip Inteconnection Networks. In Proc. of the 38th Annual Design Automation Conference. ACM, New York, USA.

Digital Library

[12]

Joan Adrià Ruiz De Azua and Marc Boyer. 2014. Complete Modelling of AVB in Network Calculus Framework. In Proc. of the 22Nd Int. Conf. on Real-Time Networks and Systems (RTNS '14). Article 55, 10 pages.

Digital Library

[13]

B. Dupont de Dinechin and A. Graillat. 2017. Network-on-Chip Service Guarantees on the Kalray MPPA-256 Bostan Processor. In Proc. of the 2nd Inter. Workshop on Advanced Interconnect Solutions and Technologies for Emerging Computing Systems -- AISTECS '17.

[14]

Markus Fidler and Gerrit Einhoff. 2004. Routing in Turn-Prohibition Based Feed-Forward Networks. In NETWORKING 2004, Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication, Third Int. IFIP-TC6 Networking Conference, Athens, Greece, May 9-14. 1168--1179.

[15]

V. Firoiu, J. Y. Le Boudec, D. Towsley, and Zhi-Li Zhang. 2002. Theories and models for Internet quality of service. Proc. of the IEEE 90, 9 (September 2002), 1565--1591.

[16]

Christopher J. Glass and Lionel M. Ni. 1992. The Turn Model for Adaptive Routing. In Proc. of the 19th Annual Int. Symp. on Computer Architecture (ISCA '92). 278--287.

[17]

Jean-Yves Le Boudec and Patrick Thiran. 2012. Network Calculus: A Theory of Deterministic Queuing Systems for the Internet. Springer-Verlag, Berlin, Heidelberg.

[18]

Lev B. Levitin, Mark G. Karpovsky, and Mehmet Mustafa. 2010. Minimal Sets of Turns for Breaking Cycles in Graphs Modeling Networks. IEEE Trans. Parallel Distrib. Syst. 21, 9 (2010), 1342--1353.

Digital Library

[19]

Zhonghai Lu, Mikael Millberg, Axel Jantsch, Alistair C. Bruce, Pieter van der Wolf, and Tomas Henriksson. 2009. Flow regulation for on-chip communication. In Design, Automation and Test in Europe, DATE 2009, Nice, France, April 20-24, 2009. 578--581.

[20]

Dritan Nace. 2002. A Linear Programming Based Approach for Computing Optimal Fair Splittable Routing. In Proc. of ISCC'02 (ISCC '02).

[21]

Ermis Papastefanakis, Xiaoting Li, and Laurent George. 2015. Deterministic Scheduling in Network-on-Chip Using the Trajectory Approach. In IEEE 18th Int. Symp. on Real-Time Distributed Computing, ISORC 2015, Auckland, New Zealand, 13-17 April, 2015. 60--65.

Digital Library

[22]

Yue Qian, Zhonghai Lu, and Wenhua Dou. 2010. Analysis of Worst-Case Delay Bounds for On-Chip Packet-Switching Networks. IEEE Trans. on CAD of Integrated Circuits and Systems 29, 5 (2010), 802--815.

Digital Library

[23]

Eberle A. Rambo and Rolf Ernst. 2015. Worst-case communication time analysis of networks-on-chip with shared virtual channels. In Proc. of DATE 2015, Grenoble, France, March 9-13, 2015. 537--542.

[24]

Selma Saidi, Rolf Ernst, Sascha Uhrig, Henrik Theiling, and Benoît Dupont de Dinechin. 2015. The shift to multicores in real-time and safety-critical systems. In CODES+ISSS 2015, Amsterdam, Netherlands, October 4-9, 2015. 220--229.

[25]

Jens B. Schmitt and Frank A. Zdarsky. 2006. The DISCO network calculator: a toolbox for worst case analysis. In Proc.of VALUETOOLS 2006, Pisa, Italy, October 11-13, 2006. 8.

Digital Library

[26]

David Starobinski, Mark G. Karpovsky, and Lev Zakrevski. 2002. Application of Network Calculus to General Topologies using Turn-Prohibition. In Proc.IEEE INFOCOM 2002, New York, USA, June 23-27, 2002. 1151--1159.

Cited By

Mercier RKillian CKritikakou AHelen YChillet D(2022)BiSuT: A NoC-Based Bit-Shuffling Technique for Multiple Permanent Faults MitigationIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/TCAD.2021.310140641:7(2276-2289)Online publication date: Jul-2022
https://doi.org/10.1109/TCAD.2021.3101406
Huh JLee D(2021)Effective On-Chip Communication for Message Passing Programs on Multi-Core ProcessorsElectronics10.3390/electronics1021268110:21(2681)Online publication date: 3-Nov-2021
https://doi.org/10.3390/electronics10212681
Dupont de Dinechin B(2021)A Qualitative Approach to Many‐core ArchitectureMulti‐Processor System‐on‐Chip 110.1002/9781119818298.ch2(27-51)Online publication date: 26-Mar-2021
https://doi.org/10.1002/9781119818298.ch2
Show More Cited By

Recommendations

Wormhole cut-through switching: Flit-level messages interleaving for virtual-channelless network-on-chip

A VLSI microrchitecture of a network-on-chip (NoC) router with a wormhole cut-through switching method is presented in this paper. The main feature of the NoC router is that, the wormhole messages can be interleaved (cut-through) at flit-level in the ...
Performance evaluation of wormhole routed network processor-memory interconnects
IPDPS'06: Proceedings of the 20th international conference on Parallel and distributed processing

Network line cards are experiencing ever increasing line rates, random data bursts, and limited space. Hence, they are more vulnerable than other processormemory environments, to create data transfer bottlenecks and hot-spots. Solutions to the memory ...
Network-on-chip service guarantees on the kalray MPPA-256 bostan processor
AISTECS '17: Proceedings of the 2nd International Workshop on Advanced Interconnect Solutions and Technologies for Emerging Computing Systems

The Kalray MPPA-256 Bostan manycore processor implements a clustered architecture, where clusters of cores share a local memory, and a DMA-capable network-on-chip (NoC) connects the clusters. The NoC implements wormhole switching without virtual ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

NoCArc '17: Proceedings of the 10th International Workshop on Network on Chip Architectures

October 2017

63 pages

ISBN:9781450355421

DOI:10.1145/3139540

Copyright © 2017 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 14 October 2017

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Research-article
Research
Refereed limited

Conference

MICRO-50

Sponsor:

SIGMICRO

MICRO-50: The 50th Annual IEEE/ACM International Symposium on Microarchitecture

October 14, 2017

MA, Cambridge, USA

Acceptance Rates

NoCArc '17 Paper Acceptance Rate 6 of 20 submissions, 30%;

Overall Acceptance Rate 46 of 122 submissions, 38%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
66
Total Downloads

Downloads (Last 12 months)6
Downloads (Last 6 weeks)0

Reflects downloads up to 14 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Mercier RKillian CKritikakou AHelen YChillet D(2022)BiSuT: A NoC-Based Bit-Shuffling Technique for Multiple Permanent Faults MitigationIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/TCAD.2021.310140641:7(2276-2289)Online publication date: Jul-2022
https://doi.org/10.1109/TCAD.2021.3101406
Huh JLee D(2021)Effective On-Chip Communication for Message Passing Programs on Multi-Core ProcessorsElectronics10.3390/electronics1021268110:21(2681)Online publication date: 3-Nov-2021
https://doi.org/10.3390/electronics10212681
Dupont de Dinechin B(2021)A Qualitative Approach to Many‐core ArchitectureMulti‐Processor System‐on‐Chip 110.1002/9781119818298.ch2(27-51)Online publication date: 26-Mar-2021
https://doi.org/10.1002/9781119818298.ch2
de Dinechin B(2019)Consolidating High-Integrity, High-Performance, and Cyber-Security Functions on a Manycore ProcessorProceedings of the 56th Annual Design Automation Conference 201910.1145/3316781.3323473(1-4)Online publication date: 2-Jun-2019
https://dl.acm.org/doi/10.1145/3316781.3323473

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents