Metraipolis › archive › dc_23996ead533a

Towards Enabling Distance-Based Memory Addressing — arXiv:2609.06270

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.06270
License (as archived)
CC0-1.0
Archived
2026-10-16T13:10:01.714Z
SHA-256 of the archived text
2a9ac5bbe3ec267f438db61a4b4cdd0b28ad1c7d864681facd28721c653c4b90
Stable URL of this page
https://metraipolis.com/documento/dc_23996ead533a

How to cite

Towards Enabling Distance-Based Memory Addressing — arXiv:2609.06270 — arXiv (en), https://arxiv.org/abs/2609.06270 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_23996ead533a (Metraipolis archive dc_23996ead533a, sha256 2a9ac5bbe3ec267f438db61a4b4cdd0b28ad1c7d864681facd28721c653c4b90)
BibTeX
@misc{dc23996ead533a,
  title = {Towards Enabling Distance-Based Memory Addressing — arXiv:2609.06270},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.06270},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_23996ead533a; sha256 2a9ac5bbe3ec267f438db61a4b4cdd0b28ad1c7d864681facd28721c653c4b90},
  year = {2026}
}

Archived text

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

Approximate Nearest-Neighbor Search (ANNS) in high dimensional vector datasets is an application of significant prevalence across different AI applications. However, such an operation is significantly bandwidth limited at large workingset sizes owing to the curse of dimensionality. Traditional indices used to accelerate ANNS rely on search-space pruning as a preprocessing step to alleviate such bandwidth requirement, but such optimization occurs either at the cost of increased bandwidth-inefficiency and/or degradation of search quality. This paper proposes a data-parallel hardware/software mechanism for performing large-scale similarity search in-memory. We propose a novel algorithm to simplify the computation requirement for similarity search across various distance metrics through lightweight primitives to perform a fast and approximate data-parallel brute-force search on the entire vector space. We further build a memory system capable of executing the required operations to generate a distance metric per datapoints, which is then used to enable pruning as a post-processing step. We offer adequate software support for user control over the proposed system. By enabling such search-space pruning as a post-processing step, we achieve near-perfect recall across representative workloads while achieving orders of magnitude performance and energy improvement over state-of-the-art algorithmic approaches on million and billion-scale workloads.

Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-09-09 in cs.AR).
Categorie arXiv: Hardware Architecture (cs.AR) ; Emerging Technologies (cs.ET).
Pagina del lavoro: https://arxiv.org/abs/2609.06270 — 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-10-16T13:02:36.876Z dalla pagina https://arxiv.org/catchup/cs.AR/2026-09-09?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).