Skip to main content

Microarchitecture optimizations to improve performance and energy-efficiency of future general-purpose processors

RYC2021-030862-I

•
Funding agency name Agencia Estatal de Investigación
Funding agency acronym AEI
Program Programa Estatal para Desarrollar, Atraer y Retener Talento
Subprogram Subprograma Estatal de Incorporación
Call Ramón y Cajal
Call year 2021
State Plan 2021-2023 Plan Estatal de Investigación Científica y Técnica y de Innovación
Beneficiary centre UNIVERSITAT POLITÈCNICA DE VALÈNCIA

Resultados relacionados

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

RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Contribución de congreso (ConferenceOutput)

SYNPA: SMT Performance Analysis and Allocation of Threads to Cores in ARM Processors

  • Navarro-Edo, Marta|||0000-0002-4334-460X
  • Feliu-Pérez, Josué|||0000-0003-3017-4266
  • Petit Martí, Salvador Vicente|||0000-0003-2426-4134
  • Gómez Requena, María Engracia|||0000-0003-1466-4118
  • Sahuquillo Borrás, Julio|||0000-0001-8630-4846
[EN] Simultaneous multithreading processors improve throughput over single-threaded processors thanks to sharing internal core resources among instructions from distinct threads. However, resource sharing introduces inter-thread interference within the core, which has a negative impact on individual application performance and can significantly increase the turnaround time of multi-program workloads. The severity of the interference effects depends on the competing co-runners sharing the core. Thus, it can be mitigated by applying a thread-to-core allocation policy that smartly selects applications to be run in the same core to minimize their interference. This paper presents SYNPA, a simple approach that dynamically allocates threads to cores in an SMT processor based on their run-time dynamic behavior. The approach uses a regression model to select synergistic pairs to mitigate intracore interference. The main novelty of SYNPA is that it uses just three variables collected from the performance counters available in current ARM processors at the dispatch stage. Experimental results show that SYNPA outperforms the default Linux scheduler by around 36%, on average, in terms of turnaround time in 8-application workloads combining frontendbound and backend-bound benchmarks. Index Terms¿Simultaneous Multithreading, Scheduling, HighPerformance Computing, HPC applications, Thread-to-Core allocation, synergistic applications, intra-core interference., This work has been supported by the Spanish Ministerio de Ciencia e Innovacion and European ERDF under grant PID2021-123627OB-C51, TED2021-130233B-C32 and Generalitat Valenciana under grant AICO/2021/266. Marta Navarro is supported by Subvenciones para la contratacion de personal investigador predoctoral by CIACIF/2021/413 . Josue Feliu is supported by the RYC2021-030862-I contract, funded by the MCIN/AEI /10.13039/501100011033 and the European Union NextGenerationEU/PRTR.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Contribución de congreso (ConferenceOutput)

Thread-to-Core Allocation in ARM Processors Buildings Synergistic Pairs

  • Navarro-Edo, Marta|||0000-0002-4334-460X
  • Feliu-Pérez, Josué|||0000-0003-3017-4266
  • Petit Martí, Salvador Vicente|||0000-0003-2426-4134
  • Gómez Requena, María Engracia|||0000-0003-1466-4118
  • Sahuquillo Borrás, Julio|||0000-0001-8630-4846
[EN] Simultaneous multithreading (SMT) processors can present significant throughput improvements over singlethreaded (ST) processors thanks to sharing internal core resources among instructions executing from multiple threads. However, resource sharing introduces inter-thread interference within the core, which negatively impacts individual application performance and can significantly increase the turnaround time of multi-program workloads. The severity of the intra-core interference on performance depends on the applications corunning in the same core. A thread scheduler can help reduce this effect by smartly selecting the pairs of applications that should run on each SMT core. This paper presents SYNPA, a simple approach that dynamically allocates threads to SMT cores based on their run-time dynamic behavior. SYNPA uses a regression model to select synergistic pairs to mitigate intra-core interference. Results show that SYNPA outperforms the default Linux scheduler by around 35%, on average, in terms of turnaround time when running 8- application workloads combining frontend-bound and backendbound applications., This work has been supported by the Spanish Ministerio de Ciencia e Innovacion and European ERDF under grant PID2021-123627OB-C51, TED2021-130233B-C32, and Generalitat Valenciana under grant AICO/2021/266. Marta Navarro is supported by Subvenciones para la contratacion de personal investigador predoctoral by CIACIF/2021/413 . Josue Feliu is supported by the RYC2021-030862-I contract, funded by the MCIN/AEI /10.13039/501100011033 and the European Union NextGenerationEU/PRTR.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Contribución de congreso (ConferenceOutput)

