MAPPING on UPMEM - Archive ouverte HAL Access content directly
Reports (Research Report) Year : 2016



This paper presents the implementation of a mapping algorithm on the UPMEM architecture. The mapping is a basic bioinformatics application that consists in finding the best location of millions of short DNA sequences on a full genome. The mapping can be constrained by a maximum number of differences between the DNA sequence and the region of the genome where a high similarity has been found. UPMEM’s Processing-In-Memory (PIM) solution consist of adding processing units into the DRAM, to minimize data access time and maximize bandwidth, in order to drastically accelerate data-consuming algorithms. A 16 GBytes UPMEM-DIMM module comes then with 256 UPMEM DRAM Processing Units (named DPU). The mapping algorithm implemented on the UPMEM architecture dispatches a huge index across the DPU memories. DNA sequences are assigned to a specific DPU according to k-mers features, allowing to massively map in parallel million of them. Experimentation on Human genome dataset shows that speed-up of 25 can be obtained with PIM, compared to fast mapping software such as BWA, Bowtie2 or NextGenMap running 16 Intel threads. Experimentation also highlight that data transfer from storage device limits the performances of the implementation. The use of SSD drives can boost the speed-up to 80.
Fichier principal
Vignette du fichier
RR-MAP_UPMEM_8923_June_2016.pdf (2.33 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01327511 , version 1 (06-06-2016)


  • HAL Id : hal-01327511 , version 1


Dominique Lavenier, Charles Deltel, David Furodet, Jean-François Roy. MAPPING on UPMEM. [Research Report] RR-8923, INRIA. 2016, pp.17. ⟨hal-01327511⟩
812 View
562 Download


Gmail Facebook X LinkedIn More