Learn · Performance Engineering of Software Systems
Lecture 22 of 23Lecture Videos1 h 19 min
Lecture 22: Graph Optimization
Prof. Charles Leiserson and Prof. Julian Shun · Massachusetts Institute of Technology
Credits and licence
- From
- Performance Engineering of Software Systems, Massachusetts Institute of Technology (at MIT OpenCourseWare)
- Licence
- CC BY-NC-SA 4.0, as MIT OpenCourseWare states it. Non-commercial use only.
- Attribution
- Prof. Charles Leiserson, Prof. Julian Shun. Performance Engineering of Software Systems. Fall 2018. Massachusetts Institute of Technology: MIT OpenCourseWare, https://ocw.mit.edu/. License: Creative Commons BY-NC-SA.
- Who can watch
- Tweens profiles and older. How courses are placed
All the lectures
- Lecture 1: Introduction and Matrix Multiplication
- Lecture 2: Bentley Rules for Optimizing Work
- Lecture 3: Bit Hacks
- Lecture 4: Assembly Language & Computer Architecture
- Lecture 5: C to Assembly
- Lecture 6: Multicore Programming
- Lecture 7: Races and Parallelism
- Lecture 8: Analysis of Multithreaded Algorithms
- Lecture 9: What Compilers Can and Cannot Do
- Lecture 10: Measurement and Timing
- Lecture 11: Storage Allocation
- Lecture 12: Parallel Storage Allocation
- Lecture 13: The Cilk Runtime System
- Lecture 14: Caching and Cache-Efficient Algorithms
- Lecture 15: Cache-Oblivious Algorithms
- Lecture 16: Nondeterministic Parallel Programming
- Lecture 17: Synchronization Without Locks
- Lecture 18: Domain Specific Languages and Autotuning
- Lecture 19: Leiserchess Codewalk
- Lecture 20: Speculative Parallelism & Leiserchess
- Lecture 21: Tuning a TSP Algorithm
- Lecture 22: Graph Optimization
- Lecture 23: High Performance in Dynamic Languages