Brackett-Rozinsky, Nevin et Lemire, Daniel (2025). Batched Ranged Random Integer Generation. Software: Practice and Experience, 55 (1). 10.1002/spe.3369
Fichier(s) associé(s) à ce document :![[thumbnail of Fast_batched_dice_rolls (1).pdf]](https://r-libre.teluq.ca/style/images/fileicons/pdf.png "Fast_batched_dice_rolls (1).pdf")
|
PDF
- Fast_batched_dice_rolls (1).pdf
Contenu du fichier : Manuscrit soumis (avant évaluation) Licence : Creative Commons CC BY. |
|
| Catégorie de document : | Articles de revues |
|---|---|
| Évaluation par un comité de lecture : | Oui |
| Étape de publication : | Publié |
| Résumé : | Pseudorandom values are often generated as 64-bit binary words. These random words need to be converted into ranged values without statistical bias. We present an efficient algorithm to generate multiple independent uniformly-random bounded integers from a single uniformly-random binary word, without any bias. In the common case, our method uses one multiplication and no division operations per value produced. In practice, our algorithm can more than double the speed of unbiased random shuffling for small to moderately large arrays. |
| Déposant: | Lemire, Daniel |
| Responsable : | Daniel Lemire |
| Dépôt : | 19 aout 2024 15:05 |
| Dernière modification : | 10 mars 2025 12:50 |
|
RÉVISER |
