3 research outputs found
Computing worst-case contention delays for networks on chip
Computing performance needs in domains such as automotive,
avionics, railway, and space are on the rise. This
is fueled by the trend towards implementing an increasing
number of product functionalities in software that ends up
managing huge amounts of data and implementing complex
artificial-intelligence functionalities [1], [2].
Manycores are able to satisfy, in a cost-efficient manner, the
computing needs of embedded real-time industry [3], [4]. In
this line, building as much as possible on manycore solutions
deployed in the high-performance (mainstream) market [5],
[6], contributes to further reduce costs and increase availability.
However, commercial off the shelf (COTS) manycores bring
several challenges for their adoption in the critical embedded
market. One of those is deriving timing bounds to tasks’
execution times as part of the overall timing validation and
verification processes [7]. In particular, the network-on-chip
(NoC) has been shown to be the main resource in which
contention arises, and hence hampers deriving tight bounds
to the timing of tasks [8]
Real-Time Application Mapping for Many-Cores Using a Limited Migrative Model
Many-core platforms are an emerging technology in the real-time embedded domain. These devices offer various options for power savings, cost reductions and contribute to the overall system flexibility, however, issues such as unpredictability, scalability and analysis pessimism are serious challenges to their integration into the aforementioned area. The focus of this work is on many-core platforms using a limited migrative model (LMM). LMM is an approach based on the fundamental concepts of the multi-kernel paradigm, which is a promising step towards scalable and predictable many-cores. In this work, we formulate the problem of real-time application mapping on a many-core platform using LMM, and propose a three-stage method to solve it. An extended version of the existing analysis is used to assure that derived mappings (i) guarantee the fulfilment of timing constraints posed on worst-case communication delays of individual applications, and (ii) provide an environment to perform load balancing for e.g. energy/thermal management, fault tolerance and/or performance reasons