Campus Event Calendar
Event Entry
New for: D3
What and Who
Towards a theory of cache efficient algorithms
Sandeep Sen
IIT Delhi
AG1 Mittagsseminar (own work)
AG 1, AG 2, AG 3, AG 4
AG Audience
-- Not specified --
Note: We use this to send email in the morning.
Date, Time and Location
Friday, 15 June 2001
13:30
60 Minutes
Warning: Date has changed!
Warning: Time has changed!
46
024
Saarbrücken
Abstract
We present a simple computational model that captures some salient
features of the cache, especially limited associativity. We extend
the results of the I-O model to this framework by an efficient
simulation that yields asymptotically optimal algorithms for many basic
problems like sorting, FFT, permutation etc. in the cache model.
We also present some extensions for the multilevel caches.
Contact
Peter Sanders
--email hidden
passcode not visible
logged in users only