Skip to main content

Resultados relacionados

Resultados totales (Incluyendo duplicados): 32
Encontrada(s) 1 página(s)

RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Capítulo o parte de un libro (BookPart)

Aprendizaje autónomo del estudiante apoyado en recursos audiovisuales en el contexto de un Grado de Ingeniería Informática: experiencias con metodologías de enseñanza activas

  • Vallejo, Enrique
  • Fuentes, Pablo
  • Benito, Mariano
[EN] The course Introduction to Computer Networks from the University of Cantabria has a low success, with complaints about the lack of sufficient practical classes that reinforce the theoretical contents. An innovation project has been developed to develop a set of multimedia materials that replace some master classes and increase the amount of practical sessions, following a flipped classroom model. Specifically, six videos have been developed, each of them accompanied by a self-learning activity, and an associated practical session. Such sessions followed approximately a Problem-Based Learning approach. The impact of the project has been evaluated, on the motivation, withdrawal and academic results. The response of the students is positive, with a slightly increase in the classroom attendance. Students indicate that they prefer this type of learning. However, monitoring tools show that activity attendance is significantly lower than expected. Academic results show a rate of student withdrawal similar to previous years, but a slightly higher rate of students passing the course. Overall, the results of the project is very positive, given the increased student motivation, and a similar approach will be considered in forthcoming courses., [ES] La asignatura Introducción a las Redes de Computadores de la Universidad de Cantabria presenta un rendimiento bajo, con queja de la falta de clases prácticas que refuercen los contenidos teóricos. Para atacar el problema, se ha desarrollado un conjunto de materiales audiovisuales que reemplacen algunas de las clases teóricas y aumenten la cantidad de sesiones prácticas en el aula siguiendo un modelo de flipped classroom. En concreto, se han desarrollado seis vídeos para el auto-aprendizaje por parte del alumno, acompañados de tests de autoevaluación y de seis sesiones prácticas en el aula. En dichas sesiones, se ha seguido aproximadamente una metodología de aprendizaje basado en problemas. Se ha evaluado el impacto del proyecto sobre la motivación, seguimiento y resultados del alumnado. La respuesta del alumnado al cambio metodológico es positivo, aumentándose ligeramente la asistencia a clase y seguimiento de la asignatura. Sin embargo, el seguimiento de los recursos es mucho más bajo de lo esperado. Los resultados académicos muestran una tasa de alumnos presentados similar a la de cursos previos, pero una tasa de aprobados ligeramente superior. Globalmente, el resultado del proyecto es muy positivo, y plantea seguirse un esquema similar en cursos posteriores., Este proyecto está apoyado por la III Convocatoria de Proyectos de Innovación Docente del Vicerrectorado de Profesorado de la Universidad de Cantabria y por el Ministerio de Economía, Industria y Competitividad bajo el contrato TIN2016-76635-C2-2-R (AEI/FEDER, UE). Pablo Fuentes está financiado por el Ministerio de Educación, Cultura y Deporte, beca FPU13/00337.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Efficient Management of Cache Accesses to Boost GPGPU Memory Subsystem Performance

  • Candel-Margaix, Francisco
  • Valero Bresó, Alejandro
  • Petit Martí, Salvador Vicente|||0000-0003-2426-4134
  • Sahuquillo Borrás, Julio|||0000-0001-8630-4846
[EN] To support the massive amount of memory accesses that GPGPU applications generate, GPU memory hierarchies are becoming more and more complex, and the Last Level Cache (LLC) size considerably increases each GPU generation. This paper shows that counter-intuitively, enlarging the LLC brings marginal performance gains in most applications. In other words, increasing the LLC size does not scale neither in performance nor energy consumption. We examine how LLC misses are managed in typical GPUs, and we find that in most cases the way LLC misses are managed are precisely the main performance limiter. This paper proposes a novel approach that addresses this shortcoming by leveraging a tiny additional Fetch and Replacement Cache-like structure (FRC) that stores control and coherence information of the incoming blocks until they are fetched from main memory. Then, the fetched blocks are swapped with the victim blocks (i.e., selected to be replaced) in the LLC, and the eviction of such victim blocks is performed from the FRC. This approach improves performance due to three main reasons: i) the lifetime of blocks being replaced is enlarged, ii) the main memory path is unclogged on long bursts of LLC misses, and iii) the average LLC miss latency is reduced. The proposal improves the LLC hit ratio, memory-level parallelism, and reduces the miss latency compared to much larger conventional caches. Moreover, this is achieved with reduced energy consumption and with much less area requirements. Experimental results show that the proposed FRC cache scales in performance with the number of GPU compute units and the LLC size, since, depending on the FRC size, performance improves ranging from 30 to 67 percent for a modern baseline GPU card, and from 32 to 118 percent for a larger GPU. In addition, energy consumption is reduced on average from 49 to 57 percent for the larger GPU. These benefits come with a small area increase (by 7.3 percent) over the LLC baseline., This work has been supported by the Spanish Ministerio de Ciencia, Innovacion y Universidades and the European ERDF under Grants T-PARCCA (RTI2018-098156-B-C51), and TIN2016-76635-C2-1-R (AEI/ERDF, EU), by the Universitat Politecnica de Valencia under Grant SP20190169, and by the gaZ: T58_17R research group (Aragon Gov. and European ESF).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

An Aging-Aware GPU Register File Design Based on Data Redundancy

  • Valero Bresó, Alejandro
  • Candel-Margaix, Francisco
  • Suárez-Gracia, Darío
  • Petit Martí, Salvador Vicente|||0000-0003-2426-4134
  • Sahuquillo Borrás, Julio|||0000-0001-8630-4846
