Skip to main content

ARQUITECTURAS Y TECNOLOGIAS EMERGENTES. EFICIENCIA ENERGETICA MEDIANTE HETEROGENEIDAD

TIN2012-32180

•
Funding agency name Ministerio de Economía y Competitividad
Funding agency acronym MINECO
Program Programa Nacional de Proyectos de Investigación Fundamental
Subprogram Subprograma de Proyectos de Investigación Fundamental no Orientada
Call Proyectos I+D
Call year 2012
State Plan 2008-2011 Plan Nacional de Investigación Científica, Desarrollo e Innovación Tecnológica
Management unit Secretaría de Estado de Investigación, Desarrollo e Innovación
Beneficiary centre UNIVERSIDAD COMPLUTENSE DE MADRID

Resultados relacionados

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

RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Computer-assisted method based on continuous feedback to improve the academic achievements of first-year students on Computer Engineering

  • Lemus Zúñiga, Lenin Guillermo|||0000-0002-6361-6019
  • Buendía García, Félix|||0000-0003-3646-4264
  • Poza-Lujan, Jose-Luis|||0000-0003-2450-9920
  • Posadas-Yagüe, Juan-Luis|||0000-0002-5017-8689
  • Benlloch-Dualde, José-V.|||0000-0002-4885-2806
  • Montañana Aliaga, José Miguel
[EN] The student-centered learning is being promoted worldwide in higher education, from 2005, in North-American universities, in 2010 in the European Union, but also in Asian countries like Japan [J. M. Bachnik, Roadblocks on the Information Highway: The IT Revolution in Japanese Education, ser. Studies of Modern Japan. Lexington Books, 2003.]. This paradigm is characterized by applying innovative methods of teaching that involve students as active participants in their own learning. In this paper, it is proposed a method based on detecting the students’ learning gains by using low time consuming “Pretests” and “Posttests”, on a selection of learning activities. The overload of introducing the “Pretest-Posttest” is minimized by using information and communication technologies. The results of the “Pretests” and “Posttests”, provided online, allow the students to be aware of their learning progress. The analysis of these results helps teachers adapt their strategies when presenting the learning activities. The method has been applied on a first-year course on Computer Engineering, during the 2010–2011, 2011–2012 and 2012–2013 academic years. To verify that the method works, two student groups, one control and one experimental, were created. The method was applied in the experimental group. The statistical analysis of the obtained results by the experimental and control groups, shows that the method enhances the grades of the experimental group. Additionally, the support of Information and Communication Technologies minimizes the overload of using this method., Contract grant sponsor: Spanish Government; Contract grant number: TIN 2012-32180
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Solving Weighted Least Squares (WLS) problems on ARM-based architectures

  • Belloch Rodríguez, José Antonio
  • Bank, Balazs
  • Igual Peña, Francisco Daniel
  • Quintana-Ortí, Enrique S.|||0000-0002-5454-165X
  • Vidal Maciá, Antonio Manuel
TheWeighted Least Squares algorithm (WLS) is applied to numerous optimization problems, but requires the use of high computational resources, especially when complex arithmetic is involved. This work aims to accelerate the resolution of a WLS problem by reducing the computational cost (relaying on BLAS/LAPACK routines) and the computational precision from double to single. As a test case, we design an IIR filter for a Graphic Equalizer, where the numerical errors due to single precision are easily visualized. In addition, given the importance of low power architectures for this kind of implementations, we evaluate the performance, scalability, and energy efficiency of each method on two different processors implementing the ARMv7 architecture, widely used in current mobile devices with power constraints. Results show that the method that exhibits a high theoretical computational cost overcomes in efficiency other methods with lower theoretical cost in architectures of this type., This work started in spring 2016 when Jose A. Belloch was a visiting postdoctoral researcher at Budapest University of Technology and Economics thanks to the European Network COST Action IC1305 inside the program Short Term Scientific Mission with the following reference: COST-SPASM-ECOST-STSM-IC1305-020416-072431. Dr. Jose A. Belloch is supported by GVA contract APOSTD/2016/069. The researchers from Universitat Jaume I are supported by the CICYT projects TIN2014-53495-R of MINECO and FEDER. The authors from the Universitat Politecnica de Valencia are supported by MINECO Projects TEC2015-67387-C4-1-R, PROMETEOII/2014/003 and CAPAP-H5 network TIN2014-53522-REDT. The researcher from UCM is supported by the EU (FEDER) and the Spanish MINECO, under Grants TIN 2015-65277-R and TIN2012-32180. The work of Balazs Bank was supported by the UNKP-16-4-III New National Excellence Program of the Ministry of Human Capacities, Hungary.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Enhancing performance and energy consumption of runtime schedulers for dense linear algebra

  • Alonso-Jordá, Pedro|||0000-0002-6882-6592
  • Quintana-Ortí, Enrique S.|||0000-0002-5454-165X
  • Dolz Zaragozá, Manuel Francisco
  • Igual, Francisco D.
  • Mayo, Rafael
