Thread Mapping

A scalable and energy efficient GPU thread map for m-simplex domains
This work proposes a new GPU thread map for m-simplex domains that improves its speedup along with the m-dimension and is energy …
Cite DOI URL
Squeeze: Efficient compact fractals for tensor core GPUs
This work presents Squeeze, an efficient compact fractal processing scheme for tensor core GPUs. By combining discrete-space …
Cite DOI URL
Efficient GPU thread mapping on embedded 2D fractals
This work proposes a new approach for mapping GPU threads onto a family of discrete embedded 2D fractals. A block-space map λ:ZE2↦ZF2 …
Cite DOI URL
Block-space GPU mapping for embedded Sierpiński gasket fractals
This research examines GPU thread mapping for a Sierpiński gasket fractal embedded in an n×n discrete Euclidean space. The authors …
DOI arXiv
Possibilities of Recursive GPU Mapping for Discrete Orthogonal Simplices
The problem of parallel thread mapping is studied for the case of discrete orthogonal m-simplices. The possibility of a O(1) time …
arXiv
Potential benefits of a block-space GPU approach for discrete tetrahedral domains
This work analyzes combining tetrahedral data reorganization with an efficient block-space GPU mapping function. The approach can …
DOI
A Non-linear GPU Thread Map for Triangular Domains
We study the case of mapping threads efficiently onto triangular domain problems and propose a block-space linear map based on the …
arXiv
Improving the GPU space of computation under triangular domain problems
There is a stage in the GPU computing pipeline where a grid of thread-blocks is mapped to the problem domain. Normally, this grid is a …
arXiv