Artwork

Content provided by Iain Bethune and Iain Bethune (ibethune@exseed.ed.ac.uk). All podcast content including episodes, graphics, and podcast descriptions are uploaded and provided directly by Iain Bethune and Iain Bethune (ibethune@exseed.ed.ac.uk) or their podcast platform partner. If you believe someone is using your copyrighted work without your permission, you can follow the process outlined here https://player.fm/legal.
Player FM - Podcast App
Go offline with the Player FM app!

Prime numbers, large integer arithmetic and a 2PF task farm: Iain Bethune, EPCC (43 mins, ~21 MB)

43:00
 
Share
 

Manage episode 205984220 series 2307601
Content provided by Iain Bethune and Iain Bethune (ibethune@exseed.ed.ac.uk). All podcast content including episodes, graphics, and podcast descriptions are uploaded and provided directly by Iain Bethune and Iain Bethune (ibethune@exseed.ed.ac.uk) or their podcast platform partner. If you believe someone is using your copyrighted work without your permission, you can follow the process outlined here https://player.fm/legal.
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:
  continue reading

19 episodes

Artwork
iconShare
 
Manage episode 205984220 series 2307601
Content provided by Iain Bethune and Iain Bethune (ibethune@exseed.ed.ac.uk). All podcast content including episodes, graphics, and podcast descriptions are uploaded and provided directly by Iain Bethune and Iain Bethune (ibethune@exseed.ed.ac.uk) or their podcast platform partner. If you believe someone is using your copyrighted work without your permission, you can follow the process outlined here https://player.fm/legal.
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:
  continue reading

19 episodes

All episodes

×
 
Loading …

Welcome to Player FM!

Player FM is scanning the web for high-quality podcasts for you to enjoy right now. It's the best podcast app and works on Android, iPhone, and the web. Signup to sync subscriptions across devices.

 

Quick Reference Guide