Events — Colloquia & Seminars
Cache-Oblivious Data Structures
Speaker: Michael A. Bender
Date: Tuesday, April 20, 2004
Talk: 11:00 AM, 149 cullinane
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.
Brief Biography
none provided