Episode 5.14 - Example of Cache-Oblivious Recursion
Table of Contents:
00:04 - Quick review: matrix-vector multiplication problem
00:12 - Tiling solution
00:19 - Previous performance results
00:28 - Data access pattern
00:42 - Code explanation
00:43 - Accessing matrix A
00:49 - Accessing vector b
00:59 - Reading vector b multiple times
01:10 - Loop swap
01:42 - Recursive approach
01:48 - Algorithm explanation
02:16 - The idea behind recursive spit
02:24 - What if we overspilt the matrix
02:30 - Accuracy of choosing threshold (tile) parameter
02:44 - Using fork-join parallelism with recursive cache-oblivious algorithms
02:55 - What data locality is important for matrix-vector multiplication?
03:14 - Implementation with #pragma omp task
03:22 - Function arguments
03:54 - Threshold check
04:10 - Recursive function call
04:45 - xeonphi.com/papers/transposition
04:54 - Performance results
05:13 - http://supertech.csail.mit.edu/papers...
05:14 - http://www.cc.gatech.edu/~bader/COURS...