Advertisement

Weak parallel machines: A new class of physically feasible parallel machine models

  • Juraj Wiedermann
Invited Lectures
Part of the Lecture Notes in Computer Science book series (LNCS, volume 629)

Abstract

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.

Keywords

Cellular Automaton Space Complexity Turing Machine Input Word Input Tape 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Aho, A.V.-Hopcroft, J.E.-Ullman, J.D.: The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Mass., 1974zbMATHGoogle Scholar
  2. [2]
    Chazelle, B.-Monier, L.: Unbounded Hardware is Equivalent to Deterministic Turing Machine. Theoretical Computer Science 24 (1983), pp. 123–130zbMATHMathSciNetCrossRefGoogle Scholar
  3. [3]
    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
  4. [4]
    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
  5. [5]
    Hopcroft, J.E.-Ullman, J.D.: Formal Language and Their Relation to Automata. Addison-Wesley, Reading, Mass., 1969Google Scholar
  6. [6]
    Mead, C.-Conway, L.: Introduction to VLSI Systems. Addison-Wesley, Reading, Mass., 1980, 396 p.Google Scholar
  7. [7]
    Schorr, A.: Physical Parallel Devices Are not Much Faster Than Sequential Ones. Information Processing Letters, Vol. 17, 1983, pp. 103–106zbMATHMathSciNetCrossRefGoogle Scholar
  8. [8]
    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
  9. [9]
    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
  10. [10]
    Vitanyi, P.M.B.: Archirithmic or Algotecture? In: CWI Monographs No. 4, 1986Google Scholar
  11. [11]
    Wagner, K.-Wechsung, G.: Computational Complexity. VEB Deutscher Verlag der Wissenschaften, Berlin, 1986, 551 p.zbMATHGoogle Scholar
  12. [12]
    Wolfram, S.: Theory and Applications of Cellular Automata. World Scientific, Singapore, 1986, 560 p.zbMATHGoogle Scholar
  13. [13]
    Wiedermann, J.: Parallel Turing Machines. Research Report, RUU-CS-84-11, November 1984, Rijksuniversiteit Utrecht, 1984Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Juraj Wiedermann
    • 1
  1. 1.INFOSTAT-Institute of Informatics and StatisticsBratislavaCzechoslovakia

Personalised recommendations