Luís Nogueira

Prof. Luís Nogueira

School of Engineering (ISEP), Polytechnic of Porto (P.PORTO), Porto, Portugal
orcid

Research Focus & Metrics

Academic Career Length

24Years (2003-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 June 2009 in Journal of Parallel and Distributed Computing
Verified
Journal Article
Closed access
LNLuís Nogueira
Luís Nogueira
LPLuís Miguel Pinho
Luís Miguel Pinho

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.

28 December 2021 in Electronics
Verified
Journal Article
Open access
PDF file
JCJorge Coelho
Jorge Coelho
LNLuís Nogueira
Luís Nogueira
Internet of things (IoT) devices play a crucial role in the design of state-of-the-art infrastructures, with an increasing demand to support more complex services and applications. However, IoT devices are known for having limited computational capacities. Traditional approaches used to offload applications to the cloud to ease the burden on end-user devices, at the expense of a greater latency and increased network traffic. Our goal is to optimize the use of IoT devices, particularly those being underutilized. In this paper, we propose a pragmatic solution, built upon the Erlang programming language, that allows a group of IoT devices to collectively execute services, using their spare resources with minimal interference, and achieving a level of performance that otherwise would not be met by individual execution.

7 October 2012
Verified
Conference Paper
Open access
PDF file
LNLuís Nogueira
Luís Nogueira
LPLuís Miguel Pinho
Luís Miguel Pinho
Multicore platforms have transformed parallelism into a main concern. Parallel programming models are being put forward to provide a better approach for application programmers to expose the opportunities for parallelism by pointing out potentially parallel regions within tasks, leaving the actual and dynamic scheduling of these regions onto processors to be performed at runtime, exploiting the maximum amount of parallelism. It is in this context that this paper proposes a scheduling approach that combines the constant-bandwidth server abstraction with a priority-aware work-stealing load balancing scheme which, while ensuring isolation among tasks, enables parallel tasks to be executed on more than one processor at a given time instant