Skip to main content


Fig. 5 | Algorithms for Molecular Biology

Fig. 5

From: Gerbil: a fast and memory-efficient k-mer counter with GPU-support

Fig. 5

GPU memory access pattern. The figure shows the memory area that is being scanned while probing a hash table entry that is stored at memory address p. In this example, k = 3 and each table entry needs four bytes for the key and four bytes for the counter. Therefore, 16 entries can be loaded from global memory within one step and are scanned in parallel

Back to article page