Skip to main content

Memory Optimizations for Future Multicore Multithreaded Architectures

FJC2018-036021-I

•
Funding agency name Agencia Estatal de Investigación
Funding agency acronym AEI
Program Programa Estatal de Promoción del Talento y su Empleabilidad en I+D+i
Subprogram Subprograma Estatal de Formación
Call Juan de la Cierva Formación
Call year 2018
State Plan 2017-2020 Plan Estatal de Investigación Científica y Técnica y de Innovación
Beneficiary centre UNIVERSIDAD DE MURCIA

Resultados relacionados

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

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

VMT: Virtualized Multi-Threading for Accelerating Graph Workloads on Commodity Processors

  • Feliu-Pérez, Josué|||0000-0003-3017-4266
  • Sahuquillo Borrás, Julio|||0000-0001-8630-4846
  • Petit Martí, Salvador Vicente|||0000-0003-2426-4134
  • Naithani, Ajeya
  • Qureshi, Moinuddin
  • Eeckhout, Lieven
[EN] Modern-day graph workloads operate on huge graphs through pointer chasing which leads to high last-level cache (LLC) miss rates and limited memory-level parallelism (MLP). Simultaneous Multi-Threading (SMT) effectively hides the memory access latencies for multi-threaded graph workloads provided that sufficient threads are supported in hardware. Unfortunately, providing a sufficiently large number of physical threads incurs an unjustifiably high hardware cost for commodity SMT processors which typically implement only two physical hardware threads. Ideally, we would like to achieve aggressive-SMT performance when running graph workloads on modest commodity processors. In this paper, we propose Virtualized Multi-Threading (VMT), a low-overhead multi-threading paradigm for accelerating graph workloads on commodity processors. Unlike prior multi-threading paradigms, VMT virtualizes both the physical hardware threads and the architecture state: VMT maps a large number of logical software threads to a small number of physical hardware threads, while maintaining the architecture state of the logical threads in the processor's cache hierarchy. Implemented on top of a quad-core 2-way SMT processor, VMT achieves an average speedup of 1.74x for a set of representative graph workloads, while incurring minimal hardware cost (195 bytes per core to support up to 32 logical threads). VMT's low hardware cost paves the way for implementation in commodity processors., This work was supported in part by the Spanish MCIU and AEI, Spain, as well as European Commission FEDER funds, under grants RTI2018-098156-B-C53 and RTI2018-098156-BC51. The work of Josue Feliu was supported by a Juan de la Cierva Formacion Contract under Grant FJC2018-036021-I. The work of Lieven Eeckhout was supported in part by the European Research Council Advanced Grant agreement no. 741097 and in part by the Flanders Research Council under Grant G.0144.17N.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

The Forward Slice Core: A High-Performance, Yet Low-Complexity Microarchitecture

  • Lakshminarasimhan, Kartik
  • Naithani, Ajeya
  • Eeckhout, Lieven
  • Feliu-Pérez, Josué|||0000-0003-3017-4266
[EN] Superscalar out-of-order cores deliver high performance at the cost of increased complexity and power budget. In-order cores, in contrast, are less complex and have a smaller power budget, but offer low performance. A processor architecture should ideally provide high performance in a power- and cost-efficient manner. Recently proposed slice-out-of-order (sOoO) cores identify backward slices of memory operations which they execute out-of-order with respect to the rest of the dynamic instruction stream for increased instruction-level and memory-hierarchy parallelism. Unfortunately, constructing backward slices is imprecise and hardware-inefficient, leaving performance on the table. In this article, we propose Forward Slice Core (FSC), a novel core microarchitecture that builds on a stall-on-use in-order core and extracts more instruction-level and memory-hierarchy parallelism than slice-out-of-order cores. FSC does so by identifying and steering forward slices (rather than backward slices) to dedicated in-order FIFO queues. Moreover, FSC puts load-consumers that depend on L1 D-cache misses on the side to enable younger independent load-consumers to execute faster. Finally, FSC eliminates the need for dynamic memory disambiguation by replicating store-address instructions across queues. Considering 3-wide pipeline configurations, we find that FSC improves performance by 27.1%, 21.1%, and 14.6% on average compared to Freeway, the state-of-the-art sOoO core, across SPEC CPU2017, GAP, and DaCapo, respectively, while at the same time incurring reduced hardware complexity. Compared to an OoO core, FSC reduces power consumption by 61.3% and chip area by 47%, providing a microarchitecture with high performance at low complexity., This work is supported by the European Research Council (ERC) Advanced Grant agreement no. 741097, and FWO project G.0144.17N. Josue Feliu is supported by a Juan de la Cierva Formacion Contract (FJC2018-036021-I).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Contribución de congreso (ConferenceOutput)

