Topic 10: Theory and Algorithms for Parallel Computation
1 Description
Parallelism permeates all levels of current computing systems. Hence, most performance critical applications now need efficient and scalable parallel algorithms at their heart. This is currently causing a renaissance in the study of parallel algorithms and their underlying machine models and theoretical foundations.
High quality, original papers are solicited which contribute new results on parallel algorithms, computational models, and their theoretical foundations.
2 Focus
- Parallel algorithm for graphs, geometrical data, strings etc.
- Parallel data structures
- Parallel streaming algorithms
- Communication algorithms for networks
- Parallel memory hierarchies
- Communication efficient algorithms
- Algorithms for GPUs and accelerators
- Exascale algorithms
- Energy-efficient parallel algorithms
- Fault-tolerant parallel algorithms
- Algorithmic challenges stemming from particular applications
- Algorithms and models for big data parallel processing
- Foundations, models, and emerging paradigms for parallel, distributed, multiprocessor and network computation
- Parallel complexity theory
- Lower bounds for parallel computation
3 Topic Committee
3.1 Global chair
- Peter Sanders, KIT, Germany
3.2 Local chair
- Robert Elsässer, University of Salzburg, Austria
3.3 Additional members
- Leah Epstein, University of Haifa, Israel
- Pierre Fraigniaud, Université Paris Diderot - Paris 7, France
- Geppino Pucci, University of Padua, Italy
