Algorithms for Memory Hierarchies
March 10--14, 2002, Schloß Dagstuhl
About this seminar
Algorithms that have to process large data sets have to take into
account that the cost of memory accesses depends on where the accessed
data is stored. Traditional algorithms design is based on the von
Neumann model where accesses to memory have uniform cost. Actual
machines increasingly deviate from this model. While waiting for a
memory access, modern microproccessors can in principle execute 1000
additions of registers. For hard disk accesses this factor can reach
six orders of magnitude.
The goal of this seminar is to collect the main algorithmic
techniques used to achieve high performance on memory hierarchies.
The focus is on methods that are interesting both from a practical and
from a theoretical point of view.
Call for Participation
the tutorial and survey talks of the seminar have resulted
in an LNCS Tutorial volume.
About This Seminar Series
Since 1997 the
Gesellschaft für Informatik (GI)
organizes research seminars on current topics of computer science.
They are adressed at graduate students and recent PhDs
that actively want to learn about new developments.
Participants are mainly picked according to scientific qualification
and less by there special area of research in order to widely spread
new developments among academic institutions.
The maximal number of participants is usually limited to 20.
So far there were GI-Seminars on the following topics:
Peter Sanders, 6.6.01