Topic
This project addresses algorithm engineering for basic algorithms and data structures that are the most important building blocks for many computer applications — sorting, searching, graph traversal,. . . . Although this topic is as old as computers science itself, many interesting new results have appeared in recent years and many gaps between theory and practice remain. In particular, many interesting approaches have not been thoroughly tried experimentally. Ever more complex hardware with memory hierarchies and several types of parallel processing requires refined models, new algorithms, and efficient implementations. We plan to incorporate the most successful implementations into reusable software libraries such as the the C++ STL.
Excerpt from the proposal
Excerpt from the proposal
Title | Author(s) | Conference |
---|---|---|
Parallelization of Bulk Operations for STL Dictionaries | L. Frias, J. Singler |
Workshop on Highly Parallel Processing on a Chip (HPPC) |
Single-Pass List Partitioning | L. Frias, J. Singler, P. Sanders |
International Workshop on Multi-Core Computing Systems (MuCoCoS) 2008 |
Scalable Distributed-Memory External Sorting | M. Rahn, P. Sanders, J. Singler |
International Conference on Data Engineering (ICDE) |
Building A Parallel Pipelined External Memory Algorithm Library | A. Beckmann, R. Dementiev, J. Singler |
IEEE International Parallel & Distributed Processing Symposium (IPDPS) |
MCSTL: The Multi-Core Standard Template Library | J. Singler, P. Sanders, F. Putze |
Euro-Par 2007 |
The Filter-Kruskal Minimum Spanning Tree Algorithm | V. Osipov, P. Sanders, J. Singler |
ALENEX 2009 |
STXXL: Standard Template Library for XXL Data Sets | R. Dementiev, L. Kettner, P. Sanders | 13th Ann. European Symposium on Algorithms (ESA) |