Algorithms for Big Data (COMPSCI 229r), Lecture 24

Algorithms for Big Data (COMPSCI 229r), Lecture 24 This lecture explores the cache-oblivious model, focusing on designing algorithms that perform efficiently without knowledge of system parameters like cache size or block size. The discussion includes practical applications for matrix multiplication and linked list management, emphasizing the use of recursive layouts and amortization to maintain optimal performance despite hardware variations.