No Rush in Executing Atomic Instructions

  • Asgharzadeh, Ashkan
  • Acacio, Manuel E.
  • Kaxiras, Stefanos
  • Ros, Alberto
  • Feliu-Pérez, Josué|||0000-0003-3017-4266
[EN] Hardware atomic instructions are the building blocks of the synchronization algorithms. Historically, to guarantee atomicity and consistency, they were implemented using memory fences, committing older memory instructions, and draining the store buffer before initiating the execution of atomics. Unfortunately, the use of such memory fences entails huge performance penalties as it implies execution serialization, thus impeding instruction- and memory-level parallelism. The situation, however, seems to have changed recently. Through experiments on x86 machines, we discovered that current x86 processors manage to comply with the x86-TSO requirements while avoiding the performance overhead introduced by fences (fence-free or unfenced implementation). This paves the way to new potential optimizations to atomic instruction execution. In particular, our simulation experiments modeling unfenced atomics reveal that executing atomic instructions as soon as their operands are ready does not always lead to optimal performance. In fact, this increases the time that other threads should wait to obtain the cacheline. In contended scenarios, delaying the execution of the atomic instruction to minimize the time the cacheline is locked provides superior performance. Based on this observation, we present Rush or Wait (RoW), a hardware mechanism to decide when to execute an atomic instruction. The mechanism is based on a contention predictor that estimates if an atomic will access a contended cacheline. Non-contended atomics execute once their operands are ready. Contended atomics, on the contrary, wait to become the oldest memory instruction and to drain the store buffer to execute, minimizing the contention on the accessed cacheline. Our experimental evaluation shows that RoW reduces execution time on average by 9.2% (and up to 43%) compared to a baseline that executes atomics as soon as the operands are ready, and yet it requires a small area overhead (64 bytes)., This project has received funding from the European Research Council (ERC) under the European Union s Horizon 2020 research and innovation programme (grant agreement No 819134), from the MCIN/AEI/10.13039/501100011033/ and the ERDF A way of making Europe , EU (grants PID2021-123627OB-C51 and PID2022-136315OB-I00), from the MCIN/AEI/10.13039/501100011033/ and the European Union NextGenerationEU/PRTR (grants RYC2021-030862-I and TED2021-130233B-C33), from the Swedish Research Council (VR grant 2022-04959), and from the Swedish Foundation for Strategic Research (SSF grant FUS21-0067).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Contribución de congreso (ConferenceOutput)

CELLO: Compiler-Assisted Efficient Load-Load Ordering in Data-Race-Free Regions

  • Singh, Sawan
  • Acacio, Manuel E.
  • Jimborean, Alexandra
  • Ros, Alberto
  • Feliu-Pérez, Josué|||0000-0003-3017-4266
[EN] Efficient Total Store Order (TSO) implementations allow loads to execute speculatively out-of-order. To detect order violations, the load queue (LQ) holds all the in-flight loads and is searched on every invalidation and cache eviction. Moreover, in a simultaneous multithreading processor (SMT), stores also search the LQ when writing to cache. LQ searches entail considerable energy consumption. Furthermore, the processor stalls upon encountering the LQ full or when its ports are busy. Hence, the LQ is a critical structure in terms of both energy and performance. In this work, we observe that the use of the LQ could be dramatically optimized under the guarantees of the datarace-free (DRF) property imposed by modern programming languages. To leverage this observation, we propose CELLO, a software-hardware co-design in which the compiler detects memory operations in DRF regions and the hardware optimizes their execution by safely skipping LQ searches without violating the TSO consistency model. Furthermore, CELLO allows removing DRF loads from the LQ earlier, as they do not need to be searched to detect consistency violations. With minimal hardware overhead, we show that an 8-core 2-way SMT processor with CELLO avoids almost all conservative searches to the LQ and significantly reduces its occupancy. CELLO allows i) to reduce the LQ energy expenditure by 33% on average (up to 53%) while performing 2.8% better on average (up to 18.6%) than the baseline system, and ii) to shrink the LQ size from 192 to only 80 entries, reducing the LQ energy expenditure as much as 69% while performing on par with a mainstream LQ implementation., This project has received funding from the European Research Council (ERC) under the European Union s Horizon 2020 research and innovation program (grant agreement No 819134), from the MCIN/AEI/10.13039/501100011033/ and the ERDF A way of making Europe , EU (grant PID2022- 136315OB-I00), from the European Union s Horizon 2021 research and innovation program (grant agreement No 101070374 under HORIZON-CL4-2021-DIGITALEMERGING-01) and RYC2018-025200-I, and from the MCIN/AEI/10.13039/501100011033/ and the European Union NextGenerationEU/PRTR (grants TED2021-130233BC33/C32 and RYC2021-030862-I).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Contribución de congreso (ConferenceOutput)

