CS Colloquium on Wednesday, Mar 17 at 3PM

Title: Cache-Oblivious B-Trees

Speaker:  Michael A. Bender
          SUNY, Stony Brook and MIT

Place: MCS 135, 111 Cummington Street (please see
       http://cs-www.bu.edu/colloquium for directions)

-------------------------------------------------------------------------  

Abstract:

We present recent developments in cache-oblivious search trees.
Cache-oblivious data structures and algorithms are platform independent,
achieving nearly optimal locality of reference simultaneously at every
granularity.  Thus, cache-oblivious data structures free the programmer
from the burden of tuning the code for cache and disk effects.  Because
cache-oblivious data structures optimize all levels of the memory
hierarchy, they hold the promise of outperforming traditional data
structures and algorithms.

Short Bio:

Michael A. Bender is an assistant professor of computer science at SUNY
Stony Brook and a visiting scientist at MIT.  His research interests
include analysis of algorithms, data structures, scheduling, parallel
computing, cache- and I/O efficient computing, and robot algorithms. He
has coauthored over 50 articles on these and other topics in computer
science. Professor Bender received his BA in Applied Mathematics from
Harvard University in 1992 and obtained a DEA in Computer Science from the
Ecole Normale Superieure de Lyon, France in 1993.  He completed a PhD on
Scheduling Algorithms from Harvard University in 1998.

-------------------------------------------------------------------------  

Host: John Byers (http://www.cs.bu.edu/~byers)