Sign up to save your podcasts
Or
Share Prime numbers, large integer arithmetic and a 2PF task farm: Iain Bethune, EPCC (43 mins, ~21 MB)
Share to email
Share to Facebook
Share to X
Share to email
Share to Facebook
Share to X
Or
Prime numbers, large integer arithmetic and a 2PF task farm: Iain Bethune, EPCC (43 mins, ~21 MB)
We will review some basic properties and theorems regarding prime numbers, and take a quick trip through the history of prime number searching. Secondly, we will discuss two classes of algorithms of importance for computational primality testing - Sieving and the Lucas-Lehmer (and similar) tests - and their implementations on modern CPUs and GPUs. Finally, we will introduce GIMPS and PrimeGrid, two large and well-known distributed prime search projects.
Links:
View all episodes
By Iain Bethune ([email protected])We will review some basic properties and theorems regarding prime numbers, and take a quick trip through the history of prime number searching. Secondly, we will discuss two classes of algorithms of importance for computational primality testing - Sieving and the Lucas-Lehmer (and similar) tests - and their implementations on modern CPUs and GPUs. Finally, we will introduce GIMPS and PrimeGrid, two large and well-known distributed prime search projects.
Links:
More shows like EPCC Guest Lectures
View all
The University of Edinburgh: The University of Edinburgh
0 Listeners
Gifford Lectures (audio)
1 Listeners
Edinburgh Film Podcast
1 Listeners
Medical Detectives (audio)
5 Listeners
250 Years of English Literature
3 Listeners
The Tartan Tardigrade - Astrobiology Chats
2 Listeners
David Hume: Celebrating Connections (audio)
0 Listeners
Teaching Matters Podcast
0 Listeners
Scottish Feminist Judgments Podcast
1 Listeners
The Synthetic Biology Podcast
1 Listeners