Skip to content
Hallway
0:00 / 0:00

#cache-obliviousalgorithms#searching#sorting

24. Cache-Oblivious Algorithms: Searching & Sorting

MIT OpenCourseWare

6.5M subscribers • 43 videos on Hallway • University channel

YouTube
  • Recommended by 1 person: 1 in engineering communities.
  • Presented by Erik Demaine, Professor at MIT

Advanced. Deep dive for people who know the field.

22K views10 years ago1 recommendation

Computer scienceSystems programmingAlgorithmsPerformance and optimizationMemory management

Erik Demaine continues his lecture on cache-oblivious algorithms, focusing on their applications in searching and sorting.

MIT 6.046J Design and Analysis of Algorithms, Spring 2015 View the complete course: ocw.mit.edu/6-046JS15 Instructor: Erik Demaine In this lecture, Professor Demaine continues with cache-oblivious algorithms, including their applications in searching and sorting. License: Creative Commons BY-NC-SA More information at ocw.mit.edu/terms More courses at ocw.mit.edu

Why it's here

1 person recommends this

What people say. Recommended as an academic resource on cache-oblivious algorithms to help design systems with high cache locality.

u/valarauca13in r/rust • Recommends

On “Learning resources for lock-free and wait-free data structures”

…-semantics 5. https://preshing.com/20120930/weak-vs-strong-memory-models 6. https://preshing.com/20121019/this-is-why-they-call-it-a-weakly-ordered-cpu These videos are also worth checking out as they cover the academic approach to cache oblivious algorithms. Which are useful when designing lock free systems as it ensures high cache locality. 1. link to this video 2. link to this video 3. link to this video 4. link to this video 5. link to this video…
28View on Reddit