[EN] Nowadays, GPUs sit at the forefront of high-performance computing thanks to their massive computational capabilities. Internally, thousands of functional units, architected to be fed by large register files, fuel such a performance. At deep nanometer technologies, the SRAM memory cells that implement GPU register files are very sensitive to the Negative Bias Temperature Instability (NBTI) effect. NBTI ages cell transistors by degrading their threshold voltage Vth over the lifetime of the GPU. This degradation, which manifests when a cell keeps the same logic value for a relatively long period of time, compromises the cell read stability and increases the transistor switching delay, which can lead to wrong read values and eventually exceed the processor cycle time, respectively, so resulting in faulty operation. Thiswork proposes architectural mechanisms leveraging the redundancy of the data stored in GPU register files to attack NBTI aging. The proposed mechanisms are based on data compression, power gating, and register address rotation techniques. All these mechanismsworking together balance the distribution of logic values stored in the cells along the execution time, reducing both the overall Vth degradation and the increase in the transistor switching delays. Experimental results show that a conventional GPU register file suffers the worst case for NBTI, since a significant fraction of the cells maintain the same logic value during the entire application execution (i.e., a 100 percent '0' and '1' duty cycle distributions). On average, the proposal reduces these distributions by 58 and 68 percent, respectively, which translates into Vth degradation savings by 54 and 62 percent, respectively., This work was supported by the Gobierno de Aragon and the European ESF (gaZ: T58_17R research group), and by the Ministerio de Economia y Competitividad (MINECO) and AEI/FEDER (EU) funds under Grants TIN2016-76635-C2-1-R and TIN2015-66972-C5-1-R.
RUA. Repositorio Institucional de la Universidad de Alicante
Publication Otros (Other)

Tecnología low-cost para motivar al alumno

  • Fuentes, Pablo
  • Camarero, Cristóbal
  • Martínez, Carmen
  • Vallejo, Fernando
La docencia en Estructura y Organización de Computadores se imparte habitualmente utilizando una arquitectura como referencia, siendo MIPS una de las más usadas. Sin embargo, su baja penetración en el mercado actual tiene un efecto desmotivador en los alumnos. Esto, junto con la mayor relevancia de la arquitectura ARM, nos ha hecho plantearnos considerarla como referencia en nuestros planes de estudios. Con este objetivo, se ha desarrollado un proyecto de innovación docente para rediseñar las materias implicadas. Esta modificación ha implicado cambios en el laboratorio en el que se desarrollan las prácticas, para el que se ha seleccionado Raspberry Pi, una plataforma de bajo coste basada en ARM. Como principal diferencia respecto a otras soluciones, se ha elegido el sistema operativo RISC OS, que permite realizas prácticas de programación en ensamblador y Entrada/Salida en el mismo entorno. Además, se ha desarrollado un depurador en ARM llamado !UCDebug. En este artículo se describen las diferentes etapas del proyecto y los resultados obtenidos. Cabe destacar que, en los dos cursos que lleva implantado, la motivación y asistencia de los alumnos ha aumentado considerablemente y la tasa de éxito ha subido hasta un 13%.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

GPU NTC Process Variation Compensation with Voltage Stacking

  • Trapani Possignolo, Rafael
  • Ebrahimi, Elnaz
  • Ardestani, Ehsan
  • Sankaranarayanan, Alamelu
  • Briz Velasco, Jose Luis
  • Renau, Jose
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.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

An aging-aware GPU register file design based on data redundancy

  • Valero Bresó, Alejandro
  • Candel Margaix, Francisco
  • Suárez Gracia, Darío
  • Petit Martí, Salvador Vicente
  • Sahuquillo Borrás, Julio
Nowadays, GPUs sit at the forefront of high-performance computing thanks to their massive computational capabilities. Internally, thousands of functional units, architected to be fed by large register files, fuel such a performance. At deep nanometer technologies, the SRAM memory cells that implement GPU register files are very sensitive to the Negative Bias Temperature Instability (NBTI) effect. NBTI ages cell transistors by degrading their threshold voltage Vth over the lifetime of the GPU. This degradation, which manifests when a cell keeps the same logic value for a relatively long period of time, compromises the cell read stability and increases the transistor switching delay, which can lead to wrong read values and eventually exceed the processor cycle time, respectively, so resulting in faulty operation. This work proposes architectural mechanisms leveraging the redundancy of the data stored in GPU register files to attack NBTI aging. The proposed mechanisms are based on data compression, power gating, and register address rotation techniques. All these mechanisms working together balance the distribution of logic values stored in the cells along the execution time, reducing both the overall Vth degradation and the increase in the transistor switching delays. Experimental results show that a conventional GPU register file suffers the worst case for NBTI, since a significant fraction of the cells maintain the same logic value during the entire application execution (i.e., a 100% ‘0’ and ‘1’ duty cycle distributions). On average, the proposal reduces these distributions by 58% and 68%, respectively, which translates into Vth degradation savings by 54% and 62%, respectively.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Energy-Efficient Thermal-Aware Scheduling for RT Tasks Using TCPN

  • Rubio-Anguiano, L.
  • Desirena-López, G.
  • Ramírez-Treviño, A.
  • Briz, J.L.
