because shift happens
explore parallel worlds
In a previous post I described iteration space partitioning as one way of improving cache residency of data. How much of a speedup does it deliver, really?
Matrix multiply is a good vehicle to illustrate the memory wall effect – the plots below show performance with increasing matrix dimension / storage layout combinations, for both the [...]
The first step in migrating a sequential program to parallel code almost always involves identifying opportunities for concurrency. “Almost”, because many useful applications are inherently data-parallel. The popularity of SPMD (single program, multiple data) grids is proof.
| T | F | S | S | M | T | W |
|---|---|---|---|---|---|---|
| « Aug | ||||||
| 1 | ||||||
| 2 | 3 | 4 | 5 | 6 | 7 | 8 |
| 9 | 10 | 11 | 12 | 13 | 14 | 15 |
| 16 | 17 | 18 | 19 | 20 | 21 | 22 |
| 23 | 24 | 25 | 26 | 27 | 28 | 29 |
| 30 | ||||||
© 2010 eigen.systems
Wordpress Themes by (DT)