Models of parallel computations
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.
KeywordsTuring Machine Propositional Formula Program Counter Arithmetical Circuit Polynomial Size
Unable to display preview. Download preview PDF.