Rebasing Microarchitectural Research with Industry Traces

  • Feliu-Pérez, Josué|||0000-0003-3017-4266
  • Perais, Arthur
  • Jiménez, Daniel A.
  • Ros, Alberto
[EN] Microarchitecture research relies on performance models with various degrees of accuracy and speed. In the past few years, one such model, ChampSim, has started to gain significant traction by coupling ease of use with a reasonable level of detail and simulation speed. At the same time, datacenter class workloads, which are not trivial to set up and benchmark, have become easier to study via the release of hundreds of industry traces following the first Championship Value Prediction (CVP-1) in 2018. A tool was quickly created to port the CVP-1 traces to the ChampSim format, which, as a result, have been used in many recent works. In this paper, we revisit this conversion tool and find that several key aspects of the CVP-1 traces are not preserved by the conversion. We therefore propose an improved converter that addresses most conversion issues as well as patches known limitations of the CVP-1 traces themselves. We evaluate the impact of our changes on two commits of ChampSim, with one used for the first Instruction Championship Prefetching (IPC-1) in 2020. We find that the performance variation stemming from higher accuracy conversion is significant., This project has received funding from the European Research Council (ERC) under the European Union s Horizon 2020 research and innovation programme (grant agreement No 819134), from the MCIN/AEI/10.13039/501100011033/ and the ERDF A way of making Europe , EU (grants PID2021-123627OB-C51 and PID2022-136315OB-I00) and the European Union NextGenerationEU/PRTR (grants RYC2021- 030862-I and TED2021-130233B-C33/C32), from the National Science Foundation (grants CNS-1938064 and CCF-1912617), as well as generous gifts from Intel. Portions of this research were conducted with the advanced computing resources provided by Texas A&M High Performance Research Computing.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

SYNPA: understanding the impact of the interference modeling on thread-to-core allocation policies for SMT ARM processors

  • Navarro-Edo, Marta|||0000-0002-4334-460X
  • Feliu-Pérez, Josué|||0000-0003-3017-4266
  • Petit Martí, Salvador Vicente|||0000-0003-2426-4134
  • Gómez Requena, María Engracia|||0000-0003-1466-4118
  • Sahuquillo Borrás, Julio|||0000-0001-8630-4846
[EN] Modern high-performance servers increasingly rely on Simultaneous Multithreading (SMT) processors to enhance throughput with minimal area overhead. However, SMT architectures introduce inter-application interference, often resulting in degraded performance for individual applications. To address this issue, interference-aware thread-to-core (T2C) allocation policies are essential. This paper explores the design and implementation of such policies using real performance counters on ARM processors. We introduce the Instructions and Stalls Cycles (ISC) stack¿a simple yet effective model for characterizing application behavior and identifying synergistic thread pairings. Building on our previous work, SYNPA, we improve the accuracy of the model by accounting for horizontal waste (that is, unused dispatch slots) and proposing methods to address limitations in ARM¿s Performance Monitoring Unit (PMU), which prevent complete attribution of processor cycles. These enhancements result in a family of SYNPA schedulers, each based on a different ISC stack variant. Detailed discussions are provided on the pros and cons that researchers typically face when building a performance stack on commercial processors. These analyses are intended to assist researchers in their work., This work has been supported by the Spanish Ministerio de Ciencia e Innovación and European ERDF under grant PID2024-158682OB-C31 and Generalitat Valenciana under grant CIPROM/2024/007. Marta Navarro is supported by Subvenciones para la contratación de personal investigador predoctoral by CIACIF/2021/413. Josué Feliu is supported by the RYC2021-030862-I contract, funded by the MCIN/AEI /10.13039/501100011033 and the European Union NextGenerationEU/PRTR.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Contribución de congreso (ConferenceOutput)

