Algorithm Engineering for the Basic Toolbox
- Ansprechperson:
V. Osipov, J. Singler, P. Sanders
- Förderung:
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
Titel | Tagung | Autoren | Datum |
---|---|---|---|
Building A Parallel Pipelined External Memory Algorithm Library | IEEE International Parallel & Distributed Processing Symposium (IPDPS) |
A. Beckmann, R. Dementiev, J. Singler |
Mai 2009 |
MCSTL: The Multi-Core Standard Template Library | Euro-Par 2007 |
J. Singler, P. Sanders, F. Putze |
August 2007 |
Parallelization of Bulk Operations for STL Dictionaries |
Workshop on Highly Parallel Processing on a Chip (HPPC) |
L. Frias, J. Singler |
August 2007 |
Single-Pass List Partitioning | International Workshop on Multi-Core Computing Systems (MuCoCoS) 2008 | L. Frias, J. Singler, P. Sanders |
März 2008 |
Scalable Distributed-Memory External Sorting | International Conference on Data Engineering (ICDE) |
M. Rahn, P. Sanders, J. Singler |
März 2010 |
STXXL: Standard Template Library for XXL Data Sets | 13th Ann. European Symposium on Algorithms (ESA) | R. Dementiev, L. Kettner, P. Sanders | Oktober 2005 |
The Filter-Kruskal Minimum Spanning Tree Algorithm | ALENEX 2009 |
V. Osipov, P. Sanders, J. Singler |
January 2009 |