arXiv Open Access 2023

Memory Efficient Multithreaded Incremental Segmented Sieve Algorithm

Evan Ning David Kaeli

Lihat Sumber

Abstrak

Prime numbers are fundamental in number theory and play a significant role in various areas, from pure mathematics to practical applications, including cryptography. In this contribution, we introduce a multithreaded implementation of the Segmented Sieve algorithm. In our implementation, instead of handling large prime ranges in one iteration, the sieving process is broken down incrementally, which theoretically eliminates the challenges of working with large numbers, and can reduce memory usage, providing overall more efficient multi-core utilization over extended computations.

Topik & Kata Kunci

cs.PF cs.DC

Penulis (2)

Evan Ning

David Kaeli

Format Sitasi

APA MLA BibTeX

Ning, E., Kaeli, D. (2023). Memory Efficient Multithreaded Incremental Segmented Sieve Algorithm. https://arxiv.org/abs/2310.17746

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2023
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