Paulo Baltarejo Sousa
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Paulo Baltarejo Sousa has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Eduardo Tovar
CISTER
6 shared publications - Luis Lino Ferreira
CISTER, ISEP/INESC-TEC, Polytechnic Institute of Porto, Porto, Portugal
5 shared publications - Konstantinos Bletsas
CISTER Research Centre and ISEP/IPP, Porto, Portugal
4 shared publications - Pedro Ferreira Souto
CISTER, Faculdade de Engenharia, Universidade do Porto, Porto, Portugal
3 shared publications Bjorn Andersson
2 shared publications- Jorge Landeck
Centro de Instrumentação, Department of Physics, University of Coimbra, Coimbra, Portugal
2 shared publications
Latest Publications
- Open Access
Flexible Loads Scheduling Algorithms for Renewable Energy Communities
Renewable Energy Communities (RECs) are emerging as an effective concept and model to empower the active participation of citizens in the energy transition, not only as energy consumers but also as promoters of environmentally friendly energy generation solutions, particularly through the use of photovoltaic panels. This paper aims to contribute to the management and optimization of individual and community Distributed Energy Resources (DER). The solution follows a price and source-based REC management program, in which consumers’ day-ahead flexible loads (Flex Offers) are shifted according to electricity generation availability, prices, and personal preferences, to balance the grid and incentivize user participation. The heuristic approach used in the proposed algorithms allows for the optimization of energy resources in a distributed edge-and-fog approach with a low computational overhead. The simulations performed using real-world energy consumption and flexibility data of a REC with 50 dwellings show an average cost reduction, taking into consideration all the seasons of the year, of 6.5%, with a peak of 12.2% reduction in the summer, and an average increase of 32.6% in individual self-consumption. In addition, the case study demonstrates promising results regarding grid load balancing and the introduction of intra-community energy trading.
Open AccessFlexible Loads Scheduling Algorithms for Renewable Energy Communities
Renewable Energy Communities (RECs) are emerging as an effective concept and model to empower the active participation of citizens in the energy transition, not only as energy consumers but also as promoters of environmentally friendly energy generation solutions, particularly through the use of photovoltaic panels. This paper aims to contribute to the management and optimization of individual and community Distributed Energy Resources (DER). The solution follows a price and source-based REC management program, in which consumers’ day-ahead flexible loads (Flex Offers) are shifted according to electricity generation availability, prices, and personal preferences, to balance the grid and incentivize user participation. The heuristic approach used in the proposed algorithms allows for the optimization of energy resources in a distributed edge-and-fog approach with a low computational overhead. The simulations performed using real-world energy consumption and flexibility data of a REC with 50 dwellings show an average cost reduction, taking into consideration all the seasons of the year, of 6.5%, with a peak of 12.2% reduction in the summer, and an average increase of 32.6% in individual self-consumption. In addition, the case study demonstrates promising results regarding grid load balancing and the introduction of intra-community energy trading.
- Open Access
- 20 October 2022
- Published by MDPI AG in Preprints.org
Flexible Loads Scheduling Algorithms for Renewable Energy Communities
Renewable Energy Communities (RECs) are emerging as an effective concept and model to empower the active participation of citizens on the energy transition, not only as energy consumers, but also as promoters of environmentally friendly energy generation solutions. This paper aims to contribute to the management and optimization of individual and community Distributed Energy Resources (DER). The solution follows a price and source-based REC management program, in which consumers day-ahead flexible loads (Flex Offers) are shifted according to electricity generation availability, prices and personal preferences, to balance the grid and incentivize user participation. The heuristic approach used in the proposed algorithms allows the optimization of energy resources in a distributed edge and fog approach with a low computational overhead. The simulations performed using real world energy consumption and flexibility data of a REC with 50 dwellings show an average cost reduction of 10.6% and an average increase of 11.4% in individual self-consumption. Additionally, the case-study demonstrates promising results regarding grid load balancing and the introduction of intra-community energy trading.
- 20 October 2022
- Published by MDPI AG in Preprints.org
Open AccessFlexible Loads Scheduling Algorithms for Renewable Energy Communities
Renewable Energy Communities (RECs) are emerging as an effective concept and model to empower the active participation of citizens on the energy transition, not only as energy consumers, but also as promoters of environmentally friendly energy generation solutions. This paper aims to contribute to the management and optimization of individual and community Distributed Energy Resources (DER). The solution follows a price and source-based REC management program, in which consumers day-ahead flexible loads (Flex Offers) are shifted according to electricity generation availability, prices and personal preferences, to balance the grid and incentivize user participation. The heuristic approach used in the proposed algorithms allows the optimization of energy resources in a distributed edge and fog approach with a low computational overhead. The simulations performed using real world energy consumption and flexibility data of a REC with 50 dwellings show an average cost reduction of 10.6% and an average increase of 11.4% in individual self-consumption. Additionally, the case-study demonstrates promising results regarding grid load balancing and the introduction of intra-community energy trading.
- 1 August 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 23251271,p. 110-121
Overhead-Aware Schedulability Evaluation of Semi-Partitioned Real-Time Schedulers
Schedulability analyses, while valuable in theoretical research, cannot be used in practice to reason about the timing behaviour of a real-time system without including the overheads induced by the implementation of the scheduling algorithm. In this paper, we provide an overhead-aware schedulability analysis based on demand bound functions for two hard real-time semi-partitioned scheduling algorithms, EDF-WM and C=D. This analysis is based on a novel implementation that uses a global clock to reduce the overheads incurred due to the release jitter of migrating subtasks. The analysis is used to guide the respective off-line task assignment and splitting procedures. Finally, results of an evaluation are provided highlighting how the different algorithms perform with and without a consideration of overheads.
- 1 August 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 23251271,p. 110-121
Overhead-Aware Schedulability Evaluation of Semi-Partitioned Real-Time Schedulers
Schedulability analyses, while valuable in theoretical research, cannot be used in practice to reason about the timing behaviour of a real-time system without including the overheads induced by the implementation of the scheduling algorithm. In this paper, we provide an overhead-aware schedulability analysis based on demand bound functions for two hard real-time semi-partitioned scheduling algorithms, EDF-WM and C=D. This analysis is based on a novel implementation that uses a global clock to reduce the overheads incurred due to the release jitter of migrating subtasks. The analysis is used to guide the respective off-line task assignment and splitting procedures. Finally, results of an evaluation are provided highlighting how the different algorithms perform with and without a consideration of overheads.
- 8 July 2014
- Published by Springer Nature in Real-Time Systems
- Vol. 50 (5-6) , 680-735
Unified overhead-aware schedulability analysis for slot-based task-splitting
- 8 July 2014
- Published by Springer Nature in Real-Time Systems
- Vol. 50 (5-6) , 680-735
Unified overhead-aware schedulability analysis for slot-based task-splitting
- 1 August 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 12-21
The Carousel-EDF scheduling algorithm for multiprocessor systems
We present Carousel-EDF, a new hierarchical scheduling algorithm for a system of identical processors, and its overhead-aware schedulability analysis based on demand bound functions. Carousel-EDF is an offshoot of NPS-F and preserves its utilization bounds, which are the highest among algorithms not based on a single dispatching queue and that have few preemptions. Furthermore, with respect to NPS-F, Carousel-EDF reduces by up to 50% the number of context switches and of preemptions caused by the high-level scheduler itself. The schedulability analysis we present in this paper is grounded on a prototype implementation of Carousel-EDF that uses a new implementation technique for the release of periodic tasks. This technique reduces the pessimism of the schedulability analysis presented and can be applied, with similar benefits, to other scheduling algorithms such as NPS-F.
- 1 August 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 12-21
The Carousel-EDF scheduling algorithm for multiprocessor systems
We present Carousel-EDF, a new hierarchical scheduling algorithm for a system of identical processors, and its overhead-aware schedulability analysis based on demand bound functions. Carousel-EDF is an offshoot of NPS-F and preserves its utilization bounds, which are the highest among algorithms not based on a single dispatching queue and that have few preemptions. Furthermore, with respect to NPS-F, Carousel-EDF reduces by up to 50% the number of context switches and of preemptions caused by the high-level scheduler itself. The schedulability analysis we present in this paper is grounded on a prototype implementation of Carousel-EDF that uses a new implementation technique for the release of periodic tasks. This technique reduces the pessimism of the schedulability analysis presented and can be applied, with similar benefits, to other scheduling algorithms such as NPS-F.
- Open Access
- 1 November 2012
- Published by Association for Computing Machinery (ACM) in ACM SIGBED Review
- Vol. 9 (4) , 45-48
Enhancing the real-time capabilities of the Linux kernel
The mainline Linux Kernel is not designed for hard real-time systems; it only fits the requirements of soft real-time systems. In recent years, a kernel developer community has been working on the PREEMPT-RT patch. This patch (that aims to get a fully preemptible kernel) adds some real-time capabilities to the Linux kernel. However, in terms of scheduling policies, the real-time scheduling class of Linux is limited to the First-In-First-Out (SCHED_FIFO) and Round-Robin (SCHED_RR) scheduling policies. These scheduling policies are however quite limited in terms of real-time performance. Therefore, in this paper, we report one important contribution for adding more advanced real-time capabilities to the Linux Kernel. Specifically, we describe modifications to the (PREEMPT-RT patched) Linux kernel to support real-time slot-based task-splitting scheduling algorithms. Our preliminary evaluation shows that our implementation exhibits a real-time performance that is superior to the scheduling policies provided by the current version of PREMPT-RT. This is a significant add-on to a widely adopted operating system.
- 1 November 2012
- Published by Association for Computing Machinery (ACM) in ACM SIGBED Review
- Vol. 9 (4) , 45-48
Open AccessEnhancing the real-time capabilities of the Linux kernel
The mainline Linux Kernel is not designed for hard real-time systems; it only fits the requirements of soft real-time systems. In recent years, a kernel developer community has been working on the PREEMPT-RT patch. This patch (that aims to get a fully preemptible kernel) adds some real-time capabilities to the Linux kernel. However, in terms of scheduling policies, the real-time scheduling class of Linux is limited to the First-In-First-Out (SCHED_FIFO) and Round-Robin (SCHED_RR) scheduling policies. These scheduling policies are however quite limited in terms of real-time performance. Therefore, in this paper, we report one important contribution for adding more advanced real-time capabilities to the Linux Kernel. Specifically, we describe modifications to the (PREEMPT-RT patched) Linux kernel to support real-time slot-based task-splitting scheduling algorithms. Our preliminary evaluation shows that our implementation exhibits a real-time performance that is superior to the scheduling policies provided by the current version of PREMPT-RT. This is a significant add-on to a widely adopted operating system.
- 1 August 2011
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1, 224-230
Practical Aspects of Slot-Based Task-Splitting Dispatching in Its Schedulability Analysis
Consider the problem of scheduling a set of sporadic tasks on a multiprocessor system to meet deadlines using a task splitting scheduling algorithm. Task-splitting (also called semi partitioning) scheduling algorithms assign most tasks to just one processor but a few tasks are assigned to two or more processors, and they are dispatched in a way that ensures that a task never executes on two or more processors simultaneously. A certain type of task-splitting algorithms, called slot-based task-splitting, is of particular interest because of its ability to schedule tasks at high processor utilizations. We present a new schedulability analysis for slot-based task-splitting scheduling algorithms that takes the overhead into account and also a new task assignment algorithm.
- 1 August 2011
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1, 224-230
Practical Aspects of Slot-Based Task-Splitting Dispatching in Its Schedulability Analysis
Consider the problem of scheduling a set of sporadic tasks on a multiprocessor system to meet deadlines using a task splitting scheduling algorithm. Task-splitting (also called semi partitioning) scheduling algorithms assign most tasks to just one processor but a few tasks are assigned to two or more processors, and they are dispatched in a way that ensures that a task never executes on two or more processors simultaneously. A certain type of task-splitting algorithms, called slot-based task-splitting, is of particular interest because of its ability to schedule tasks at high processor utilizations. We present a new schedulability analysis for slot-based task-splitting scheduling algorithms that takes the overhead into account and also a new task assignment algorithm.
- 1 June 2011
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 256-265
Implementing slot-based task-splitting multiprocessor scheduling
Consider the problem of scheduling a set of sporadic tasks on a multiprocessor system to meet deadlines using a task-splitting scheduling algorithm. Task-splitting (also called semi-partitioning) scheduling algorithms assign most tasks to just one processor but a few tasks are assigned to two or more processors, and they are dispatched in a way that ensures that a task never executes on two or more processors simultaneously. A particular type of task-splitting algorithms, called slot-based task-splitting dispatching, is of particular interest because of its ability to schedule tasks with high processor utilizations. Unfortunately, no slot-based task-splitting algorithm has been implemented in a real operating system so far. In this paper we discuss and propose some modifications to the slot-based task-splitting algorithm driven by implementation concerns, and we report the first implementation of this family of algorithms in a real operating system running Linux kernel version 2.6.34. We have also conducted an extensive range of experiments on a 4-core multicore desktop PC running task-sets with utilizations of up to 88%. The results show that the behavior of our implementation is in line with the theoretical framework behind it.
- 1 June 2011
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 256-265
Implementing slot-based task-splitting multiprocessor scheduling
Consider the problem of scheduling a set of sporadic tasks on a multiprocessor system to meet deadlines using a task-splitting scheduling algorithm. Task-splitting (also called semi-partitioning) scheduling algorithms assign most tasks to just one processor but a few tasks are assigned to two or more processors, and they are dispatched in a way that ensures that a task never executes on two or more processors simultaneously. A particular type of task-splitting algorithms, called slot-based task-splitting dispatching, is of particular interest because of its ability to schedule tasks with high processor utilizations. Unfortunately, no slot-based task-splitting algorithm has been implemented in a real operating system so far. In this paper we discuss and propose some modifications to the slot-based task-splitting algorithm driven by implementation concerns, and we report the first implementation of this family of algorithms in a real operating system running Linux kernel version 2.6.34. We have also conducted an extensive range of experiments on a 4-core multicore desktop PC running task-sets with utilizations of up to 88%. The results show that the behavior of our implementation is in line with the theoretical framework behind it.
- Open Access
- 7 March 2010
- Published by Springer Nature in EURASIP Journal on Wireless Communications and Networking
- Vol. 2010 (1) , 845792
Hybrid Wired/Wireless PROFIBUS Architectures: Performance Study Based on Simulation Models
- 7 March 2010
- Published by Springer Nature in EURASIP Journal on Wireless Communications and Networking
- Vol. 2010 (1) , 845792
Open AccessHybrid Wired/Wireless PROFIBUS Architectures: Performance Study Based on Simulation Models
- 1 January 2007
- Published by Elsevier in IFAC Proceedings Volumes
- Vol. 40 (22) , 175-182
Hybrid Wired/Wireless PROFIBUS Architectures: Comparative Performance Analysis in an Error-Prone Environment
- 1 January 2007
- Published by Elsevier in IFAC Proceedings Volumes
- Vol. 40 (22) , 175-182
Hybrid Wired/Wireless PROFIBUS Architectures: Comparative Performance Analysis in an Error-Prone Environment