Weak parallel machines: A new class of physically feasible parallel machine models
Weak parallel machines represent a new class of physically feasible parallel machine models whose prominent representative is the so-called Parallel Turing Machine (PTM) as introduced by the author in 1984. Except PTMs, further members of this class are e.g. various kinds of systolic machines, cellular automata, orthogonal iterative arrays, etc. From the computational point of view the main common feature of weak parallel machines is their ability to perform pipelined computations efficiently, what is used in characterizing the corresponding machine class by so—called Pipelined Computation Thesis. This thesis states that on these machines the period of computation is polynomially related to the space of sequential Turing machine computations.
The paper gives a brief overview of the most important known results concerning PTMs and extends them by new results stressing the significance of PTMs in the context of physically feasible parallel computations.
KeywordsCellular Automaton Space Complexity Turing Machine Input Word Input Tape
Unable to display preview. Download preview PDF.
- Cook, S.A.: Towards a Complexity Theory of Synchronous Parallel Computations. L'Enseignement Mathématique, IIe Serie, Tome XXVII-Fascicule 1–2, pp. 99–124, 1981Google Scholar
- Gruska, J.: Systolic Automata — Power, Characterization, Nonhomogeneity, in: Michal Chytil (Editor), Mathematical Foundations of Computer Science 1984, Springer Lecture Notes in Computer Science, Vol. 176, 1984Google Scholar
- Hopcroft, J.E.-Ullman, J.D.: Formal Language and Their Relation to Automata. Addison-Wesley, Reading, Mass., 1969Google Scholar
- Mead, C.-Conway, L.: Introduction to VLSI Systems. Addison-Wesley, Reading, Mass., 1980, 396 p.Google Scholar
- van Emde Boas, P.: Machine Models and Simulations. In: J. van Leeuwen, (ed.), Handbook of Theoretical Computer Science, Vol. I, North Holland, Amsterdam, 1989Google Scholar
- van Leeuwen,J.: Distributed Computing. In: J.W. de Bakker and J. van Leeuwen (eds.), ”Foundations of Computer Science IV”, Mathematical Centre Tracts Vol. 158, Amsterdam, 1983, pp. 1–34Google Scholar
- Vitanyi, P.M.B.: Archirithmic or Algotecture? In: CWI Monographs No. 4, 1986Google Scholar
- Wiedermann, J.: Parallel Turing Machines. Research Report, RUU-CS-84-11, November 1984, Rijksuniversiteit Utrecht, 1984Google Scholar