The road towards Exascale Computing requires a holistic effort to address three different challenges simultaneously: high performance, energy efficiency, and programmability. The use of runtime task schedulers to orchestrate parallel executions with minimal developer intervention has been introduced in recent years to tackle the programmability issue while maintaining, or even improving, performance. In this paper, we enhance the SuperMatrix runtime task scheduler integrated in the libflame library in two different directions that address high performance and energy efficiency. First, we extend the runtime by accom- modating hybrid parallel executions and managing task priorities for dense linear algebra operations, with remarkable performance improvements. Second, we introduce techniques to reduce energy consumption during idle times inherent to parallel executions, attaining important energy savings. In addition, we propose a power consumption model that can be leveraged by runtime task schedulers to make decisions based not only on performance but also on energy considerations., This research was supported by project CICYT TIN2011-23283 and FEDER, and by the EU-FET grant 'EXA2GREEN' 318793. Francisco D. Igual was supported by project TIN2012-32180.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Time and energy modeling of high-performance Level-3 BLAS on x86 architectures

  • Alonso-Jordá, Pedro|||0000-0002-6882-6592
  • Quintana-Ortí, Enrique S.|||0000-0002-5454-165X
  • Catalán, Sandra
  • Igual, Francisco D
  • Mayo, Rafael
  • Rodríguez-Sánchez, Rafael
[EN] We present accurate piece-wise models for the time and energy costs of high performance implementations of both the matrix multiplication (gemm) and the triangular system solve with multiple right-hand sides (trsm) on x86 architectures. Our methodology decouples the costs due to the floating-point arithmetic/data movement occurring in the higher levels of the cache hierarchy from those of packing/data transfers between the main memory and the L2/L3 cache. A careful analytical study of the data transfers, in combination with an architecture-specific calibration of the costs per operation, render then the components to assemble piece-wise models for the accurate estimation of gemm and trsm¿s performance on x86 processors. Our experimental results on an Intel Xeon E5-2620 processor confirm the accuracy of this approach, which reports relative errors for different shapes of gemm and trsm that are, respectively, around 1.5% and 4.5% on average for both time and energy., This work was supported by the CICYT Projects TIN2011-23283 and CICYT-TIN 2012-32180 of the MINECO and FEDER, and the EU FET Project FP7 318793 "EXA2GREEN".
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Reuse Detector: Improving the management of STT-RAM SLLCs

  • Rodríguez-Rodríguez, Roberto
  • Díaz, Javier
  • Castro, Fernando
  • Ibáñez, Pablo
  • Chaver, Daniel
  • Viñals, Víctor
  • Sáez, Juan Carlos
  • Prieto, Manuel
  • Piñuel, Luis
  • Monreal, Teresa
  • Llabería, José María