This work leverages TCPNs to design an energy-efficient, thermal-aware real-time scheduler for a multiprocessor system that normally runs in a low state energy at maximum system utilization but its capable of increasing the clock frequency to serve aperiodic tasks, optimizing energy, and honoring temporal and thermal constraints. An off-line stage computes the minimum frequency required to run the periodic tasks at maximum CPU utilization, the proportion of each task''s job to be run on each CPU, the maximum clock frequency that keeps temperature under a limit, and the available cycles (slack) with respect to the system with minimum frequency. Then, a Zero-Laxity online scheduler dispatches the periodic tasks according to the offline calculation. Upon the arrival of aperiodic tasks, it increases clock frequency in such a way that all periodic and aperiodic tasks are properly executed. Thermal and temporal requirements are always guaranteed, and energy consumption is minimized.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Thermal-aware real-time scheduling using timed continuous Petri Nets

  • Desirena-López, G.
  • Ramírez-Treviño, A.
  • Briz Velasco, J.L.
  • Vázquez, C.R.
  • Gómez-Gutiérrez, D.
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.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Improving GPU cache hierarchy performance with a fetch and replacement cache

  • Candel, Francisco
  • Petit, Salvador
  • Valero, Alejandro
  • Sahuquillo, Julio
In the last few years, GPGPU computing has become one of the most popular computing paradigms in high-performance computers due to its excellent performance to power ratio. The memory requirements of GPGPU applications widely differ from the requirements of CPU counterparts. The amount of memory accesses is several orders of magnitude higher in GPU applications than in CPU applications, and they present disparate access patterns. Because of this fact, large and highly associative Last-Level Caches (LLCs) bring much lower performance gains in GPUs than in CPUs. This paper presents a novel approach to manage LLC misses that efficiently improves LLC hit ratio, memory-level parallelism, and miss latencies in GPU systems. The proposed approach leverages a small additional Fetch and Replacement Cache (FRC) that stores control and coherence information of incoming blocks until they are fetched from main memory. Then, fetched blocks are swapped with victim blocks to be replaced in the LLC. After that, the eviction of victim blocks is performed from the FRC. This management approach improves performance due to three main reasons: (i) the lifetime of blocks being replaced is increased, (ii) the main memory path is unclogged on long bursts of LLC misses, and (iii) the average L2 miss delaying latency is reduced. Experimental results show that our proposal increases the performance (OPC) over 25% in most of the studied applications, reaching improvements up to 150% in some applications.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

A fault-tolerant last level cache for CMPs operating at ultra-low voltage

  • Ferrerón, A.
  • Alastruey-Benedé, J.
  • Suárez Gracia, D.
  • Monreal Arnal, T.
  • Ibáñez Marín, P.
  • Viñals Yúfera, V.
Voltage scaling to values near the threshold voltage is a promising technique to hold off the many-core power wall. However, as voltage decreases, some SRAM cells are unable to operate reliably and show a behavior consistent with a hard fault. Block disabling is a micro-architectural technique that allows low-voltage operation by deactivating faulty cache entries, at the expense of reducing the effective cache capacity. In the case of the last-level cache, this capacity reduction leads to an increase in off-chip memory accesses, diminishing the overall energy benefit of reducing the voltage supply. In this work, we exploit the reuse locality and the intrinsic redundancy of multi-level inclusive hierarchies to enhance the performance of block disabling with negligible cost. The proposed fault-aware last-level cache management policy maps critical blocks, those not present in private caches and with a higher probability of being reused, to active cache entries. Our evaluation shows that this fault-aware management results in up to 37.3% and 54.2% fewer misses per kilo instruction (MPKI) than block disabling for multiprogrammed and parallel workloads, respectively. This translates to performance enhancements of up to 13% and 34.6% for multiprogrammed and parallel workloads, respectively.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Memory hierarchy characterization of SPEC CPU2006 and SPEC CPU2017 on the Intel Xeon Skylake-SP

  • Navarro-Torres, Agustín
  • Alastruey-Benedé, Jesús
  • Ibáñez-Marín, Pablo
  • Viñals-Yúfera, Víctor
SPEC CPU is one of the most common benchmark suites used in computer architecture research. CPU2017 has recently been released to replace CPU2006. In this paper we present a detailed evaluation of the memory hierarchy performance for both the CPU2006 and single-threaded CPU2017 benchmarks. The experiments were executed on an Intel Xeon Skylake-SP, which is the first Intel processor to implement a mostly non-inclusive last-level cache (LLC). We present a classification of the benchmarks according to their memory pressure and analyze the performance impact of different LLC sizes. We also test all the hardware prefetchers showing they improve performance in most of the benchmarks. After comprehensive experimentation, we can highlight the following conclusions: i) almost half of SPEC CPU benchmarks have very low miss ratios in the second and third level caches, even with small LLC sizes and without hardware prefetching, ii) overall, the SPEC CPU2017 benchmarks demand even less memory hierarchy resources than the SPEC CPU2006 ones, iii) hardware prefetching is very effective in reducing LLC misses for most benchmarks, even with the smallest LLC size, and iv) from the memory hierarchy standpoint the methodologies commonly used to select benchmarks or simulation points do not guarantee representative workloads.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

ReD: A reuse detector for content selection in exclusive shared last-level caches

  • Díaz, J.
  • Monreal, T.
  • Ibáñez, P.
  • Llabería, J.M.
  • Viñals, V.
The reference stream reaching a chip multiprocessor Shared Last-Level Cache (SLLC) shows poor temporal locality, making conventional cache management policies inefficient. Few proposals address this problem for exclusive caches. In this paper, we propose the Reuse Detector (ReD), a new content selection mechanism for exclusive hierarchies that leverages reuse locality at the SLLC, a property that states that blocks referenced more than once are more likely to be accessed in the near future. Being placed between each L2 private cache and the SLLC, ReD prevents the insertion of blocks without reuse into the SLLC. It is designed to overcome problems affecting similar recent mechanisms (low accuracy, reduced visibility window and detector thrashing). ReD improves performance over other state-of-the-art proposals (CHAR, Reuse Cache and EAF cache). Compared with the baseline system with no content selection, it reduces the SLLC miss rate (MPI) by 10.1% and increases harmonic IPC by 9.5%.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Cooperative CPU, GPU, and FPGA heterogeneous execution with EngineCL

  • Dávila Guzmán, M.A.
  • Nozal, R.
  • Gran Tejero, R.
  • Villarroya-Gaudó, M.
  • Suárez Gracia, D.
  • Bosque, J.L.
