Models of parallel computations

  • Richard Lassaigne
  • Michel de Rougemont
Part of the Discrete Mathematics and Theoretical Computer Science book series (DISCMATH)


Sequential models such as the Turing machine or the RAM execute one transition or instruction per unit of time. In the models we introduce in this chapter, a polynomial number of transitions are followed per unit of time. We consider two models: boolean circuits and the PRAM (Parallel Random Access Machine), although there are many other possible models. Both circuits and PRAM assume synchronized elements which realize concurrent operations. Other models do not make this assumption and deal with distributed components.


Turing Machine Propositional Formula Program Counter Arithmetical Circuit Polynomial Size 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag London 2004

Authors and Affiliations

  • Richard Lassaigne
    • 1
  • Michel de Rougemont
    • 2
  1. 1.Maitre de ConferencesUniversity Paris VIIFrance
  2. 2.University Paris IIFrance

Personalised recommendations