Topic 12

Theory and algorithms for parallel computation


Parallelism exists at all levels in computing systems from single CPU machines to large sever farms. Effective use of parallelism crucially relies on the availability of suitable models of computation for algorithm design and analysis, and of efficient strategies for the solution of key computational problems on prominent classes of platforms as well as of good models of the way the different components are connected. With the advent of multicore parallel machines (possibly on different sites), new problems and paradigms are needed to allow parallel programming to advance into mainstream computing. High quality papers are solicited, contributing new results on foundational issues of parallelism in computing and/or proposing improved approaches for the solution of specific algorithmic problems. Topics of interest include, but are not limited to, the following:


  • Foundations of parallel and multiprocessor computing (PRAM, cellular automata, DNA computing, self-assembling tiles...)
  • Models of parallel and multiprocessor computation
  • Models and algorithm for real networks (scale-free networks, small world, wireless network, search & cache algorithms)
  • Emerging paradigms of parallel and multiprocessor computation
  • Deterministic, randomized, or approximation parallel and concurrent algorithms
  • Lower bounds for key computational problems
  • Key algorithmic issues in multiprocessor synchronization (such as transactional memory and parallel/concurrent data structures)


Global Chair Local Chair
Nir Shavit
Computer Science Department
Tel-Aviv University
Ramat Aviv, Israel
Nicolas Schabanel
Centro de Modelamiento Matemático CMM
UMI CNRS - Universidad de Chile
Santiago de Chile, Chile
Vice Chair Vice Chair
Pascal Felber
University of Neuchatel
Institut d'informatique
Neuchâtel, Swizerland
Christos Kaklamanis
Department of Computer Engineering and Informatics
University of Patras, Rio, Greece