Heterogeneous systems are the core architecture of most of the high-performance computing nodes, due to their excellent performance and energy efficiency. However, a key challenge that remains is programmability, specifically, releasing the programmer from the burden of managing data and devices with different architectures. To this end, we extend EngineCL to support FPGA devices. Based on OpenCL, EngineCL is a high-level framework providing load balancing among devices. Our proposal fully integrates FPGAs into the framework, enabling effective cooperation between CPU, GPU, and FPGA. With command overlapping and judicious data management, our work improves performance by up to 96% compared with single-device execution and delivers energy-delay gains of up to 37%. In addition, adopting FPGAs does not require programmers to make big changes in their applications because the extensions do not modify the user-facing interface of EngineCL.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Inference in supervised spectral classifiers for on-board hyperspectral imaging: An overview

  • Alcolea, Adrián
  • Paoletti, Mercedes E.
  • Haut, Juan M.
  • Resano, Javier
  • Plaza, Antonio
Machine learning techniques are widely used for pixel-wise classification of hyperspectral images. These methods can achieve high accuracy, but most of them are computationally intensive models. This poses a problem for their implementation in low-power and embedded systems intended for on-board processing, in which energy consumption and model size are as important as accuracy. With a focus on embedded anci on-board systems (in which only the inference step is performed after an off-line training process), in this paper we provide a comprehensive overview of the inference properties of the most relevant techniques for hyperspectral image classification. For this purpose, we compare the size of the trained models and the operations required during the inference step (which are directly related to the hardware and energy requirements). Our goal is to search for appropriate trade-offs between on-board implementation (such as model size anci energy consumption) anci classification accuracy.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Exploring heterogeneous scheduling for edge computing with CPU and FPGA MPSoCs

  • Rodríguez, Andrés
  • Navarro, Ángeles
  • Asenjo, Rafael
  • Corbera, Francisco
  • Gran, Rubén
  • Suárez, Darío
  • Nunez-Yanez, José
This paper presents a framework targeted to low-cost and low-power heterogeneous MultiProcessors that exploits FPGAs and multicore CPUs, with the overarching goal of providing developers with a productive programming model and runtime support to fully use all the processing resources available. FPGA productivity is achieved using a high-level programming model based on OpenCL, the standard for cross-platform parallel heterogeneous programming. In this work, we focus on the parallel for pattern, and as part of the runtime support for this pattern, we leverage a new scheduler that strives to maximize the number of iterations per joule by dynamically and adaptively partitioning the iteration space between the multicore and the accelerator when working simultaneously. A total of 7 benchmarks are ported and optimized for a low-cost DE1 board. The results show that the heterogeneous solution can improve performance up to 2.9x and increases energy efficiency up to 2.7x compared tothe traditional approach of keeping all the CPU cores idle while the accelerator computes the workload. Our results also demonstrate two interesting insights: First, an adaptive scheduler able to find at runtime the right chunk size for each type of application and device configuration is an essential component for these kinds of heterogeneous platforms, and second, device configurations that provide higher throughput do not always achieve better energy eciency when only the running power (excluding the idle power component) is considered.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Reducing the WCET and analysis time of systems with simple lockable instruction caches

  • Pedro-Zapater, Alba
  • Segarra, Juan
  • Gran Tejero, Rubén
  • Viñals, Víctor
  • Rodríguez, Clemente
One of the key challenges in real-time systems is the analysis of the memory hierarchy. Many Worst-Case Execution Time (WCET) analysis methods supporting an instruction cache are based on iterative or convergence algorithms, which are rather slow. Our goal in this paper is to reduce the WCET analysis time on systems with a simple lockable instruction cache, focusing on the Lock-MS method. First, we propose an algorithm to obtain a structure-based representation of the Control Flow Graph (CFG). It organizes the whole WCET problem as nested subproblems, which takes advantage of common branch-and-bound algorithms of Integer Linear Programming (ILP) solvers. Second, we add support for multiple locking points per task, each one with specific cache contents, instead of a given locked content for the whole task execution. Locking points are set heuristically before outer loops. Such simple heuristics adds no complexity, and reduces the WCET by taking profit of the temporal reuse found in loops. Since loops can be processed as isolated regions, the optimal contents to lock into cache for each region can be obtained, and the WCET analysis time is further reduced. With these two improvements, our WCET analysis is around 10 times faster than other approaches. Also, our results show that the WCET is reduced, and the hit ratio achieved for the lockable instruction cache is similar to that of a real execution with an LRU instruction cache. Finally, we analyze the WCET sensitivity to compiler optimization, showing for each benchmark the right choices and pointing out that O0 is always the worst option.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Energy-efficient thermal-aware multiprocessor scheduling for real-time tasks using TCPNs

  • Rubio-Anguiano, Laura
  • Desirena-López, Gaddiel
  • Ramírez-Treviño, Antonio
  • Briz Velasco, José Luis
