HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

Computing Routes and Delay Bounds for the Network-on-Chip of the Kalray MPPA2 Processor

Abstract : The Kalray MPPA2 manycore processor implements a clustered architecture, where clusters of cores share a local memory, and communicate through a RDMA-capable network-on-chip (NoC). This NoC has been designed to allow guaranteed delays by the adequate configuration of traffic limiters at ingress and the choice of routing. We first present the challenges related to the routing of concurrent flows and a strategy that solves it. Routing challenges include deadlock-free routing, which is always an issue on wormhole switching networks, fairness of resource allocation between flows, and ensuring the feed-forward property required by deterministic network calculus (DNC). Second, we present a linear formulation based on DNC for computing end-to-end delay bounds of concurrent feed-forward flows on the MPPA2 NoC. Finally, we compare this linear formulation to a classic formulation originally designed for the AFDX avionics networks.
Complete list of metadata

Cited literature [29 references]  Display  Hide  Download

Contributor : Marc Boyer Connect in order to contact the contributor
Submitted on : Tuesday, February 13, 2018 - 11:23:23 AM
Last modification on : Wednesday, November 3, 2021 - 4:31:12 AM
Long-term archiving on: : Monday, May 7, 2018 - 1:49:51 PM


Files produced by the author(s)


  • HAL Id : hal-01707911, version 1



Marc Boyer, Benoît Dupont de Dinechin, Amaury Graillat, Lionel Havet. Computing Routes and Delay Bounds for the Network-on-Chip of the Kalray MPPA2 Processor. ERTS 2018 - 9th European Congress on Embedded Real Time Software and Systems, Jan 2018, Toulouse, France. ⟨hal-01707911⟩



Record views


Files downloads