Diseño y uso de redes neuronales para estimar las prestaciones en solitario de las aplicaciones

  • Lurbe, Manel
  • 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] Cuando varias aplicaciones se ejecutan concurrentemente en un computador con recursos compartidos, como las caches de último nivel o la memoria principal, se producen pérdidas de prestaciones por la interferencia entre aplicaciones en el uso de estos recursos respecto a su ejecución en solitario. Para reducir estas pérdidas, se han diseñado políticas para gestionar estos recursos (por ej., políticas de reparticionando del espacio de cache o de configuración de la prebúsqueda hardware). Un importante desafío en diferentes ámbitos, como la nube o los sistemas de tiempo real, es predecir cómo la acción de una determinada política afectaría a las prestaciones de cada aplicaciones antes de realizarla. Este trabajo presenta una propuesta basada en redes neuronales que, a partir de datos obtenidos por una aplicación en ejecución concurrente con otras aplicaciones, estima las prestaciones que tendría una aplicación en solitario. Los resultados experimentales muestran que la propuesta se adapta dinámicamente a los cambios en el comportamiento de las aplicaciones de la carga. Las prestaciones estimadas presentan, de media, un error del 11,7% y del 2,3% para las métricas MAPE y MSE, respectivamente., Trabajo financiado por el Ministerio de Ciencia, Innovaciçon y Universidades y ERDF bajo la ayuda RTI2018-098156-B-C51, por la GVA AICO/2021/266, por la UPV PAID-01-20. Josué Feliu con apoyo de un contrato de formación Juan de la Cierva (FJC2018-036021-I)
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

DeepP: Deep Learning Multi-Program Prefetch Configuration for the IBM POWER 8

  • Lurbe-Sempere, Manel
  • 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] Current multi-core processors implement sophisticated hardware prefetchers, that can be configured by application (PID),to improve the system performance. When running multiple applications, each application can present different prefetch requirements,hence different configurations can be used. Setting the optimal prefetch configuration for each application is a complex task since itdoes not only depend on the application characteristics but also on the interference at the shared memory resources (e.g. memorybandwidth). In his paper, we proposeDeepP, a deep learning approach for the IBM POWER8 that identifies at run-time the bestprefetch configuration for each application in a workload. To this end, the neural network predicts the performance of each applicationunder the studied prefetch configurations by using a set of performance events. The prediction accuracy of the network is improvedthanks to a dynamic training methodology that allows learning the impact of dynamic changes of the prefetch configuration onperformance. At run-time, the devised network infers the best prefetch configuration for each application and adjusts it dynamically.Experimental results show that the proposed approach improves performance, on average, by 5,8%, 6,7%, and 15,8% compared tothe default prefetch configuration across different 6-, 8-, and 10-application workloads, respectively., This work was supported in part by Ministerio de Ciencia, Innovacion y Universidades and the European ERDF under Grant RTI2018-098156-B-C51, in part by Generalitat Valenciana under Grant AICO/2021/266, and in part by Ayudas Contratos predoctorales UPV -subprograma 1 (PAID-01-20). The work of Josue Feliu was supported by a Juan de la Cierva Formacion Contract under Grant FJC2018-036021-I.