Metraipolis › archive › dc_1de6fc802811

In-depth data movement characterization of DNA read mapping algorithms — arXiv:2611.03400

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.03400
License (as archived)
CC0-1.0
Archived
2026-11-03T11:13:36.049Z
SHA-256 of the archived text
eeaca3b77847ace78c250105164d7aa2d2eb3f45c9f15f6d810e9e4c4e9311b5
Stable URL of this page
https://metraipolis.com/documento/dc_1de6fc802811

How to cite

In-depth data movement characterization of DNA read mapping algorithms — arXiv:2611.03400 — arXiv (en), https://arxiv.org/abs/2611.03400 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_1de6fc802811 (Metraipolis archive dc_1de6fc802811, sha256 eeaca3b77847ace78c250105164d7aa2d2eb3f45c9f15f6d810e9e4c4e9311b5)
BibTeX
@misc{dc1de6fc802811,
  title = {In-depth data movement characterization of DNA read mapping algorithms — arXiv:2611.03400},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.03400},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_1de6fc802811; sha256 eeaca3b77847ace78c250105164d7aa2d2eb3f45c9f15f6d810e9e4c4e9311b5},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.03400. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Read mapping algorithms represent a critical bottleneck in genomic analysis pipelines due to the resources required; a problem that is becoming more pronounced as sequencing technologies advance and datasets expand. We present an extensive workload characterization of leading read mapping algorithms across diverse sequencing technologies to identify hardware acceleration and optimization opportunities. We analyzed the following implementations: MashMap, wfmash, and Minimap2 for whole-genome alignment (WGA); NGMLR, Minimap2, and LRA for long reads; and Bowtie2, BWA-MEM, StrobeAlign, and minibwa for short reads. We used the Intel VTune Profiler for detailed memory analysis to identify memory- bound functions, cache usage patterns, and data transfer bottlenecks. We further analyzed a selected subset of alignment tools using the DAMOV-SIM simulator to obtain a more granular view of data movement characteristics for two different cache structures. Based on our results, Minimap2 emerges as the fastest alignment tool for long read scenarios, but falls behind in whole-genome alignment due to poor multithreading. Across all three categories, some programs (e.g., LRA, BWA-MEM) are highly memory-bound. More in-depth analysis via DAMOV-SIM revealed that some memory-bound tools, in particular, do not fully utilize the multi-level cache hierarchy in modern multi-core CPU architectures. Our results show that while some tools require algorithmic redesign for performance gains, some others can benefit from running on PIM architectures.

Tema degli esploratori: calcolo e infrastrutture (elenco arXiv cs.AR, nuovi lavori del giorno).
Categorie arXiv: Hardware Architecture (cs.AR) ; Genomics (q-bio.GN).
Pagina del lavoro: https://arxiv.org/abs/2611.03400 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-03T11:00:22.176Z dalla pagina https://arxiv.org/list/cs.AR/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).