We present an energy-effcient thermal-aware real-time global scheduler for a set of hard real-time (HRT) tasks running on a multiprocessor system. This global scheduler fulfills the thermal and temporal constraints by handling two independent variables, the task allocation time and the selection of clock frequency. To achieve its goal, the proposed scheduler is split into two stages. An off-line stage, based on a deadline partitioning scheme, computes the cycles that the HRT tasks must run per deadline interval at the minimum clock frequency to save energy while honoring the temporal and thermal constraints, and computes the maximum frequency at which the system can run below the maximum temperature. Then, an on-line, event-driven stage performs global task allocation applying a Fixed-Priority Zero-Laxity policy, reducing the overhead of quantum-based or interval-based global schedulers. The on-line stage embodies an adaptive scheduler that accepts or rejects soft RT aperiodic tasks throttling CPU frequency to the upper lowest available one to minimize power consumption while meeting time and thermal constraints. This approach leverages the best of two worlds: the off-line stage computes an ideal discrete HRT multiprocessor schedule, while the on-line stage manage soft real-time aperiodic tasks with minimum power consumption and maximum CPU utilization.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

DC-Patch: A Microarchitectural Fault Patching Technique for GPU Register Files

  • Valero, A.
  • Suarez-Gracia, D.
  • Gran-Tejero, R.
The ever-increasing parallelism demand of General-Purpose Graphics Processing Unit (GPGPU) applications pushes toward larger and more energy-hungry register files in successive GPU generations. Reducing the supply voltage beyond its safe limit is an effective way to improve the energy efficiency of register files. However, at these operating voltages, the reliability of the circuit is compromised. This work aims to tolerate permanent faults from process variations in large GPU register files operating below the safe supply voltage limit. To do so, this paper proposes a microarchitectural patching technique, DC-Patch, exploiting the inherent data redundancy of applications to compress registers at run-time with neither compiler assistance nor instruction set modifications. Instead of disabling an entire faulty register file entry, DC-Patch leverages the reliable cells within a faulty entry to store compressed register values. Experimental results show that, with more than a third of faulty register entries, DC-Patch ensures a reliable operation of the register file and reduces the energy consumption by 47% with respect to a conventional register file working at nominal supply voltage. The energy savings are 21% compared to a voltage noise smoothing scheme operating at the safe supply voltage limit. These benefits are obtained with less than 2 and 6% impact on the system performance and area, respectively.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Automatic Safe Data Reuse Detection for the WCET Analysis of Systems With Data Caches

  • Segarra, J.
  • Cortadella, J.
  • Gran Tejero, R.
  • Viñals-Yufera, V.
Worst-case execution time (WCET) analysis of systems with data caches is one of the key challenges in real-time systems. Caches exploit the inherent reuse properties of programs, temporarily storing certain memory contents near the processor, in order that further accesses to such contents do not require costly memory transfers. Current worst-case data cache analysis methods focus on specific cache organizations (LRU, locked, ACDC, etc.). In this article, we analyze data reuse (in the worst case) as a property of the program, and thus independent of the data cache. Our analysis method uses Abstract Interpretation on the compiled program to extract, for each static load/store instruction, a linear expression for the address pattern of its data accesses, according to the Loop Nest Data Reuse Theory. Each data access expression is compared to that of prior (dominant) memory instructions to verify whether it presents a guaranteed reuse. Our proposal manages references to scalars, arrays, and non-linear accesses, provides both temporal and spatial reuse information, and does not require the exploration of explicit data access sequences. As a proof of concept we analyze the TACLeBench benchmark suite, showing that most loads/stores present data reuse, and how compiler optimizations affect it. Using a simple hit/miss estimation on our reuse results, the time devoted to data accesses in the worst case is reduced to 27% compared to an always-miss system, equivalent to a data hit ratio of 81%. With compiler optimization, such time is reduced to 6.5%.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

A flexible framework for real-time thermal-aware schedulers using timed continuous petri nets

  • Desirena López, G.
  • Rubio Anguiano, L.E.
  • Ramírez Treviño, A.
  • Briz Velasco, J.L.
This work presents TCPN-ThermalSim, a software tool for testing Real-Time Thermal-Aware Schedulers1. This framework consists of four main modules. The first one helps the user to define the problem: Task set with periods, deadlines and worst case execution times in CPU cycles, along with the CPU characteristics, temperature and energy consumption. The second module is the Kernel simulation, which builds up a global simulation model according to the configuration module. In the third module, the user selects the scheduler algorithm. Finally the last module allows the execution of the simulation and present the results. The framework encompasses two modes: Manual and automatic. In manual mode the simulator uses the task set data provided in the first section. In automatic mode the task set is generated by parameterizing the integrated UUniFast algorithm.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

FPGA accelerator for gradient boosting decision trees

  • Alcolea, A.
  • Resano, J.
A decision tree is a well-known machine learning technique. Recently their popularity has increased due to the powerful Gradient Boosting ensemble method that allows to gradually increasing accuracy at the cost of executing a large number of decision trees. In this paper we present an accelerator designed to optimize the execution of these trees while reducing the energy consumption. We have implemented it in an FPGA for embedded systems, and we have tested it with a relevant case-study: pixel classification of hyperspectral images. In our experiments with different images our accelerator can process the hyperspectral images at the same speed at which they are generated by the hyperspectral sensors. Compared to a high-performance processor running optimized software, on average our design is twice as fast and consumes 72 times less energy. Compared to an embedded processor, it is 30 times faster and consumes 23 times less energy.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Analysis of a Pipelined Architecture for Sparse DNNs on Embedded Systems

  • Alcolea Moreno, A.
  • Olivito, J.
  • Resano, J.
  • Mecha, H.
