On the importance of cache tuning in a cache-aware algorithm: A case study

Authors:
Péter Burcsi;Attila Kovács
Affiliations:
Department of Computer Algebra, Eötvös Loránd University, Budapest, Hungary;Department of Computer Algebra, Eötvös Loránd University, Budapest, Hungary
Venue:
Computers & Mathematics with Applications
Year:
2007

Citing 4
Cited 0

The input/output complexity of sorting and related problems

Communications of the ACM
Largest known twin primes and Sophie Germain primes

Mathematics of Computation
External memory algorithms and data structures: dealing with massive data

ACM Computing Surveys (CSUR)
Cache-Oblivious Algorithms

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.09

Visualization

Abstract

In the present paper we describe and analyse a sieving algorithm for determining prime numbers. This external memory algorithm contains several parameters which are related to the sizes of the levels in the memory hierarchy. We examine how we should choose the values of these parameters in order to obtain an optimal running time. We compare the running times obtained by varying the parameters. We conclude that in this specific problem fine tuning pays off as we got a speed-up of almost 40%.