Artwork

Indhold leveret af Iain Bethune and Iain Bethune (ibethune@exseed.ed.ac.uk). Alt podcastindhold inklusive episoder, grafik og podcastbeskrivelser uploades og leveres direkte af Iain Bethune and Iain Bethune (ibethune@exseed.ed.ac.uk) eller deres podcastplatformspartner. Hvis du mener, at nogen bruger dit ophavsretligt beskyttede værk uden din tilladelse, kan du følge processen beskrevet her https://da.player.fm/legal.
Player FM - Podcast-app
Gå offline med appen Player FM !

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

43:00
 
Del
 

Manage episode 205984220 series 2307601
Indhold leveret af Iain Bethune and Iain Bethune (ibethune@exseed.ed.ac.uk). Alt podcastindhold inklusive episoder, grafik og podcastbeskrivelser uploades og leveres direkte af Iain Bethune and Iain Bethune (ibethune@exseed.ed.ac.uk) eller deres podcastplatformspartner. Hvis du mener, at nogen bruger dit ophavsretligt beskyttede værk uden din tilladelse, kan du følge processen beskrevet her https://da.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 episoder

Artwork
iconDel
 
Manage episode 205984220 series 2307601
Indhold leveret af Iain Bethune and Iain Bethune (ibethune@exseed.ed.ac.uk). Alt podcastindhold inklusive episoder, grafik og podcastbeskrivelser uploades og leveres direkte af Iain Bethune and Iain Bethune (ibethune@exseed.ed.ac.uk) eller deres podcastplatformspartner. Hvis du mener, at nogen bruger dit ophavsretligt beskyttede værk uden din tilladelse, kan du følge processen beskrevet her https://da.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 episoder

Alle episoder

×
 
Loading …

Velkommen til 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.

 

Hurtig referencevejledning

Lyt til dette show, mens du udforsker
Afspil