Introduction -1.1 Introduction
Why I/O-efficient Algorithms
()
Introduction -1.2 The basic I/O-model
The basic I/O-model
()
Introduction -1.3 Analyzing algorithms in the I/O-model
Analyzing algorithms in the I/O-model
()
Introduction -1.4 Analyzing algorithms in the I/O-model, II
Analyzing algorithms in the I/O-model, II
()
Introduction -1.5 Cache-aware versus cache-oblivious algorithms
Cache-aware versus cache-oblivious algorithms
()
Introduction -1.6 Quiz
Course notes 1.1 and 1.2
Designing cache-aware and cache-oblivious algorithms-2.1 The matrix-transposition problem
The matrix-transposition problem
()
Designing cache-aware and cache-oblivious algorithms-2.2 A cache-aware algorithm for matrix transposition
A cache-aware algorithm for matrix transposition
()
Designing cache-aware and cache-oblivious algorithms-2.3 A cache-oblivious algorithm for matrix transposition
A cache-oblivious algorithm for matrix transposition
()
Designing cache-aware and cache-oblivious algorithms-2.4 Quiz
Course notes 1.3
Replacement Policies-3.1 Replacement Policies
Replacement Policies
()
Replacement Policies-3.2 Quiz
Course notes 1.4
I/O-efficient sorting-4.1 I/O-Efficient sorting, I
I/O-Efficient sorting, I
()
I/O-efficient sorting-4.2 I/O-Efficient sorting, II
I/O-Efficient sorting, II
()
I/O-efficient sorting-4.3 Quiz
Course notes chapter 2
I/O-efficient data structures-5.1 Efficient searching I: B-Trees
Efficient searching I: B-Trees
()
I/O-efficient data structures-5.2 Efficient searching II: Buffer Trees
Efficient searching II: Buffer Trees
()
I/O-efficient data structures-5.3 I/O-Efficient Priority queues
I/O-Efficient Priority queues
()
I/O-efficient data structures-5.4 Quiz
Course notes 3.1
Time-Forward Processing-6.1 Evaluating local functions on a dag
Evaluating local functions on a DAG
()
Time-Forward Processing-6.2 Evaluating local function on a dag: I/O-analysis
Evaluating local function on a DAG: I/O-analysis
()
Time-Forward Processing-6.3 Time-forward processing
Time-forward processing
()
Time-Forward Processing-6.4 Computing maximal independent sets
Computing maximal independent sets
()
Time-Forward Processing-6.5 Quiz
Course notes 3.2