12. Theory and Algorithms for Parallel Computation


Parallelism permeates all levels of current computing systems, from single CPU machines to large server farms. Effective use of parallelism relies crucially 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 interconnected. With the advent of multicore parallel machines, new models 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, distributed, multiprocessor and network computation
  • Models of parallel, distributed, multiprocessor and network computation
  • Emerging paradigms of parallel, distributed, multiprocessor and network computation
  • Models and algorithms for parallelism in memory hierarchies
  • Models and algorithms for real networks (scale-free, small world, wireless networks)
  • Theoretical aspects of routing
  • Deterministic and randomized parallel algorithms
  • Lower bounds for key computational problems

Topic committee

Global chair
Andrea Pietracaprina University of Padova Italy
Vice chair
Emmanuelle Lebhar CNRS France
Alex Tiskin University of Warwick UK
Local chair
Rob Bisseling Utrecht University Netherlands



August 25, 2009
0 days to go

Registration Logo

Registration is closed

Supported by

TU Delft Logo

PDS Logo

ACM Logo

Xtreem Logo