Luís Miguel Pinho

Luís Miguel Pinho

Auto-generated profile, based on publicly available information

Luís Miguel Pinho

Polytechnic Institute of Porto & INESC TEC, Porto, Portugal

Research Focus & Metrics

Academic Career Length

29Years (1998-Present)

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

Representative Publications

View All Publications
1 February 2015 in Computer Standards & Interfaces
Verified
Journal Article
Closed access
MAMichele Albano
Michele Albano
LFLuis Miguel Moreira Lino Ferreira
Luis Miguel Moreira Lino Ferreira
LPLuís Miguel Pinho
Luís Miguel Pinho
AAAbdel Rahman Alkhawaja
Abdel Rahman Alkhawaja

1 May 2016
Verified
Conference Paper
Closed access
JFJose Fonseca
Jose Fonseca
GNGeoffrey Nelissen
Geoffrey Nelissen
VNVincent Nelis
Vincent Nelis
LPLuis Miguel Pinho
Luis Miguel Pinho
11th IEEE International Symposium on Industrial Embedded Systems (SIES 2016). 23 to 25, May, 2016. Krakow, Poland.Several schedulability analyses have been proposed for a variety of parallel task systems with real-time constraints. However, these analyses are mostly restricted to global scheduling policies. The problem with global scheduling is that it adds uncertainty to the lower-level timing analysis which on multicore systems are heavily context-dependent. As parallel tasks typically exhibit intense communication and concurrency among their sequential computational units, this problem is further exacerbated. This paper considers instead the schedulability of partitioned parallel tasks. More precisely, we present a response time analysis for sporadic DAG tasks atop multiprocessors under partitioned fixed-priority scheduling. We assume the partitioning to be given. We show that a partitioned DAG task can be modeled as a set of self-suspending tasks. We then propose an algorithm to traverse a DAG and characterize such worst-case scheduling scenario. With minor modifications, any state-of-the-art technique for sporadic self-suspending tasks can thus be used to derived the worstcase response time of a partitioned DAG task. Experiments show that the proposed approach significantly tightens the worst-case response time of partitioned parallel tasks comparatively to the state-of-the-art when the most accurate technique is chosen.info:eu-repo/semantics/publishedVersio

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

19 December 2003 in IEEE Transactions on Computers
Verified
Journal Article
Closed access
LPL.M. Pinho
L.M. Pinho
Francisco VasquesFrancisco Vasques
Francisco Vasques
Controller area network (CAN) is a fieldbus network suitable for small-scale distributed computer controlled systems (DCCS), being appropriate for sending and receiving short real-time messages at speeds up to 1 Mbit/sec. Several studies are available on how to guarantee the real-time requirements of CAN messages, providing preruntime schedulability conditions to guarantee the real-time communication requirements of DCCS traffic. Usually, it is considered that CAN guarantees atomic multicast properties by means of its extensive error detection/signaling mechanisms. However, there are some error situations where messages can be delivered in duplicate or delivered only by a subset of the receivers, leading to inconsistencies in the supported applications. In order to prevent such inconsistencies, a middleware for reliable communication in CAN is proposed, taking advantage of CAN synchronous properties to minimize the runtime overhead. Such middleware comprises a set of atomic multicast and consolidation protocols, upon which the reliable communication properties are guaranteed. The related timing analysis demonstrates that, in spite of the extra stack of protocols, the real-time properties of CAN are preserved since the predictability of message transfer is guaranteed.

8 December 2014 in IEEE Transactions on Industrial Informatics
Verified
Journal Article
Closed access
MAMichele Albano
Michele Albano
LFLuis Miguel Moreira Lino Ferreira
Luis Miguel Moreira Lino Ferreira
LPLuis Miguel Pinho
Luis Miguel Pinho
The evolution of the electrical grid into a smart grid, allowing user production, storage, and exchange of energy; remote control of appliances; and, in general, optimizations over how the energy is managed and consumed, is an evolution into a complex information and communication technology (ICT) system. With the goal of promoting an integrated and interoperable smart grid, a number of organizations all over the world started uncoordinated standardization activities, which caused the emergence of a large number of incompatible architectures and standards. There are now new standardization activities that have the goal of organizing existing standards and produce best practices to choose the right approach(es) to be employed in specific smart grid designs. This paper follows the lead of the National Institute of Standards and Technology (NIST) and the European Telecommunications Standards Institute/European Committee for Standardization/European Committee for Electrotechnical Standardization (ETSI/CEN/CENELEC) approaches in trying to provide taxonomy of existing solutions; our contribution reviews and relates current ICT state of the art with the objective of forecasting future trends based on the orientation of current efforts and on relationships between them. The resulting taxonomy provides guidelines for further studies of the architectures, and highlights how the standards in the last mile of the smart grid are converging to common solutions to improve ICT infrastructure interoperability.

13 April 2015
Verified
Conference Paper
Open access
JFJosé Carlos Fonseca
José Carlos Fonseca
VNVincent Nélis
Vincent Nélis
GRGurulingesh Raravi
Gurulingesh Raravi
LPLuís Miguel Pinho
Luís Miguel Pinho
Owing to the current trends for higher performance and the ever growing availability of multiprocessors in the embedded computing (EC) domain, there is nowadays a strong push towards the parallelization of modern embedded applications. Several real-time task models have recently been proposed to capture different forms of parallelism. However, they do not deal explicitly with control flow information as they assume that all the threads of a parallel task must execute every time the task is activated. In contrast, in this paper, we present a multi-DAG model where each task is characterized by a set of execution flows, each of which represents a different execution path throughout the task code and is modeled as a DAG of sub-tasks. We propose a two-step solution that computes a single synchronous DAG of servers for a task modeled by a multi-DAG and show that these servers are able to supply every execution flow of that task with the required cpu-budget so that the task can execute entirely, irrespective of the execution flow taken at run-time, while satisfying its precedence constraints. As a result, each task can be modeled by its single DAG of servers, which facilitates in leveraging the existing single-DAG schedulability analyses techniques for analyzing the schedulability of parallel tasks with multiple execution flows.