Deep neural networks (DNNs) are increasing their presence in a wide range of applications, and their computationally intensive and memory-demanding nature poses challenges, especially for embedded systems. Pruning techniques turn DNN models into sparse by setting most weights to zero, offering optimization opportunities if specific support is included. We propose a novel pipelined architecture for DNNs that avoids all useless operations during the inference process. It has been implemented in a field-programmable gate array (FPGA), and the performance, energy efficiency, and area have been characterized. Exploiting sparsity yields remarkable speedups but also produces area overheads. We have evaluated this tradeoff in order to identify in which scenarios it is better to use that area to exploit sparsity, or to include more computational resources in a conventional DNN architecture. We have also explored different arithmetic bitwidths. Our sparse architecture is clearly superior on 32-bit arithmetic or highly sparse networks. However, on 8-bit arithmetic or networks with low sparsity it is more profitable to deploy a dense architecture with more arithmetic resources than including support for sparsity. We consider that FPGAs are the natural target for DNN sparse accelerators since they can be loaded at run-time with the best-fitting accelerator.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Gender gap in STEM: a cross-sectional study of primary school students’ self-perception and test anxiety in mathematics

  • Ayuso, N.
  • Fillola, E.
  • Masiá, B.
  • Murillo, A.C.
  • Trillo, R.
  • Baldassarri, S.
  • Cerezo, E.
  • Ruberte, L.
  • Mariscal, M.D.
  • Villarroya, M.
Contribution: Significant gender differences are observed on primary school students’ perception of self-efficacy and test anxiety in mathematics. Girls perceive themselves to be significantly worse than boys in mathematics and report higher test anxiety toward mathematics exams. Gender differences in self-efficacy become more pronounced as students grow up, and test anxiety increases for all students. However, the present study shows that teachers’ do not perceive differences in self-efficacy in mathematics between boys and girls. Background: The low presence of women in science, technology, engineering, and mathematics (STEM) might be explained by the attitude of young students toward mathematics. Different studies show that girls are less interested in STEM areas than boys during secondary school. A study on the reasons for this fact pointed out that the early years of education can provide a relevant insight to reverse the situation. Research Questions: Is there any age-dependent gender difference in primary school students in aspects related to mathematics? Are teachers aware of students’ perceptions? Methodology: This work presents a study of over 2000 primary school students (6–12 years old) and 200 teachers in Aragón (Spain). The study consists of a survey on aspects that influence the experience of female and male students with mathematics and Spanish language for comparison purposes and teacher’s awareness of students’ perception. Findings: The present study shows that during primary school, girls are more likely to experiment a negative attitude toward mathematics than boys as they grow up, and teachers may not perceive girls’ situation. La baja presencia de mujeres en ciencia, tecnología, la ingeniería y las matemáticas (STEM) podrían explicarse por la actitud de las niños y niñas hacia las matemáticas. Diferentes estudios muestran que las niñas están menos interesadas en las áreas STEM que niños cuando cursan educación secundaria. Además, un estudio sobre los motivos para este hecho señaló que los primeros años de educación podrían proporcionar una visión relevante para revertir la situación. Por ello, este trabajo parte de las siguientes preguntas de investigación, ¿Existe alguna diferencia de género que sea dependiente de la edad en estudiantes de educación primaria en aspectos relacionados con las matemáticas? ¿Conoce el profesorado la autopercepción de sus estudiantes? Las principales contribuciones de este trabajo son que las diferencias significativas de género se observan en la percepción de autoeficacia de los estudiantes de primaria y ansiedad ante los exámenes en matemáticas. Las niñas se perciben a sí mismas significativamente peor que los niños en matemáticas e indican mayor ansiedad ante los exámenes de matemáticas. Las diferencias de género en la autoeficacia se vuelven más pronunciada a medida que los estudiantes crecen, mientras que la ansiedad ante los exámenes aumenta para todos los estudiantes. Pese a estos resultados, el presente estudio muestra que los profesores no perciben diferencias en la autoeficacia en matemáticas entre niños y niñas. Este estudio se basa en las encuestas realizadas a más de 2000 escolares (6-12 años) y 200 profesores en Aragón (España). El estudio consiste en una encuesta a los estudiantes sobre aspectos que pueden influir en la experiencia de los niños y niñas con las matemáticas, así como con la lengua española para disponer de una materia que permita establecer comparaciones y una encuesta al profesor que incluye cuestiones sobre su percepción de los estudiantes. El principal hallazgo del estudio es que, durante la escuela primaria, es más probable que las niñas experimenten una actitud negativa hacia matemáticas que los niños a medida que crecen, y que los maestros pueden no ser conscientes de la situación de las niñas.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Developing an AI IoT application with open software on a RISC-V SoC

  • Torres-Sanchez, E.
  • Alastruey-Benede, J.
  • Torres-Moreno, E.
RISC-V is an emergent architecture that is gaining strength in low-power IoT applications. The stabilization of the architectural extensions and the start of commercialization of RISC-V based SOCs, like the Kendryte K210, raises the question of whether this open standard will facilitate the development of applications in specific markets or not.In this paper we evaluate the development environments, the toolchain, the debugging processes related to the Sipeed MAIX Go development board, as well as the standalone SDK and the Micropython port for the Kendryte K210. The training pipeline for the built-in convolutional neural network accelerator, with support for Tiny YOLO v2, has also been studied. In order to evaluate all the above aspects in depth, two low-cost, low-power, IoT edge applications based on AI have been developed. The first one is capable of recognizing movement in a house and autonomously identify whether it was caused by a human or by a house pet, like for example a dog or a cat. In the context of the current COVID-19 pandemic, the second application is capable of labeling whether a pedestrian is wearing a face mask or not, doing real-time object recognition at a mean rate of 13 FPS. Throughout the process, we can conclude that, despite the potential of the hardware and its excellent performance/cost ratio, the documentation for developers is scarce, the development environments are in low maturity levels, and the debugging processes are sometimes nonexistent.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Improving accuracy on wave height estimation through machine learning techniques

  • Gracia, S.
  • Olivito, J.
  • Resano, J.
  • Martin-del-Brio, B.
  • de Alfonso, M.
  • Álvarez, E.
