Skip to main content
SpringerLink
Log in

Parallel pointer machines

  • Published:
computational complexity Aims and scope Submit manuscript

Abstract

The parallel pointer machine is a synchronous collection of finite state transducers, each transducer receiving its inputs via pointers to the other transducers. Each transducer may change its input pointers dynamically by “pointer jumping”. These machines provide a simple example of a parallel model with a time-varying processor inter-connection structure, and are sufficiently powerful to simulate deterministic spaceS(n) within timeO(S(n)).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Y. M. Barzdin andY. Y. Kalnin'sh, A universal automaton with variable structure,Automatic Control and Computing Sciences 8 (1974), 9–17. Russian journal title: Avtomatika i Vychislitel'naya Tekhnika.

    Google Scholar 

  2. A. Borodin, On relating time and space to size and depth,SIAM Journal on Computing 6 (1977), 733–744.

    Google Scholar 

  3. A. K. Chandra, D. C. Kozen, andL. J. Stockmeyer, Alternation,Journal of the ACM 28 (1981), 144–133.

    Google Scholar 

  4. A. K. Chandra and L. J. Stockmeyer, Alternation, in17th Annual Symposium on Foundations of Computer Science, Houston, TX, 1976, IEEE, 98–108. Preliminary Version.

  5. S. A. Cook, Towards a complexity theory of synchronous parallel computation,L'Enseignement Mathématique XXVII (1981), 99–124. Also in [23, pages 75–100].

    Google Scholar 

  6. P. W. Dymond,Simultaneous Resource Bounds and Parallel Computation, PhD thesis, University of Toronto, 1980. Technical Report 145/80.

  7. P. W. Dymond, On nondeterminism in parallel computation,Theoretical Computer Science 47 (1986), 111–120.

    Google Scholar 

  8. P. W. Dymond and S. A. Cook, Hardware complexity and parallel computation, in21st Annual Symposium on Foundations of Computer Science, Syracuse, NY, 1980, IEEE, 360–372.

  9. P. W. Dymond andS. A. Cook, Complexity theory of parallel time and hardware,Information and Computation 80 (1989), 205–226.

    Google Scholar 

  10. P. W. Dymond andW. L. Ruzzo, Parallel random access machines with owned global memory and deterministic context-free language recognition, inAutomata, Languages, and Programming: 13th International Colloquium, ed.Laurent, Kott, vol. 226 ofLecture Notes in Computer Science, Rennes, France, 1986, Springer-Verlag, 95–104.

    Google Scholar 

  11. S. E. Fahlman,NETL: A System for Representing and Using Real World Knowledge, MIT Press, 1979.

  12. S. Fortune and J. Wyllie, Parallelism in random access machines, inProceedings of the Tenth Annual ACM Symposium on Theory of Computing, San Diego, CA, 1978, 114–118.

  13. L. M. Goldschlager, A universal interconnection pattern for parallel computers,Journal of the ACM 29 (1982), 1073–1086.

    Google Scholar 

  14. M. T. Goodrich and S. R. Kosaraju, Sorting on a parallel pointer machine with applications to set expression evaluation, in30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, NC, 1989, IEEE, 190–195. Preliminary version.

  15. J. Hartmanis, P. M. Lewis, II, and R. E. Stearns, Hierarchies of memory limited computations, inConference Record on Switching Circuit Theory and Logical Design, Ann Arbor, MI, 1965, 179–190.

  16. W. D. Hillis,The Connection Machine, MIT Press, 1985.

  17. J. W. Hong, On similarity and duality of computation, in21st Annual Symposium on Foundations of Computer Science, Syracuse, NY, 1980, IEEE, 348–359. Appeared: [18].

  18. J. W. Hong, Similarity and duality in computation,Information and Control 62 (1984), 109–128.

    Google Scholar 

  19. J. E. Hopcroft and J. D. Ullman,Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, 1979.

  20. D. E. Knuth,Sorting and Searching, vol. 3 ofThe Art of Computer Programming, Addison-Wesley, 1973.

  21. A. N. Kolmogorov and V. A. Uspenskii, On the definition of an algorithm,Translations of the A.M.S. 27 (1957).

  22. T. W. Lam and W. L. Ruzzo, The power of parallel pointer manipulation, inProceedings of the 1989 ACM Symposium on Parallel Algorithms and Architectures, Santa Fe, NM, 1989, 92–102.

  23. Logic and Algorithmic, An International Symposium Held in Honor of Ernst Specker, Zürich, February 5–11, 1980. Monographie No. 30 de L'Enseignement Mathématique, Université de Genève, 1982.

  24. W. L. Ruzzo, Tree-size bounded alternation,Journal of Computer and System Sciences 21 (1980) 218–235.

    Google Scholar 

  25. W. L. Ruzzo, On uniform circuit complexity,Journal of Computer and System Sciences 22 (1981) 365–383.

    Google Scholar 

  26. A. Schönhage, Storage modification machines,SIAM Journal on Computing 9 (1980) 490–508.

    Google Scholar 

  27. L. J. Stockmeyer andU. Vishkin, Simulation of parallel random access machines by circuits,SIAM Journal on Computing 13 (1984) 409–422.

    Google Scholar 

  28. R. E. Tarjan, A class of algorithms which require nonlinear time to maintain disjoint sets,Journal of Computer and System Sciences 18 (1979) 110–127.

    Google Scholar 

  29. J. C. Wyllie,The Complexity of Parallel Computations, PhD thesis, Cornell University, Department of Computer Science, 1979. TR 79-387.

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Toronto, M5S 1A4, Toronto, Ontario, Canada

    Stephen A. Cook

  2. Department of Computer Science, York University, 4700 Keele Street, M3J 1P3, Toronto, Ontario, Canada

    Patrick W. Dymond

Authors
  1. Stephen A. Cook
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Patrick W. Dymond
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Cook, S.A., Dymond, P.W. Parallel pointer machines. Comput Complexity 3, 19–30 (1993). https://doi.org/10.1007/BF01200405

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01200405

Subject classification

Search

Navigation