Cache optimized linear sieve
نویسندگان
چکیده
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.
منابع مشابه
Sieving Using Bucket Sort
This paper proposes a new sieving algorithm that employs a bucket sort as a part of a factoring algorithm such as the number field sieve. The sieving step requires an enormous number of memory updates; however, these updates usually cause cache hit misses. The proposed algorithm dramatically reduces the number of cache hit misses when the size of the sieving region is roughly less than the squa...
متن کاملFractal Prefetching B+trees: Optimizing Both Cache and Disk Performance (CMU-CS-02-115)
B-Trees have been traditionally optimized for I/O performance with disk pages as tree nodes. Recently, researchers have proposed new types of B-Trees optimized for CPU cache performance in main memory environments, where the tree node sizes are one or a few cache lines. Unfortunately, due primarily to this large discrepancy in optimal node sizes, existing disk-optimized B-Trees su er from poor ...
متن کاملExpansion and Improvement of Sieve and Application in Goldbach’s Problem
The modern sieve method began from Brun’s fundamental work in 1915. This remained the dominant work until 1941 when Ju. V. Linnik expanded on the sieve method. In 1947, A. Selberg advanced the sieve method by using his upper bound sieve. His sieve weights, are fundamentally different from Brun’s thus he brought a structural change into the sieve method. The linear sieve was developed by Rosser ...
متن کاملIs Cache Oblivious DGEMM a Viable Alternative?
We present an in-depth study of various implementations of DGEMM, using both the recursive and iterative programming styles. Recursive algorithms for DGEMM are usually cache-oblivious and they automatically block DGEMM’s operands A, B, C for the memory hierarchy. Iterative algorithms for DGEMM explicitly block A, B, C for the L1 cache, higher caches and memory. Our study shows that recursive DG...
متن کاملPerformance Comparison of Linear Sieve and Cubic Sieve Algorithms for Discrete Logarithms over Prime Fields
It is of interest in cryptographic applications to obtain practical performance improvements for the discrete logarithm problem over prime fields Fp with p of size ≤ 500 bits. The linear sieve and the cubic sieve methods described in Coppersmith, Odlyzko and Schroeppel’s paper [3] are two practical algorithms for computing discrete logarithms over prime fields. The cubic sieve algorithm is asym...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1111.3297 شماره
صفحات -
تاریخ انتشار 2011