Estimatabion of wave agitation plays a key role in predicting natural disasters, path optimization and secure harbor operation. The Spanish agency Puertos del Estado (PdE) has several oceanographic measure networks equipped with sensors for different physical variables, and manages forecast systems involving numerical models. In recent years, there is a growing interest in wave parameter estimation by using machine learning models due to the large amount of oceanographic data available for training, as well as its proven efficacy in estimating physical variables. In this study, we propose to use machine learning techniques to improve the accuracy of the current forecast system of PdE. We have focused on four physical wave variables: spectral significant height, mean spectral period, peak period and mean direction of origin. Two different machine learning models have been explored: multilayer perceptron and gradient boosting decision trees, as well as ensemble methods that combine both models. These models reduce the error of the predictions of the numerical model by 36% on average, demonstrating the potential gains of combining machine learning and numerical models.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Misterio de los Letrabytes Fugados: Evaluación Inclusiva de la Conciencia Fonológica con Gamificación Tangible

  • Oliva, Ana
  • Ayuso, Natalia
  • Coma, Teresa
  • Torres, Enrique
The development of phonological awareness, i.e. the metacognitive skill that allows thinking and manipulating the language structure, from an early age is mandatory for the acquisition of literacy skills. Multisensory stimulation, curiosity and interest are fundamental for learning. In doing so, Communication Technologies have a key role because a learning-oriented use can encourage current digital natives' interest and thinking. This paper presents a game with tangible technology designed to both intervention and diagnostic, formative and summative evaluation. The user experience was carried out during two weeks through a multiple case study with four kindergarten children. A multimedia adventure game was presented in which they had to solve phonological awareness challenges through the manipulation of tangible technology to achieve the final goal. The observation was recorded in the designed evaluation model, allowing the analysis of pre- and post-intervention data after the triangulation of data for subsequent qualitative analysis. The results show an improvement in phonological awareness, as well as the gamified experience marks. These promising outcomes support the use of such methodologies to a learner-centered education model.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

GPU-friendly neural networks for remote sensing scene classification

  • Haut, Juan M.
  • Alcolea, Adrian
  • Paoletti, Mercedes E.
  • Plaza, Javier
  • Resano, Javier
  • Plaza, Antonio
Convolutional neural networks (CNNs) have proven to be very efficient for the analysis of remote sensing (RS) images. Due to the inherent complexity of extracting features from these images, along with the increasing amount of data to be processed (and the diversity of applications), there is a clear tendency to develop and employ increasingly deep and complex CNNs. In this regard, graphics processing units (GPUs) are frequently used to optimize their execution, both for the training and inference stages, optimizing the performance of neural models through their many-core architecture. Hence, the efficient use of the GPU resources should be at the core of optimizations. This letter analyzes the possibilities of using a new family of CNNs, denoted as TResNets, to provide an efficient solution to the RS scene classification problem. Moreover, the considered models have been combined with mixed precision to enhance their training performance. Our experimental results, conducted over three publicly available RS data sets, show that the proposed networks achieve better accuracy and more efficient use of GPU resources than other state-of-the-art networks. Source code is available at https://github.com/mhaut/GPUfriendlyRS.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Ideal and predictable hit ratio for matrix transposition in data caches

  • Pedro-Zapater, Alba
  • Rodríguez, Clemente
  • Segarra, Juan
  • Gran Tejero, Rubén
  • Viñals-Yúfera, Víctor
Matrix transposition is a fundamental operation, but it may present a very low and hardly predictable data cache hit ratio for large matrices. Safe (worst-case) hit ratio predictability is required in real-time systems. In this paper, we obtain the relations among the cache parameters that guarantee the ideal (predictable) data hit ratio assuming a Least-Recently-Used (LRU) data cache. Considering our analytical assessments, we compare a tiling matrix transposition to a cache oblivious algorithm, modified with phantom padding to improve its data hit ratio. Our results show that, with an adequate tile size, the tiling version results in an equal or better data hit ratio. We also analyze the energy consumption and execution time of matrix transposition on real hardware with pseudo-LRU (PLRU) caches. Our analytical hit/miss assessment enables the usage of a data cache for matrix transposition in real-time systems, since the number of misses in the worst case is bound. In general and high-performance computation, our analysis enables us to restrict the cache resources devoted to matrix transposition with no negative impact, in order to reduce both the energy consumption and the pollution to other computations.
Recercat. Dipósit de la Recerca de Catalunya
Publication Contribución de congreso (ConferenceOutput)

Extending OmpSs for OpenCL kernel co-execution in heterogeneous systems

  • Pérez, Borja
  • Stafford, Esteban
  • Bosque, Jose L.
  • Beivide Palacio, Ramon
  • Mateo, Sergi
  • Teruel, Xavier
  • Martorell Bofill, Xavier
  • Ayguadé Parra, Eduard
