The FM-index is a data structure which is seeing more and more pervasive use, in particular in the field of highthroughput bioinformatics. Algorithms based on it show a pseudo-random memory access pattern. As a consequence, they are usually bound by memory bandwidth rather than CPU usage. Naive GPU implementations are no exception. Here we show that the combination of a compact design of the FM-index and a thread-cooperative approach can be used to restore a proper balance. The resulting solution is less memory-bandwidth intensive, and allows full exploitation of the computational resources of the GPU across several GPU architectures
We present a number of optimization techniques to compute prefix sums on linked lists and implement ...
The idea of using a graphics processing unit (GPU) for more than simply graphic output purposes has ...
Markov clustering is becoming a key algorithm within bioinformatics for determining clusters in netw...
The FM-index is a data structure which is seeing more and more pervasive use, in particular in the f...
The recent advent of high-throughput sequencing machines producing big amounts of short reads has bo...
2018-02-23Graphics Processing Units (GPUs) are designed primarily to execute multimedia, and game re...
The rapid development of DNA sequencing technologies has demanded for com- pressed data structures ...
The FM-index is a data structure used in genomics for exact search of input sequences over large ref...
Approximate string matching is a very important problem in computational biology; it requires the fa...
The massive parallelism provided by general-purpose GPUs (GPGPUs) possessing numerous compute thread...
Indexed Foreign-Key Joins expose a very asymmetric access pattern: the Foreign-Key Index is sequent...
As GPU's compute capabilities grow, their memory hierarchy increasingly becomes a bottleneck. C...
textGraphics Processing Units (GPUs) have become a popular platform for executing general purpose (i...
In the last three years, GPUs are more and more being used for general purpose applications instead ...
Graphics Processing Unit (GPU)-based architectures have become the default accelerator choice for a ...
We present a number of optimization techniques to compute prefix sums on linked lists and implement ...
The idea of using a graphics processing unit (GPU) for more than simply graphic output purposes has ...
Markov clustering is becoming a key algorithm within bioinformatics for determining clusters in netw...
The FM-index is a data structure which is seeing more and more pervasive use, in particular in the f...
The recent advent of high-throughput sequencing machines producing big amounts of short reads has bo...
2018-02-23Graphics Processing Units (GPUs) are designed primarily to execute multimedia, and game re...
The rapid development of DNA sequencing technologies has demanded for com- pressed data structures ...
The FM-index is a data structure used in genomics for exact search of input sequences over large ref...
Approximate string matching is a very important problem in computational biology; it requires the fa...
The massive parallelism provided by general-purpose GPUs (GPGPUs) possessing numerous compute thread...
Indexed Foreign-Key Joins expose a very asymmetric access pattern: the Foreign-Key Index is sequent...
As GPU's compute capabilities grow, their memory hierarchy increasingly becomes a bottleneck. C...
textGraphics Processing Units (GPUs) have become a popular platform for executing general purpose (i...
In the last three years, GPUs are more and more being used for general purpose applications instead ...
Graphics Processing Unit (GPU)-based architectures have become the default accelerator choice for a ...
We present a number of optimization techniques to compute prefix sums on linked lists and implement ...
The idea of using a graphics processing unit (GPU) for more than simply graphic output purposes has ...
Markov clustering is becoming a key algorithm within bioinformatics for determining clusters in netw...