10 years of meataxe development.
54 mins 16 secs,
789.57 MB,
MPEG-4 Video
640x360,
30.0 fps,
44100 Hz,
1.93 Mbits/sec
Share this media item:
Embed this media item:
Embed this media item:
About this item
| Description: |
Parker, R
Tuesday 28th January 2020 - 16:05 to 16:55 |
|---|
| Created: | 2020-01-28 17:01 |
|---|---|
| Collection: | Groups, representations and applications: new perspectives |
| Publisher: | Isaac Newton Institute |
| Copyright: | Parker, R |
| Language: | eng (English) |
| Distribution: |
World
(downloadable)
|
| Explicit content: | No |
| Aspect Ratio: | 16:9 |
| Screencast: | No |
| Bumper: | UCS Default |
| Trailer: | UCS Default |
| Abstract: | Myself, Steve Linton and Jon Thackray have been working for nearly 10 years on a fairly major overhaul of matrix multiplication and Gaussian elimination over finite fields of order (mainly) up to 1,000 or so, aiming to make good use of modern processors - specifically the ubiquitous x86-64 from Intel and AMD. With clock speeds approaching a plateau we now need to use multiple cores, utilize the various levels of cache to reduce memory bandwidth demands, use the vector registers and avoid unpredictable branches, but by doing all of these, speed improvements in excess of a factor of 100 are readily obtained over the methods of a couple of decades ago. This talk will explain some of the changes in technique that are needed to achieve this - both algorithmic and technological - that seem quite radical at the moment, but which I expect to become more mainstream in future. |
|---|---|
Available Formats
| Format | Quality | Bitrate | Size | |||
|---|---|---|---|---|---|---|
| MPEG-4 Video * | 640x360 | 1.93 Mbits/sec | 789.57 MB | View | Download | |
| WebM | 640x360 | 575.54 kbits/sec | 228.83 MB | View | Download | |
| iPod Video | 480x270 | 522.1 kbits/sec | 207.52 MB | View | Download | |
| MP3 | 44100 Hz | 249.75 kbits/sec | 99.39 MB | Listen | Download | |
| Auto | (Allows browser to choose a format it supports) | |||||