© 2017 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes,creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works., Heterogeneous systems have a very high potential performance but present difficulties in their programming. OmpSs is a well known framework for task based parallel applications, which is an interesting tool to simplify the programming of these systems. However, it does not support the co-execution of a single OpenCL kernel instance on several compute devices. To overcome this limitation, this paper presents an extension of the OmpSs framework that solves two main objectives: the automatic division of datasets among several devices and the management of their memory address spaces. To adapt to different kinds of applications, the data division can be performed by the novel HGuided load balancing algorithm or by the well known Static and Dynamic. All this is accomplished with negligible impact on the programming. Experimental results reveal that there is always one load balancing algorithm that improves the performance and energy consumption of the system., This work has been supported by the University of Cantabria with grant CVE-2014-18166, the Generalitat de Catalunya under grant 2014-SGR-1051, the Spanish Ministry of Economy, Industry and Competitiveness under contracts TIN2016- 76635-C2-2-R (AEI/FEDER, UE) and TIN2015-65316-P. The Spanish Government through the Programa Severo Ochoa (SEV-2015-0493). The European Research Council under grant agreement No 321253 European Community’s Seventh Framework Programme [FP7/2007-2013] and Horizon 2020 under the Mont-Blanc Projects, grant agreement n 288777, 610402 and 671697 and the European HiPEAC Network., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publication Contribución de congreso (ConferenceOutput)

To distribute or not to distribute: The question of load balancing for performance or energy

  • Stafford, Esteban
  • Pérez, Borja
  • Bosque, Jose L.
  • Beivide Palacio, Ramon
  • Valero Cortés, Mateo
Heterogeneous systems are nowadays a common choice in the path to Exascale. Through the use of accelerators they offer outstanding energy efficiency. The programming of these devices employs the host-device model, which is suboptimal as CPU remains idle during kernel executions, but still consumes energy. Making the CPU contribute computin effort might improve the performance and energy consumption of the system. This paper analyses the advantages of this approach and sets the limits of when its beneficial. The claims are supported by a set of models that determine how to share a single data-parallel task between the CPU and the accelerator for optimum performance, energy consumption or efficiency. Interestingly, the models show that optimising performance does not always mean optimum energy or efficiency as well. The paper experimentally validates the models, which represent an invaluable tool for programmers when faced with the dilemma of whether to distribute their workload in these systems., This work has been supported by the University of Cantabria (CVE-2014-18166), the Spanish Science and Technology Commission (TIN2016-76635-C2-2-R), the European Research Council (G.A. No 321253) and the European HiPEAC Network of Excellence. The Mont-Blanc project has received funding from the European Unions Horizon 2020 research and innovation programme under grant agreement No 671697., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

A scalable synthetic traffic model of Graph500 for computer networks analysis

  • Fuentes Sáez, Pablo
  • Benito, Mariano
  • Vallejo, Enrique
  • Bosque Orero, José Luis
  • Beivide Palacio, Ramon
  • Anghel, Andreea
  • Rodríguez Herrera, Germán
  • Gusat, Mitch
  • Minkenberg, Cyriel
  • Valero Cortés, Mateo
The Graph500 benchmark attempts to steer the design of High-Performance Computing systems to maximize the performance under memory-constricted application workloads. A realistic simulation of such benchmarks for architectural research is challenging due to size and detail limitations. By contrast, synthetic traffic workloads constitute one of the least resource-consuming methods to evaluate the performance. In this work, we provide a simulation tool for network architects that need to evaluate the suitability of their interconnect for BigData applications. Our development is a low computation- and memory-demanding synthetic traffic model that emulates the behavior of the Graph500 communications and is publicly available in an open-source network simulator. The characterization of network traffic is inferred from a profile of several executions of the benchmark with different input parameters. We verify the validity of the equations in our model against an execution of the benchmark with a different set of parameters. Furthermore, we identify the impact of the node computation capabilities and network characteristics in the execution time of the model in a Dragonfly network, The authors would like to thank the European HiPEAC Network of Excellence for partially funding this work through a Collaboration Grant. They would like to thank as well Crist´obal Camarero for his help. This work has been supported by the Spanish Ministry of Education, FPU grants FPU13/00337 and FPU14/02253, the Spanish Ministry of Economy, Industry and Competitiveness under contract TIN2016-76635-C2-2-R (AEI/FEDER, UE), and by the Mont-Blanc project. The Mont-Blanc project has received funding from the European Union’s Horizon 2020 research and innovation programme under grant agreement No 671697. Santander Supercomputacion support group from the University of Cantabria provided access to the Altamira Supercomputer at the Institute of Physics of Cantabria (IFCA-CSIC)., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Auto-tuned OpenCL kernel co-execution in OmpSs for heterogeneous systems

  • Pérez, Borja
  • Stafford, Esteban
  • Bosque Orero, José Luis
  • Beivide Palacio, Ramon
  • Mateo Bellido, Sergi
  • Teruel García, Xavier
  • Martorell Bofill, Xavier
  • Ayguadé Parra, Eduard
© <2018>. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/, The emergence of heterogeneous systems has been very notable recently. The nodes of the most powerful computers integrate several compute accelerators, like GPUs. Profiting from such node configurations is not a trivial endeavour. OmpSs is a framework for task based parallel applications, that allows the execution of OpenCl kernels on different compute devices. However, it does not support the co-execution of a single kernel on several devices. This paper presents an extension of OmpSs that rises to this challenge, and presents Auto-Tune, a load balancing algorithm that automatically adjusts its internal parameters to suit the hardware capabilities and application behavior. The extension allows programmers to take full advantage of the computing devices with negligible impact on the code. It takes care of two main issues. First, the automatic distribution of datasets and the management of device memory address spaces. Second, the implementation of a set of load balancing algorithms to adapt to the particularities of applications and systems. Experimental results reveal that the co-execution of single kernels on all the devices in the node is beneficial in terms of performance and energy consumption, and that Auto-Tune gives the best overall results., Peer Reviewed, Preprint