Topic 12 Theory and Algorithms for Parallel Computation

  • Nir Shavit
  • Nicolas Schabanel
  • Pascal Felber
  • Christos Kaklamanis
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4641)

Abstract

Theory of parallel computation is still a widely unanswered field of research. The lack of truly parallel data structures (such as quantum computing may provide one day) still prevents us from obtaining a unified framework for the design of parallel algorithms, and the design of parallel algorithms remains a case-by-case challenge. As the complexity-related questions have been progressively (and regrettably) abandoned, theoretical research in parallel computing focuses today on two main areas: the classical design of parallel algorithms for specific problems; and very recently, modeling, understanding and formalizing how entities/structures/networks interact in parallel in order to design better parallel algorithms.

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Nir Shavit
  • Nicolas Schabanel
  • Pascal Felber
  • Christos Kaklamanis

There are no affiliations available

Personalised recommendations