Cache optimized linear sieve

Details Cache optimized linear sieve Cache optimized linear sieve

2011-11-14

arxiv.org/abs/1111.3297v1

Acta Univ. Sapientiae, Inform. 3,2 (2011) 205--223

Computer Science

Data Structures and Algorithms

Scientific paper

Sieving is essential in different number theoretical algorithms. Sieving with large primes violates locality of memory access, thus degrading performance. Our suggestion on how to tackle this problem is to use cyclic data structures in combination with in-place bucket-sort. We present our results on the implementation of the sieve of Eratosthenes, using these ideas, which show that this approach is more robust and less affected by slow memory.

Affiliated with

Also associated with

No associations

Rating

Cache optimized linear sieve does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Cache optimized linear sieve, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Cache optimized linear sieve will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-219039