Prime numbers, large integer arithmetic and a 2PF task farm: Iain Bethune, EPCC (43 mins, ~21 MB)
Listen now
Description
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:
Talk slides
More Episodes
Bioinformatics and more widely Computational Biology is a largely data-driven Science. The array of high-throughput technology platforms in the last 10 years mean that the amount of data being generated in this field is likely to enter into Exabytes by 2020. The challenges associated with this...
Published 03/21/14
Performing complex solar shading analysis to take into account the sun's path and solar penetration on large buildings has historically consumed very many CPU cycles for IES "Virtual Environment" (3D building physics) simulation users. One particularly complex model took almost 2 weeks to...
Published 03/14/14
Intel will provide an insight into future HPC technology development looking at hardware trends, ecosystem support and the challenges around ExaScale computing.
The talk will also touch upon the convergence of High Performance Computing and High Performance Data Analytics, examining where the...
Published 02/28/14
Links
Twitter
Facebook
Instagram
Patreon
Genres
Artwork or description wrong?
Request an update »
Updates may take a few minutes.
Do you host a podcast?
Track your ranks and reviews from Spotify, Apple Podcasts and more.
