DIMACS Theoretical Computer Science Seminar

Title: How to commercialize theoretical research and also some interesting math about memory hierarchies

Speaker: Martin Farach-Colton, Rutgers University

Date: Wednesday, November 12, 2008 11:00-12:00pm

Location: DIMACS Center, CoRE Bldg, Room 431, Rutgers University, Busch Campus, Piscataway, NJ


The Memory Hierarchy consists of all the parts of the memory subsystem of a computer, as well as algorithms for moving information around in memory, such as for caching and prefetching. Memory effects can easily dominate computation time in many settings, since memory accesses are typically so much slower than the other parts of a computation. However, explicitly optimizing code for memory effects can be a painstaking and specialized skill. I'll be presenting Cache-Oblivious Algorithmics, an approach for understanding memory and for writing high-performance memory-intensive code.