Efficient GPU Implementation of Affine Index Permutations on Arrays
Optimal usage of the memory system is a key element of fast GPU algorithms. Unfortunately many common algorithms fail in this regard despite exhibiting great regularity in memory access patterns. In this paper we propose efficient kernels to permute the elements of an array. We handle a class of permutations known as Bit Matrix Multiply Complement (BMMC) permutations, for which we design kernels of speed comparable to that of a simple array copy. This is a first step towards implementing a set of array combinators based on these permutations.
Mon 4 SepDisplayed time zone: Pacific Time (US & Canada) change
11:00 - 12:30
|Fast Deep Learning with Categories
Michael Sperber Active Group GmbH
|Efficient GPU Implementation of Affine Index Permutations on Arrays
Mathis Bouverot-Dupuis École normale supérieure Paris-Saclay, Mary Sheeran Chalmers | University of GothenburgDOI