Acceleration of multi-component multiple-precision arithmetic with branch-free algorithms and SIMD vectorization
Fuente:
arXiv
Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Preprint |
| Publié: |
2026
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866914536082112512 |
|---|---|
| author | Kouya, Tomonori |
| author_facet | Kouya, Tomonori |
| contents | Multiple-precision floating-point branch-free algorithms can significantly accelerate multi-component arithmetic implemented by combining hardware-based binary64 and binary32, particularly for triple- and quadruple-precision computations. In this study, we achieved benchmark results on x86 and ARM CPU platforms to quantify the accelerations achieved in linear computations and polynomial evaluation by integrating these algorithms. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_14926 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Acceleration of multi-component multiple-precision arithmetic with branch-free algorithms and SIMD vectorization Kouya, Tomonori Mathematical Software Numerical Analysis Multiple-precision floating-point branch-free algorithms can significantly accelerate multi-component arithmetic implemented by combining hardware-based binary64 and binary32, particularly for triple- and quadruple-precision computations. In this study, we achieved benchmark results on x86 and ARM CPU platforms to quantify the accelerations achieved in linear computations and polynomial evaluation by integrating these algorithms. |
| title | Acceleration of multi-component multiple-precision arithmetic with branch-free algorithms and SIMD vectorization |
| topic | Mathematical Software Numerical Analysis |
| url | https://arxiv.org/abs/2603.14926 |