Julian Shun
Professor · MIT
Julian Shun is a Professor of Electrical Engineering and Computer Science at MIT whose research on parallel graph algorithms produced the Ligra graph framework.
- lectures
- 12
- series
- 1
- hours
- 15
Start here
Series and courses
MIT 6.172: Performance Engineering of Software Systems
In these lectures
- Cache-oblivious algorithms achieve optimal cache efficiency without hardcoding hardware cache parameters.Cache-Oblivious Algorithms
- Malloc is a fast library call optimized for small allocations using page-level re-use, while mmap is a heavyweight system call used for large or file-backed virtual memory regions.Parallel Storage Allocation
- Modern processors utilize a multi-level cache hierarchy where capacities increase and access speeds decrease moving from L1 to DRAM.Caching and Cache-Efficient Algorithms
Draws on
People cited in the lectures, at the moment of the citation.
- Matteo FrigoOriginal inspiration for some of the slides on heat diffusion.
- Sivan ToledoT97, cited for recursive LUP-Decomposition
- Bradley C. KuszmaulDeveloper of SuperMalloc.
- Gene M. AmdahlCited for Amdahl's Law limiting parallel speedup based on serial fractions.
- Ron Graham1968, published the theorem on greedy scheduler performance bounds.
- Patrick GelsingerIntel Developer's Forum, Intel Corporation, 2004. Cited for power density data.
Playlists
3About
Julian Shun is a Professor of Electrical Engineering and Computer Science at MIT whose research on parallel graph algorithms produced the Ligra graph framework. His MIT 6.172 lectures cover the ideal-cache model, cache-oblivious stencil algorithms, heap allocators such as Hoard and jemalloc, and graph optimization.
Taught with
Same subject, Computer Systems & Software
Connections
21Their places, courses, books and lectures.











