Claudio Maia

Claudio Maia

Auto-generated profile, based on publicly available information

Claudio Maia

CISTER/INESC-TEC, ISEP, Polytechnic Institute of Porto, Portugal

Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
8 October 2014
Verified
Conference Paper
Open access
PDF file
CMCláudio Maia
Cláudio Maia
MBMarko Bertogna
Marko Bertogna
LNLuís Nogueira
Luís Nogueira
LPLuis Miguel Pinho
Luis Miguel Pinho

7 November 2016
Verified
Conference Paper
Closed access
CMClaudio Maia
Claudio Maia
LNLuís Nogueira
Luís Nogueira
LPLuis Miguel Pinho
Luis Miguel Pinho
DPDaniel Gracia Perez
Daniel Gracia Perez
Commercial-of-the-shelf based multi-core systems present timing anomalies that cannot be ignored by the real-time systems community due to their unpredictable behaviour. These timing anomalies, often caused by applications' uncontrolled accesses to shared resources such as the components in the memory hierarchy or in the I/O subsystem, introduce interference that may lead to deadline misses if the problem is neglected.

1 August 2017
Verified
Conference Paper
Closed access
CMClaudio Maia
Claudio Maia
GNGeoffrey Nelissen
Geoffrey Nelissen
LNLuís Nogueira
Luís Nogueira
LPLuis Miguel Pinho
Luis Miguel Pinho
DPDaniel Gracia Perez
Daniel Gracia Perez
Scheduling real-time applications on general purpose multicore platforms is a challenging problem from a timing analysis perspective. Such platforms expose uncontrolled sources of interference whenever concurrent accesses to memory are performed. The non-deterministic bus and memory access behavior complicates the estimations of applications' worst-case execution times (WCET). The 3-phase task model seems a good candidate to circumvent the uncontrolled sources of interference by isolating concurrent memory accesses. A task is divided in three successive phases; first, the task loads its instruction and data in a local memory, then it executes non-preemptively using those pre-loaded instructions and data, and finally, the modified data are pushed back to main memory. Following this execution model, tasks never access the bus during their execution phase. Instead, all the bus accesses are performed during the first and third phases. In this paper, we focus on the global fixed-priority scheduling of the 3-phase task model. A new schedulability test is derived by modelling the interference happening on the bus rather than the interference on the cores as in the state-of-the-art techniques. The effectiveness of the test is evaluated by comparing it against the state-of-the-art.

1 October 2015
Verified
Conference Paper
Closed access
CMClaudio Maia
Claudio Maia
PYPatrick Meumeu Yomsi
Patrick Meumeu Yomsi
LNLuís Nogueira
Luís Nogueira
LPLuis Miguel Pinho
Luis Miguel Pinho
This paper explores the behavior of parallel fork-join tasks on multicore platforms by resorting to a semi-partitioned scheduling model. This model offers a promising framework to embedded systems which are subject to stringent timing constraints as it provides these systems with very interesting properties. The proposed approach consists of two stages -- an offline stage and an online stage. During the offline stage, a multi-frame task model is adopted to perform the fork-join task-to-core mapping so as to improve the schedulability and the performance of the system, and during the online stage, work-stealing is exploited among cores to improve the system responsiveness as well as to balance the execution workload. The objective of this work is twofold: (1) to provide an alternative technique that takes advantage of the semi-partitioned scheduling properties by offering the possibility to accommodate fork-join tasks that cannot be scheduled in any pure partitioned environment, and (2) to reduce the migration overhead which has shown to be a traditional major source of non-determinism in global approaches. The simulation results show an improvement of the proposed approach over the state-of-the-art of up to 15% of the average response-time per task set.

13 September 2017 in EURASIP Journal on Embedded Systems
Verified
Journal Article
Open access
PDF file
CMCláudio Maia
Cláudio Maia
PYPatrick Meumeu Yomsi
Patrick Meumeu Yomsi
LNLuís Nogueira
Luís Nogueira
LPLuis Miguel Pinho
Luis Miguel Pinho
This paper extends the work presented in Maia et al. (Semi-partitioned scheduling of fork-join tasks using work-stealing, 2015) where we address the semi-partitioned scheduling of real-time fork-join tasks on multicore platforms. The proposed approach consists of two phases: an offline phase where we adopt a multi-frame task model to perform the task-to-core mapping so as to improve the schedulability and the performance of the system and an online phase where we use the work-stealing algorithm to exploit tasks’ parallelism among cores with the aim of improving the system responsiveness. The objective of this work is twofold: (1) to provide an alternative scheduling technique that takes advantage of the semi-partitioned properties to accommodate fork-join tasks that cannot be scheduled in any pure partitioned environment and (2) to reduce the migration overheads which has been shown to be a traditional major source of non-determinism for global scheduling approaches. In this paper, we consider different allocation heuristics and we evaluate the behavior of two of them when they are integrated within our approach. The simulation results show an improvement up to 15% of the proposed heuristic over the state-of-the-art in terms of the average response time per task set.

1 June 2013
Verified
Conference Paper
Closed access
CMClaudio Maia
Claudio Maia
LNLuís Nogueira
Luís Nogueira
LPLuis Miguel Pinho
Luis Miguel Pinho
This paper proposes a model for scheduling parallel real-time tasks. The proposed model uses a work-stealing approach to schedule real-time parallel task sets at runtime, where each job may present a nested fork-join structure, generate an arbitrary number of parallel jobs, and each parallel job inherits the timing properties of the job that spawns it.