The I/O Complexity of Computing Prime Tables - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2016

The I/O Complexity of Computing Prime Tables


We revisit classical sieves for computing primes and analyze their performance in the external-memory model. Most prior sieves are analyzed in the RAM model, where the focus is on minimizing both the total number of operations and the size of the working set. The hope is that if the working set fits in RAM, then the sieve will have good I/O performance, though such an outcome is by no means guaranteed by a small working-set size. We analyze our algorithms directly in terms of I/Os and operations. In the external-memory model, permutation can be the most expensive aspect of sieving, in contrast to the RAM model, where permutations are trivial. We show how to implement classical sieves so that they have both good I/O performance and good RAM performance, even when the problem size N becomes huge—even superpolynomially larger than RAM. Towards this goal, we give two I/O-efficient priority queues that are optimized for the operations incurred by these sieves.
Fichier principal
Vignette du fichier
sieve.pdf (275.38 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01326317 , version 1 (03-06-2016)



Michael Bender, Rezaul Chowdhury, Alex Conway, Martín Farach-Colton, Pramod Ganapathi, et al.. The I/O Complexity of Computing Prime Tables. Latin American Theoretical Informatics Symposium, Apr 2016, Ensenada, Mexico. pp.192-206, ⟨10.1007/978-3-662-49529-2_15⟩. ⟨hal-01326317⟩
124 View
521 Download



Gmail Facebook Twitter LinkedIn More