Various constraints of Static Random Access Memory (SRAM) are leading to consider new memory technologies as candidates for building on-chip shared last-level caches (SLLCs). Spin-Transfer Torque RAM (STT-RAM) is currently postulated as the prime contender due to its better energy efficiency, smaller die footprint and higher scalability. However, STT-RAM also exhibits some drawbacks, like slow and energy-hungry write operations that need to be mitigated before it can be used in SLLCs for the next generation of computers. In this work, we address these shortcomings by leveraging a new management mechanism for STT-RAM SLLCs. This approach is based on the previous observation that although the stream of references arriving at the SLLC of a Chip MultiProcessor (CMP) exhibits limited temporal locality, it does exhibit reuse locality, i.e. those blocks referenced several times manifest high probability of forthcoming reuse. As such, conventional STT-RAM SLLC management mechanisms, mainly focused on exploiting temporal locality, result in low efficient behavior. In this paper, we employ a cache management mechanism that selects the contents of the SLLC aimed to exploit reuse locality instead of temporal locality. Specifically, our proposal consists in the inclusion of a Reuse Detector (RD) between private cache levels and the STT-RAM SLLC. Its mission is to detect blocks that do not exhibit reuse, in order to avoid their insertion in the SLLC, hence reducing the number of write operations and the energy consumption in the STT-RAM. Our evaluation, using multiprogrammed workloads in quad-core, eight-core and 16-core systems, reveals that our scheme reports on average, energy reductions in the SLLC in the range of 37–30%, additional energy savings in the main memory in the range of 6–8% and performance improvements of 3% (quad-core), 7% (eight-core) and 14% (16-core) compared with an STT-RAM SLLC baseline where no RD is employed. More importantly, our approach outperforms DASCA, the state-of-the-art STT-RAM SLLC management, reporting—depending on the specific scenario and the kind of applications used—SLLC energy savings in the range of 4–11% higher than those of DASCA, delivering higher performance in the range of 1.5–14% and additional improvements in DRAM energy consumption in the range of 2–9% higher than DASCA.
Docta Complutense
Publication Artículo científico (JournalArticle)

Reuse detector: improving the management of STT-RAM SLLCs

  • Rodríguez Rodríguez, Roberto Alonso
  • Díaz, Javier
  • Castro Rodríguez, Fernando
  • Ibáñez, Pablo
  • Chaver Martínez, Daniel Ángel
  • Viñals, Víctor
  • Sáez Alcaide, Juan Carlos
  • Prieto Matías, Manuel
  • Piñuel Moreno, Luis
  • Monreal, Teresa
  • Llabería, José María
Various constraints of Static Random Access Memory (SRAM) are leading to consider new memory technologies as candidates for building on-chip shared last-level caches (SLLCs). Spin-Transfer Torque RAM (STT-RAM) is currently postulated as the prime contender due to its better energy efficiency, smaller die footprint and higher scalability. However, STT-RAM also exhibits some drawbacks, like slow and energy-hungry write operations that need to be mitigated before it can be used in SLLCs for the next generation of computers. In this work, we address these shortcomings by leveraging a new management mechanism for STT-RAM SLLCs. This approach is based on the previous observation that although the stream of references arriving at the SLLC of a Chip MultiProcessor (CMP) exhibits limited temporal locality, it does exhibit reuse locality, i.e. those blocks referenced several times manifest high probability of forthcoming reuse. As such, conventional STT-RAM SLLC management mechanisms, mainly focused on exploiting temporal locality, result in low efficient behavior. In this paper, we employ a cache management mechanism that selects the contents of the SLLC aimed to exploit reuse locality instead of temporal locality. Specifically, our proposal consists in the inclusion of a Reuse Detector (RD) between private cache levels and the STT-RAM SLLC. Its mission is to detect blocks that do not exhibit reuse, in order to avoid their insertion in the SLLC, hence reducing the number of write operations and the energy consumption in the STT-RAM. Our evaluation, using multiprogrammed workloads in quad-core, eight-core and 16-core systems, reveals that our scheme reports on average, energy reductions in the SLLC in the range of 37–30%, additional energy savings in the main memory in the range of 6–8% and performance improvements of 3% (quadcore), 7% (eight-core) and 14% (16-core) compared with an STT-RAM SLLC baseline where no RD is employed. More importantly, our approach outperforms DASCA, the state-of-the-art STT-RAM SLLC management, reporting —depending on the specific scenario and the kind of applications used— SLLC energy savings in the range of 4–11% higher than those of DASCA, delivering higher performance in the range of 1.5–14% and additional improvements in DRAM energy consumption in the range of 2–9% higher than DASCA.