Squeeze: Efficient compact fractals for tensor core GPUs
Abstract
This work presents Squeeze, an efficient compact fractal processing scheme for tensor core GPUs. By combining discrete-space transformations between compact , expanded forms, one can do data -parallel computation on a fractal with neighborhood access without needing to expand the fractal in memory. The space transformations are formulated as two GPU tensor-core accelerated thread maps, lambda(omega) and nu(omega), which act as compact-to-expanded and expanded-to-compact space functions, respectively. The cost of the maps is O(log(2) logs(n)) time, with n being the side of a n x n embedding for the fractal in its expanded form , s the linear scaling factor. The proposed approach works for any fractal that belongs to the Non-overlapping-Bounding-Boxes (NBB) class of discrete fractals, and can be extended to three dimensions as well. Experimental results using a discrete Sierpinski Triangle as a case study shows up to ~ 12x of speedup and a memory reduction factor of up to ~315x with respect to a GPU-based expanded-space bounding box approach. These results show that the proposed compact approach will allow the scientific community to efficiently tackle problems that up to now could not fit into GPU memory. (C) 2022 Elsevier B.V. All rights reserved.
Más información
Título según WOS: | Squeeze: Efficient compact fractals for tensor core GPUs |
Título de la Revista: | FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE |
Volumen: | 135 |
Editorial: | Elsevier |
Fecha de publicación: | 2022 |
Página de inicio: | 10 |
Página final: | 19 |
DOI: |
10.1016/j.future.2022.04.023 |
Notas: | ISI |