Skip to main content

Resultados relacionados

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

UPCommons. Portal del coneixement obert de la UPC
Publication Estudio, informe, memoria (Report)

Boosting point cloud search with a vector unit

  • Exenberger Becker, Pedro Henrique|||0000-0001-5947-1913
  • Arnau Montañés, José María|||0000-0002-0336-9191
  • González Colás, Antonio María|||0000-0002-0009-0996
Treball presentat a: RoboARCH, Workshop on Robotics Acceleration with Computing Hardware, an MICRO 2023 Workshop., Modern robots collect and process point clouds to perform accurate registration and segmentation. The most time-consuming kernel within point cloud processing -namely neighbor search- relies on appropriate data structures, such as k-d trees to prune the search space. In this work, we exploit similarity in subsequent k-d tree traversals to improve search on CPUs leveraging vector units. We show the potential for vectorizing k-d tree search using modern vector hardware, and performance benefits with a software-only implementation. Further, we discuss limitations in current architectures and present in-progress ideas to specialize the CPU vector hardware for an efficient k-d tree vector search., This work has been supported by the CoCoUnit ERC Advanced Grant of the EU’s Horizon 2020 program (grant No 833057), the Spanish State Research Agency (MCIN/AEI) under grant PID2020-113172RB-I00, the ICREA Academia program, and a FPI-UPC 2020 grant.
UPCommons. Portal del coneixement obert de la UPC
Publication Estudio, informe, memoria (Report)

Analyzing and improving hardware modeling of Accel-Sim

  • Huerta Gañán, Rodrigo|||0000-0003-0052-7710
  • Abaie Shoushtary, Mojtaba|||0000-0003-2377-6939
  • González Colás, Antonio María|||0000-0002-0009-0996
Treball presentat a: 1st Workshop on Computer Architecture Modeling and Simulation (CAMS 2023), GPU architectures have become popular for executing generalpurpose programs. Their many-core architecture supports a large number of threads that run concurrently to hide the latency among dependent instructions. In modern GPU architectures, each SM/core is typically composed of several sub-cores, where each sub-core has its own independent pipeline. Simulators are a key tool for investigating novel concepts in computer architecture. They must be performance-accurate and have a proper model related to the target hardware to explore the different bottlenecks properly. This paper presents a wide analysis of different parts of Accelsim, a popular GPGPU simulator, and some improvements of its model. First, we focus on the front-end and developed a more realistic model. Then, we analyze the way the result bus works and develop a more realistic one. Next, we describe the current memory pipeline model and propose a model for a more cost-effective design. Finally, we discuss other areas of improvement of the simulator., This work has been supported by the CoCoUnit ERC Advanced Grant of the EU’s Horizon 2020 program (grant No 833057), the Spanish State Research Agency (MCIN/AEI) under grant PID2020-113172RB-I00, and the ICREA Academia program.
UPCommons. Portal del coneixement obert de la UPC
Publication Estudio, informe, memoria (Report)

WaRM: Warp reorder to reduce memory latency in graphics workloads

  • Joseph, Diya
  • Aragón Alcaraz, Juan Luis
  • Parcerisa Bundó, Joan Manuel|||0000-0001-5771-8118
  • González Colás, Antonio María|||0000-0002-0009-0996
GPUs are designed to handle long-latency operations effectively; however, challenges such as increasing memory latency and core occupancy (number of warps in a core) can impede their latency management. Increasing the number of warps in a core can help manage higher memory latency, but this has a high cost in Register File size, Instruction Buffer size, and other resources in the core. Moreover, in Tile-Based Rendering (TBR) GPUs, core occupancy might remain low for extended durations. To address this challenge, we introduce WaRM, a lightweight warp reordering technique tailored for GPUs in graphics applications. WaRM strategically initiates a select subset of warps, termed priority warps, early in execution to reduce memory latency for subsequent warps. This optimization taps into the inherent but underutilized memory parallelism within the GPUcore. This underutilization is a consequence of a baseline warp order that evenly spaces misses throughout execution to exploit the inherent spatial locality in graphics workloads. WaRM improves on this by reducing average memory latency while maintaining locality for the majority of warps. While maximizing memory parallelism utilization, WaRM prevents saturating the caches with misses to avoid filling up the MSHRs (Miss Status Holding Registers). This approach reduces cache stalls that halt further accesses to the cache. Overall, WaRM yields a significant 3.9% performance speedup. Importantly, WaRM accomplishes these enhancements with negligible overhead, positioning it as a promising solution for enhancing the efficiency of GPUs in managing the increasingly relevant latency challenges., This work has been supported by the CoCoUnit ERC Advanced Grant of the EU’s Horizon 2020 program (grant No 833057), the Spanish State Research Agency (MCIU/AEI/ 10.13039/501100011033) and FEDER/UE under grants PID2020-113172RB-I00 and PID2024-155476OB-I00, the Catalan Agency for University and Research (AGAUR) under grant 2021 SGR 00383, the ICREA Academia program and the AGAUR grant 2020-FISDU-00287.
UPCommons. Portal del coneixement obert de la UPC
Publication Estudio, informe, memoria (Report)

Parallelizing a modern GPU simulator

  • Huerta Gañán, Rodrigo|||0000-0003-0052-7710
  • González Colás, Antonio María|||0000-0002-0009-0996
Simulators are a primary tool in computer architecture research but are extremely computationally intensive. Simulating modern architectures with increased core counts and recent workloads can be challenging, even on modern hardware. This paper demonstrates that simulating some GPGPU workloads in a single-threaded stateof-the-art simulator such as Accel-sim can take more than five days. In this paper we present a simple approach to parallelize this simulator with minimal code changes by using OpenMP. Moreover, our parallelization technique is deterministic, so the simulator provides the same results for single-threaded and multi-threaded simulations. Compared to previous works, we achieve a higher speed-up, and, more importantly, the parallel simulation does not incur any inaccuracies. When we run the simulator with 16 threads, we achieve an average speed-up of 5.8x and reach 14x in some workloads. This allows researchers to simulate applications that take five days in less than 12 hours. By speeding up simulations, researchers can model larger systems, simulate bigger workloads, add more detail to the model, increase the efficiency of the hardware platform where the simulator is run, and obtain results sooner., This work has been supported by the CoCoUnit ERC Advanced Grant of the EU’s Horizon 2020 program (grant No 833057), the Spanish State Research Agency (MCIN/AEI) under grant PID2020- 113172RB-I00, the Catalan Agency for University and Research (AGAUR) under grant 2021SGR00383, and the ICREA Academia program.