Data sets in large applications are often too massive to fit completely inside the computer's internal memory. The resulting input/output communication (or I/O) between fast internal memory and slower external memory (such as disks) can be a major performance bottleneck. During the last decade a major body of research has been devoted to the development of efficient external memory algorithms, where the goal is to exploit locality in order to reduce the I/O costs. This summer school will survey the state of the art in the design and analysis of external memory algorithms and data structures.
The lecturers and the main topics to be covered at the summer school are:
| Lars Arge, Duke University | - Computational geometry |
| Erik D. Demaine, MIT | - Cache oblivious algorithms and data structures |
| Paolo Ferragina, University of Pisa | - String algorithms and data structures |
| Jeff Vitter, Duke University | - Sorting, searching, parallel disks |
| Norbert Zeh, Duke University | - Graph algorithms |
The European Educational Forum (EEF) is a joint initiative of European interuniversitary research schools in computer science, and involves 32 universities in Denmark, Finland, France, Germany, Italy, The Netherlands, and the United Kingdom. The summer school is organised as a part of the EEF foundations series of summer schools, and is supported by the European Commission and BRICS. The summer school will be held at the Department of Computer Science, University of Aarhus.
Updated information about the summer school will be available on the home page of the summer school at http://www.brics.dk/MassiveData02/.
Questions concerning the summer school should be directed to
Summer School on Massive Data Sets
Att.: Gerth S. Brodal
BRICS, Department of Computer Science
University of Aarhus
DK - 8000 Aarhus C
Denmark
Phone: (+45) 8942 3200
Fax: (+45) 8942 3255
E-mail: MassiveData02@brics.dk