José Luis Briz
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
José Luis Briz has a total of 37 co-authors. Here are the top co-authors by number of shared publications:
- Laura Elena Rubio Anguiano
CINVESTAV-IPN Unidad Guadalajara, Zapopan, México
4 shared publications - Alitzel Galilea Torres Macías
Grupo de Investigación en Arquitectura de Computadores (gaZ)
3 shared publications Jose Renau
University of California at Santa Cruz, Santa Cruz, CA, 95064 USA
3 shared publications- Juan Segarra
Universitat Jaume I
3 shared publications - Pablo Ibáñez
Universidad de Zaragoza Zaragoza Spain
3 shared publications - Víctor Viñals
University of Zaragoza
3 shared publications
Latest Publications
- Open Access
- 17 July 2026
- Published by Universidad de Zaragoza in Jornada de Jóvenes Investigadores del I3A
- Vol. 14
Evaluación de planificaciones en TSN ante variaciones de TE
Se estudian los efectos del error de tiempo (TE) sobre planificaciones en Redes Sensibles al Tiempo (TSN). Se analiza la influencia del signo y la magnitud del TE en las ventanas de transmisión, extendiendo el modelo de reloj afín hacia fluctuaciones estocásticas no lineales que el protocolo gPTP no elimina.
- 17 July 2026
- Published by Universidad de Zaragoza in Jornada de Jóvenes Investigadores del I3A
- Vol. 14
Open AccessEvaluación de planificaciones en TSN ante variaciones de TE
Se estudian los efectos del error de tiempo (TE) sobre planificaciones en Redes Sensibles al Tiempo (TSN). Se analiza la influencia del signo y la magnitud del TE en las ventanas de transmisión, extendiendo el modelo de reloj afín hacia fluctuaciones estocásticas no lineales que el protocolo gPTP no elimina.
- Open Access
- 19 May 2026
- Published by Elsevier in Ad Hoc Networks
- Vol. 191
Optimal Fast IEEE802.1Qbv Incremental Scheduling
- 19 May 2026
- Published by Elsevier in Ad Hoc Networks
- Vol. 191
Open AccessOptimal Fast IEEE802.1Qbv Incremental Scheduling
- Open Access
- 8 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 111239-111250
Fast IEEE802.1Qbv Gate Scheduling Through Integer Linear Programming
Time-Sensitive Networking (TSN) is an in-development technology that enables predictability over Ethernet or wireless networks. Network interfaces compliant with the IEEE 802.1Qbv standard provide different queues/gates on each bridge egress port. In this way, a global network schedule can be set by defining the opening and closing times (Gate Control List, GCL) for each gate. In this paper, we propose a new method to schedule GCLs by dividing the problem into several subproblems. We use Weighted Fair Queuing (WFQ) to set the ordering of frames, and then generate an Integer Linear Programming (ILP) model to optimize the TSN scenario. Next, we assign gates to the scheduled windows, trying to ensure frame isolation whenever possible. Our results show that we can schedule GCLs around 2 times faster than previous studies and up to 5.5 orders of magnitude faster if we choose to obtain any valid solution instead of the optimal one. In addition, we are able to schedule systems with utilization up to 85%, whereas previous papers reach 65%. Moreover, our approach does not need to predefine the number of windows or gates, as required by other methods.
- 8 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 111239-111250
Open AccessFast IEEE802.1Qbv Gate Scheduling Through Integer Linear Programming
Time-Sensitive Networking (TSN) is an in-development technology that enables predictability over Ethernet or wireless networks. Network interfaces compliant with the IEEE 802.1Qbv standard provide different queues/gates on each bridge egress port. In this way, a global network schedule can be set by defining the opening and closing times (Gate Control List, GCL) for each gate. In this paper, we propose a new method to schedule GCLs by dividing the problem into several subproblems. We use Weighted Fair Queuing (WFQ) to set the ordering of frames, and then generate an Integer Linear Programming (ILP) model to optimize the TSN scenario. Next, we assign gates to the scheduled windows, trying to ensure frame isolation whenever possible. Our results show that we can schedule GCLs around 2 times faster than previous studies and up to 5.5 orders of magnitude faster if we choose to obtain any valid solution instead of the optimal one. In addition, we are able to schedule systems with utilization up to 85%, whereas previous papers reach 65%. Moreover, our approach does not need to predefine the number of windows or gates, as required by other methods.
- 27 June 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 7 (3) , 7990-7997
Accounting for Preemption and Migration Costs in the Calculation of Hard Real-Time Cyclic Executives for MPSoCs
This work introduces a methodology to consider preemption and migration overhead in hard real-time cyclic executives on multicore architectures. The approach performs two iterative stages. The first stage takes a cyclic executive, from which the number and timing of all preemptions and migrations for every task is known. Then, it includes this overhead by updating the worst-case execution time (WCET) of the tasks. The second stage calculates a new cyclic executive considering the new WCET of tasks. The stages iterate until the preemption and migration overhead keeps constant.
- 27 June 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 7 (3) , 7990-7997
Accounting for Preemption and Migration Costs in the Calculation of Hard Real-Time Cyclic Executives for MPSoCs
This work introduces a methodology to consider preemption and migration overhead in hard real-time cyclic executives on multicore architectures. The approach performs two iterative stages. The first stage takes a cyclic executive, from which the number and timing of all preemptions and migrations for every task is known. Then, it includes this overhead by updating the worst-case execution time (WCET) of the tasks. The second stage calculates a new cyclic executive considering the new WCET of tasks. The stages iterate until the preemption and migration overhead keeps constant.
- Open Access
- 4 June 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 83309-83328
Maximizing Utilization and Minimizing Migration in Thermal-Aware Energy-Efficient Real-Time Multiprocessor Scheduling
This work proposes CAlECs, a clustered scheduling system for MPSoCs subject to thermal and energy constraints. It calculates off-line a cyclic executive honoring temporal and thermal constraints, for a hard real-time (HRT) task set at minimum frequency to reduce consumed energy, minimizing context switches and migrations. It also provides an on-line controller able to manage system and task parametric variations and soft real-time (SRT) tasks, always meeting the HRT task set constraints and the system thermal bound. CAlECS maximizes CPU utilization to help avoid overprovisioning contributing to a low SWaP factor. Its modular design allows the utilization of different modeling and scheduling approaches, and makes the off-line and on-line components independent from each other to better suit the requirements of a specific system. We experimentally show that the cyclic executive provided by CAlECS for HRT task sets outperforms RUN, a reference off-line algorithm in terms of optimal number of context switches.
- 4 June 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 83309-83328
Open AccessMaximizing Utilization and Minimizing Migration in Thermal-Aware Energy-Efficient Real-Time Multiprocessor Scheduling
This work proposes CAlECs, a clustered scheduling system for MPSoCs subject to thermal and energy constraints. It calculates off-line a cyclic executive honoring temporal and thermal constraints, for a hard real-time (HRT) task set at minimum frequency to reduce consumed energy, minimizing context switches and migrations. It also provides an on-line controller able to manage system and task parametric variations and soft real-time (SRT) tasks, always meeting the HRT task set constraints and the system thermal bound. CAlECS maximizes CPU utilization to help avoid overprovisioning contributing to a low SWaP factor. Its modular design allows the utilization of different modeling and scheduling approaches, and makes the off-line and on-line components independent from each other to better suit the requirements of a specific system. We experimentally show that the cyclic executive provided by CAlECS for HRT task sets outperforms RUN, a reference off-line algorithm in terms of optimal number of context switches.
- 16 July 2019
- Published by Springer Nature in Discrete Event Dynamic Systems
- Vol. 29 (3) , 237-264
Energy-efficient thermal-aware multiprocessor scheduling for real-time tasks using TCPN
- 16 July 2019
- Published by Springer Nature in Discrete Event Dynamic Systems
- Vol. 29 (3) , 237-264
Energy-efficient thermal-aware multiprocessor scheduling for real-time tasks using TCPN
- Open Access
- 2 July 2019
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Embedded Computing Systems
- Vol. 18 (4) , 1-24
Thermal-aware Real-time Scheduling Using Timed Continuous Petri Nets
We present a thermal-aware, hard real-time (HRT) global scheduler for a multiprocessor system designed upon three novel techinques. First, we present a modeling methodology based on Timed Continuous Petri nets (TCPN) that yields a complete state variable model, including job arrivals, CPU usage, power, and thermal behavior. The model is accurate and avoids the calibration stage of RC thermal models. Second, based on this model, a linear programming problem (LPP) determines the existence of a feasible HRT thermal-aware schedule. Last, a sliding-mode controller and an online discretization algorithm implement the global HRT scheduler, which is capable of managing thermal constraints, context switching, migrations, and disturbances.
- 2 July 2019
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Embedded Computing Systems
- Vol. 18 (4) , 1-24
Open AccessThermal-aware Real-time Scheduling Using Timed Continuous Petri Nets
We present a thermal-aware, hard real-time (HRT) global scheduler for a multiprocessor system designed upon three novel techinques. First, we present a modeling methodology based on Timed Continuous Petri nets (TCPN) that yields a complete state variable model, including job arrivals, CPU usage, power, and thermal behavior. The model is accurate and avoids the calibration stage of RC thermal models. Second, based on this model, a linear programming problem (LPP) determines the existence of a feasible HRT thermal-aware schedule. Last, a sliding-mode controller and an online discretization algorithm implement the global HRT scheduler, which is capable of managing thermal constraints, context switching, migrations, and disturbances.
- 29 June 2019
- Published by Instituto Politecnico Nacional/Centro de Investigacion en Computacion in Computación y Sistemas
- Vol. 23 (2) , 417-434-433
A Flexible Framework for Real-Time Thermal-Aware Schedulers using Timed Continuous Petri Nets
A Flexible Framework for Real-Time Thermal-Aware Schedulers using Timed Continuous Petri Nets
- 29 June 2019
- Published by Instituto Politecnico Nacional/Centro de Investigacion en Computacion in Computación y Sistemas
- Vol. 23 (2) , 417-434-433
A Flexible Framework for Real-Time Thermal-Aware Schedulers using Timed Continuous Petri Nets
A Flexible Framework for Real-Time Thermal-Aware Schedulers using Timed Continuous Petri Nets
- 21 June 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Very Large Scale Integration (VLSI) Systems
- Vol. 26 (9) , 1713-1726
GPU NTC Process Variation Compensation With Voltage Stacking
Near-threshold computing (NTC) has the potential to significantly improve efficiency in high throughput architectures, such as general-purpose computing on graphic processing unit (GPGPU). Nevertheless, NTC is more sensitive to process variation (PV) as it complicates power delivery. We propose GPU stacking, a novel method based on voltage stacking, to manage the effects of PV and improve the power delivery simultaneously. To evaluate our methodology, we first explore the design space of GPGPUs in the NTC to find a suitable baseline configuration and then apply GPU stacking to mitigate the effects of PV. When comparing with an equivalent NTC GPGPU without PV management, we achieve 37% more performance on average. When considering high production volume, our approach shifts all the chips closer to the nominal non-PV case, delivering on average (across chips) ≈80% of the performance of nominal NTC GPGPU, whereas when not using our technique, chips would have ≈50% of the nominal performance. We also show that our approach can be applied on top of multifrequency domain designs, improving the overall performance.
- 21 June 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Very Large Scale Integration (VLSI) Systems
- Vol. 26 (9) , 1713-1726
GPU NTC Process Variation Compensation With Voltage Stacking
Near-threshold computing (NTC) has the potential to significantly improve efficiency in high throughput architectures, such as general-purpose computing on graphic processing unit (GPGPU). Nevertheless, NTC is more sensitive to process variation (PV) as it complicates power delivery. We propose GPU stacking, a novel method based on voltage stacking, to manage the effects of PV and improve the power delivery simultaneously. To evaluate our methodology, we first explore the design space of GPGPUs in the NTC to find a suitable baseline configuration and then apply GPU stacking to mitigate the effects of PV. When comparing with an equivalent NTC GPGPU without PV management, we achieve 37% more performance on average. When considering high production volume, our approach shifts all the chips closer to the nominal non-PV case, delivering on average (across chips) ≈80% of the performance of nominal NTC GPGPU, whereas when not using our technique, chips would have ≈50% of the nominal performance. We also show that our approach can be applied on top of multifrequency domain designs, improving the overall performance.
- Open Access
- 16 November 2015
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Architecture and Code Optimization
- Vol. 12 (4) , 1-26
Managing Mismatches in Voltage Stacking with CoreUnfolding
Five percent to 25% of power could be wasted before it is delivered to the computational resources on a die, due to inefficiencies of voltage regulators and resistive loss. The power delivery could benefit if, at the same power, the delivered voltage increases and the current decreases. This article presents CoreUnfolding , a technique that leverages voltage Stacking to improve power delivery efficiency. Our experiments show that about 10% system-wide power can be saved, the voltage regulator area can be reduced by 30%, di / dt improves 49%, and the power pin count is reduced by 40% (≈ 20% reduction in packaging costs), with negligible performance degradation.
- 16 November 2015
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Architecture and Code Optimization
- Vol. 12 (4) , 1-26
Open AccessManaging Mismatches in Voltage Stacking with CoreUnfolding
Five percent to 25% of power could be wasted before it is delivered to the computational resources on a die, due to inefficiencies of voltage regulators and resistive loss. The power delivery could benefit if, at the same power, the delivered voltage increases and the current decreases. This article presents CoreUnfolding , a technique that leverages voltage Stacking to improve power delivery efficiency. Our experiments show that about 10% system-wide power can be saved, the voltage regulator area can be reduced by 30%, di / dt improves 49%, and the power pin count is reduced by 40% (≈ 20% reduction in packaging costs), with negligible performance degradation.