PANES(Parejas afiNES): Estrategia de mejora de prestaciones en procesadores SMT de ARM

  • Navarro-Edo, Marta|||0000-0002-4334-460X
  • Feliu-Pérez, Josué|||0000-0003-3017-4266
  • Petit Martí, Salvador Vicente|||0000-0003-2426-4134
  • Gómez Requena, María Engracia|||0000-0003-1466-4118
  • Sahuquillo Borrás, Julio|||0000-0001-8630-4846
[ES] Este artículo presenta PANES, una estrategia sencilla que asigna dinámicamente hilos a núcleos de un procesador SMT en función de su comportamiento dinámico en tiempo de ejecución., Este trabajo ha sido financiado por el Ministerio de Ciencia e Innovaci¿on junto al FEDER europeo a trav¿es de los proyectos PID2021-123627OBC51, TED2021-130233B-C3 y AICO/2021/266. Marta Navarro tiene la beca Subvenciones para la contrataci¿on de personal investigador predoctoral de la Generalitat Valenciana (ACIF2022). Josu¿e Feliu cuenta con el apoyo del contrato RYC2021-030862-I financiado por MCIN/AEI /10.13039/501100011033 y por la Uni¿on Europea NextGenerationEU/PRTR.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Contribución de congreso (ConferenceOutput)

Diseño de Políticas de Asignación de Hilos en Procesadores ARM SMT Basadas en Categorías

  • Navarro-Edo, Marta|||0000-0002-4334-460X
  • Feliu-Pérez, Josué|||0000-0003-3017-4266
  • Petit Martí, Salvador Vicente|||0000-0003-2426-4134
  • Gómez Requena, María Engracia|||0000-0003-1466-4118
  • Sahuquillo Borrás, Julio|||0000-0001-8630-4846
[ES] Los servidores HPC modernos integran procesadores simultaneous multithreading (SMT). Estos procesadores comparten los recursos internos del nucleo entre diversos hilos de ejecucion, lo cual les permite alcanzar mayores prestaciones. Sin embargo, esto introduce interferencias entre los hilos que se ejecutan en el mismo nucleo. Esta interferencia intranucleo pone en peligro la mejora de prestaciones y puede aumentar el tiempo de ejecucion. Las pol¿ticas de asignacion de hilos a nucleos (Thread-to-Core Allocation, T2C ) abordan este problema en dos pasos: (i) construir una performance stack por aplicacion usando contadores hardware y (ii) predecir las parejas afines de aplicaciones y asignarlas al mismo nucleo. Este art¿culo presenta la Instructions and Stall Cycles (ISC) stack, un nuevo enfoque diseñado para procesadores ARM resolviendo las limitaciones de la PMU de estos procesadores. Estas stacks de ISC se utilizan en un modelo de prediccion para determinar las parejas afines que ayuden a mejorar las prestaciones. Este trabajo presenta el diseño y analisis de SYNPA, una familia de pol¿ticas T2C guiada por modelos de prediccion de prestaciones basados en stacks de ICS. Los experimentos demuestran que SYNPA4, la mejor variante, reduce el tiempo de ejecucion en un 38 % frente a Linux, logrando 3× las mejoras de pol¿ticas del estado del arte. SYNPA4 se puede aplicar a otros procesadores SMT siguiendo la metodolog¿a presentada en este trabajo., Este trabajo ha sido parcialmente financiado por por el Ministerio de Ciencia e Innovacion junto al FEDER europeo a traves de los proyectos PID2021-123627OB-C51 y TED2021-130233B-C32. Marta Navarro tiene la beca de Subvenciones para la contratacion de personal investigador predoctoral by CIACIF/2021/413. Josue Feliu cuenta con el apoyo del contrato RYC2021-030862-I financiado por MCIN/AEI /10.13039/501100011033 y por la Union Europea NextGenerationEU/PRTR.