José Luis Briz

José Luis Briz

Auto-generated profile, based on publicly available information

José Luis Briz

Departamento de Informtica e Ingeniera de sistemas, Universidad de Zaragoza, Zaragoza, Spain

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 2012 in Journal of Structural Geology
Verified
Journal Article
Closed access
MRM.J. Ramón
M.J. Ramón
Emilio L PueyoEmilio L Pueyo
Emilio L Pueyo
JBJosé Luis Briz
José Luis Briz
APAndrés Pocoví
Andrés Pocoví
JCJosé Carlos Ciria
José Carlos Ciria

16 November 2015 in ACM Transactions on Architecture and Code Optimization
Verified
Journal Article
Open access
PDF file
EAEhsan K. Ardestani
Ehsan K. Ardestani
RPRafael Trapani Possignolo
Rafael Trapani Possignolo
JBJose Luis Briz
Jose Luis Briz
JRJose Renau
Jose Renau
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.

21 June 2018 in IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Verified
Journal Article
Closed access
RPRafael Trapani Possignolo
Rafael Trapani Possignolo
EEElnaz Ebrahimi
Elnaz Ebrahimi
EAEhsan Khish Ardestani
Ehsan Khish Ardestani
ASAlamelu Sankaranarayanan
Alamelu Sankaranarayanan
JBJose Luis Briz
Jose Luis Briz
JRJose Renau
Jose Renau
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.

8 August 2024 in IEEE Access
Verified
Journal Article
Open access
ATAlitzel Galilea Torres-Macías
Alitzel Galilea Torres-Macías
JSJuan Segarra
Juan Segarra
JVJosé Luis Briz Velasco
José Luis Briz Velasco
ARAntonio Ramirez-Treviño
Antonio Ramirez-Treviño
HBHéctor Blanco-Alcaine
Héctor Blanco-Alcaine
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.

13 July 1998
Verified
Conference Paper
Open access
PIPablo Ibáñez
Pablo Ibáñez
VYVíctor Viñals Yufera
Víctor Viñals Yufera
JBJosé L. Briz
José L. Briz
MGMaría J. Garzarán
María J. Garzarán

2 July 2019 in ACM Transactions on Embedded Computing Systems
Verified
Journal Article
Open access
GDG. Desirena-López
G. Desirena-López
ARA. Ramírez-Treviño
A. Ramírez-Treviño
JBJ. L. Briz
J. L. Briz
CVC. R. Vázquez
C. R. Vázquez
DGD. Gómez-Gutiérrez
D. Gómez-Gutiérrez
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.