[Colloq] Reminder - Michael Bender, Cache-Oblivious Searching - TODAY, April 20, 11AM

[Rachel Bates]

College of Computer and Information Science Colloquium and Algorithms
Reading Team (ART)

Presents

Michael A. Bender
SUNY Stony Brook & MIT

who will speak on:
Cache-Oblivious Searching


Tuesday, April 20, 2004
11:00am
149 Cullinane Hall
Northeastern University



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.