Papers
Topics
Authors
Recent
Search
2000 character limit reached

A Scalable and Energy Efficient GPU Thread Map for m-Simplex Domains

Published 24 Aug 2022 in cs.DC and cs.DM | (2208.11617v3)

Abstract: This work proposes a new GPU thread map for mm-simplex domains, that scales its speedup with dimension and is energy efficient compared to other state of the art approaches. The main contributions of this work are i) the formulation of the new block-space map H:Zm↩Zm\mathcal{H}: \mathbb{Z}^m \mapsto \mathbb{Z}^m for regular orthogonal simplex domains, which is analyzed in terms of resource usage, and ii) the experimental evaluation in terms of speedup over a bounding box approach and energy efficiency as elements per second per Watt. Results from the analysis show that H\mathcal{H} has a potential speedup of up to 2×2\times and 6×6\times for $2$ and $3$-simplices, respectively. Experimental evaluation shows that H\mathcal{H} is competitive for $2$-simplices, reaching 1.2Ă—âˆŒ2.0×1.2\times \sim 2.0\times of speedup for different tests, which is on par with the fastest state of the art approaches. For $3$-simplices H\mathcal{H} reaches up to 1.3Ă—âˆŒ6.0×1.3\times \sim 6.0\times of speedup making it the fastest of all. The extension of H\mathcal{H} to higher dimensional mm-simplices is feasible and has a potential speedup that scales as m!m! given a proper selection of parameters r,ÎČr, \beta which are the scaling and replication factors, respectively. In terms of energy consumption, although H\mathcal{H} is among the highest in power consumption, it compensates by its short duration, making it one of the most energy efficient approaches. Lastly, further improvements with Tensor and Ray Tracing Cores are analyzed, giving insights to leverage each one of them. The results obtained in this work show that H\mathcal{H} is a scalable and energy efficient map that can contribute to the efficiency of GPU applications when they need to process mm-simplex domains, such as Cellular Automata or PDE simulations.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.