Skip to main content
SpringerLink
Log in
Book cover

International Conference on Fundamentals of Computation Theory

FCT 1985: Fundamentals of Computation Theory pp 257–268Cite as

Array processing machines

  • Conference paper
  • First Online:

  • 111 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 199))

Abstract

We present a new model of parallel computation called the "array processing machine" or APM. The APM was designed to closely model the architecture of existing vector- and array processors, and to provide a suitable unifying framework for the complexity theory of parallel combinatorial and numerical algorithms.

(Extended Abstract)

This work was carried out while the second author was visiting the Dept. of Computer Science, University of Utrecht, the Netherlands (Fall 1984).

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aho, A.V., J.E. Hopcroft, and J.D. Ullman, The design and analysis of computer algorithms, Addision-Wesley Publ. Comp., Reading, Mass., 1974.

    Google Scholar 

  2. Chandra, A.K., D.C. Kozen, and L.J. Stockmeyer, Alternation, J. ACM 28(1981) 114–133.

    Google Scholar 

  3. Chazelle, B., and L. Monier, Unbounded hardware is equivalent to deterministic Turing machines, Theor. Comput. Sci. 24(1983) 123–130.

    Google Scholar 

  4. Cook, S.A., the classification of problems which have fast parallel algorithms, Proc. FCT'83, Springer Lecture Notes in Comput. Sci. 158(1983) 78–93.

    Google Scholar 

  5. Cook, S.A., and R.A. Reckhow, Time-bounded random access machines, J. Comput. Syst. Sci. 7(1973) 354–375.

    Google Scholar 

  6. Engeler, E., Introduction to the theory of computation, Acad. Press, New York, NY, 1973.

    Google Scholar 

  7. Flynn, M.J., Some computer organisations and their effectiveness, IEEE Trans. Comput. C-21(1972) 948–960.

    Google Scholar 

  8. Fortune, S., and J. Wyllie, Parallelism in random access machines, Proc. 10th ACM Sympos. Theory of Comput, San Diego, 1978, pp. 89–94.

    Google Scholar 

  9. Goldschlager, L.M., A universal interconnection pattern for parallel computers, J. ACM 29(1982) 1073–1086.

    Google Scholar 

  10. Hartmanis, J., and J. Simon, On power of multiplication in random access machines, Proc. 15th Ann. IEEE Sympos. Switching and Automata Theor., New Orleans, 1974, pp. 13–23.

    Google Scholar 

  11. Hockney, R.W., and C.R. Jesshope, Parallel computers, Hilger, Bristol, 1981.

    Google Scholar 

  12. Hwang, K., S.P. Su, and L.M. Ni, Vector computer architecture and processing techniques, in: M.C. Yovits (ed.), Advances in Computers, vol 20, Acad. Press, New York, NY, 1981, pp. 115–197.

    Google Scholar 

  13. Knuth, D.E., The art of computer programming, vol3: sorting and searching, Addison-Wesley Publ. Comp., Reading, Mass., 1975.

    Google Scholar 

  14. Pratt, V.R., and L.J. Stockmeyer, A characterization of the power of vector machines, J. Comput. Syst. Sci. 12(1976) 198–221.

    Google Scholar 

  15. Ruzzo, W.L., On uniform circuit complexity, J. Comput. Syst. Sci. 22(1981) 365–383.

    Google Scholar 

  16. Savitch, W.J., Parallel random access machines with powerful instruction sets, Math. Syst. Theor. 15(1982) 191–2210.

    Google Scholar 

  17. Savitch, W.J., and M.J. Stimson, Time-bounded random access machines with parallel processing. J. ACM 26(1979) 103–118.

    Google Scholar 

  18. Schorr, A., Physical parallel devices are not much faster than sequential ones, Inf. Proc. Lett. 17(1983) 103–106.

    Google Scholar 

  19. Stockmeyer, L.J., and U. Vishkin, Simulation of parallel random access machines by circuits, SIAM J. Comput. 13(1984) 409–422.

    Google Scholar 

  20. Stone, H.S. Parallel processing with the perfect shuffle, IEEE Trans. Comput. C-20(1971) 153–161.

    Google Scholar 

  21. Stone, H.S., An efficient parallel algorithm for the solution of a tridiagonal linear system of equations, J. ACM 20(1973) 27–38.

    Google Scholar 

  22. van Emde Boas, P., The second machine class: models of parallelism, in: J. van Leeuwen, and J.K. Lenstra, (eds.), Parallel computers and computations, CWI Syll., Centre for Mathematics and Computer Science, Amsterdam, 1985, pp-(to appear).

    Google Scholar 

  23. van Leeuwen, J., Parallel computers and algorithms, Techn. Rep. RUU-CS-83-13, Dept. of Computer Science, University of Utrecht, Utrecht, 1983.

    Google Scholar 

  24. van Leeuwen, J., and J. Wiederman, Array processing machines, Techn. Rep. RUU-CS-84-13, Dept. of Computer Science, University of Utrecht, Utrecht, 1984.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Utrecht, P.O. Box 80.012, 3508 TA, Utrecht, the Netherlands

    J. van Leeuwen & J. Wiedermann

  2. VUSEI-AR, Dubravska 3, 842 21, Bratislava, Czechoslovakia

    J. Wiedermann

Authors
  1. J. van Leeuwen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. Wiedermann
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Lothar Budach

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

van Leeuwen, J., Wiedermann, J. (1985). Array processing machines. In: Budach, L. (eds) Fundamentals of Computation Theory. FCT 1985. Lecture Notes in Computer Science, vol 199. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028810

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-15689-5

  • Online ISBN: 978-3-540-39636-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation