Prime Numbers, Large Integer Arithmetic And A 2PF Task Farm: Iain Bethune, EPCC (43 Mins, ~21 MB) EPCC Guest Lectures podcast

Artwork

Higher Education Podcasting Education Iain Bethune Iain Bethune (ibethune@exseed.ed.ac.uk EPCC University Of Edinburgh

内容由Iain Bethune and Iain Bethune (ibethune@exseed.ed.ac.uk)提供。所有播客内容（包括剧集、图形和播客描述）均由 Iain Bethune and Iain Bethune (ibethune@exseed.ed.ac.uk) 或其播客平台合作伙伴直接上传和提供。如果您认为有人在未经您许可的情况下使用您的受版权保护的作品，您可以按照此处概述的流程进行操作https://zh.player.fm/legal。

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

13y ago 43:00

分享

MP3•单集首页

内容由Iain Bethune and Iain Bethune (ibethune@exseed.ed.ac.uk)提供。所有播客内容（包括剧集、图形和播客描述）均由 Iain Bethune and Iain Bethune (ibethune@exseed.ed.ac.uk) 或其播客平台合作伙伴直接上传和提供。如果您认为有人在未经您许可的情况下使用您的受版权保护的作品，您可以按照此处概述的流程进行操作https://zh.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:

Talk slides

… continue reading

19集单集

#Higher Education #Podcasting Education #Iain Bethune #Iain Bethune (ibethune@exseed.ed.ac.uk #EPCC #University Of Edinburgh

Artwork

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

EPCC Guest Lectures

published 13y ago

分享

MP3•单集首页

内容由Iain Bethune and Iain Bethune (ibethune@exseed.ed.ac.uk)提供。所有播客内容（包括剧集、图形和播客描述）均由 Iain Bethune and Iain Bethune (ibethune@exseed.ed.ac.uk) 或其播客平台合作伙伴直接上传和提供。如果您认为有人在未经您许可的情况下使用您的受版权保护的作品，您可以按照此处概述的流程进行操作https://zh.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:

Talk slides

… continue reading

19集单集

#Higher Education #Podcasting Education #Iain Bethune #Iain Bethune (ibethune@exseed.ed.ac.uk #EPCC #University Of Edinburgh

所有剧集

×

欢迎使用Player FM

Player FM正在网上搜索高质量的播客，以便您现在享受。它是最好的播客应用程序，适用于安卓、iPhone和网络。注册以跨设备同步订阅。

收听超过500个主题