Abstract
We present a new model of parallel computation called the “array processing machine” or APM (for short). 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. It is shown that every problem that is solvable in polynomial space on an ordinary, sequential random access machine can be solved in parallel polynomial time on an APM (and vice versa). The relationship to other models of parallel computation is discussed.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A. V. Aho, J. E. Hopcroft and J. D. Ullman,The Design and Analysis of Computer Algorithms, Addison-Wesley Publ. Comp., Reading, Mass., 1974.
A. K. Chandra, D. C. Kozen and L. J. Stockmeyer,Alternation, J. ACM 28 (1981), 114–133.
S. A. Cook,Towards a complexity theory of synchronous parallel computation, Enseign. Math. 27 (1981), 99–124.
S. A. Cook,The classification of problems which have fast parallel algorithms, Proc. FCT'83, Springer Lecture Notes in Comput. Sci. 158 (1983), 78–93; revised and extended version in: Inf. & Control 64 (1985), 2–22.
S. A. Cook and R. A. Reckhow,Time-bounded random access machines, J. Comput. Syst. Sci. 7 (1973), 354–375.
E. Engeler,Introduction to the Theory of Computation, Acad. Press, New York, NY, 1973.
M. J. Flynn,Some computer organisations and their effectiveness, IEEE Trans. Comput. C-21 (1972), 948–960.
S. Fortune and J. Wyllie,Parallelism in random access machines, Proc. 10th ACM Sympos. Theory of Comput., San Diego, 1978, pp. 89–94.
L. M. Goldschlager,A universal interconnection pattern for parallel computers, J. ACM 29 (1982), 1073–1086.
J. Hartmanis 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.
R. W. Hockney and C. R. Jesshope,Parallel Computers, Hilger, Bristol, 1981.
K. Hwang, 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.
D. E. Knuth,The Art of Computer Programming, Vol. 3: Sorting and Searching, Addison-Wesley Publ. Comp., Reading, Mass., 1975.
V. R. Pratt, and L. J. Stockmeyer,A characterization of the power of vector machines, J. Comput. Syst. Sci. 12 (1976), 198–221.
W. L. Ruzzo,On uniform circuit complexity, J. Comput. Syst. Sci. 22 (1981), 365–383.
W. J. Savitch,Parallel random access machines with powerful instruction sets, Math. Syst. Theor. 15 (1982), 191–210.
W. J. Savitch and M. J. Stimson,Time-bounded random access machines with parallel processing. J. ACM 26 (1979), 103–118.
L. J. Stockmeyer and U. Vishkin,Simulation of parallel random access machines by circuits, SIAM J. Comput. 13 (1984), 409–422.
H. S. Stone,Parallel processing with the perfect shuffle, IEEE Trans. Comput. 3–20 (1971), 153–161.
H. S. Stone,An efficient parallel algorithm for the solution of a tridiagonal linear system of equations, J. ACM 20 (1973), 27–38.
P. van Emde Boas,The second machine class: models of parallelism, in: J. van Leeuwen and J. K. Lenstra, (eds.),Parallel Computers and Computations, CWI Syll. 9, Centre for Mathematics and Computer Science, Amsterdam, 1985, pp. 133–161.
P. van Emde Boas,The second machine class 2: an encyclopedic view of the parallel computation thesis, Rep. 85-24, Dept. of Mathematics, University of Amsterdam, Amsterdam, 1985.
J. van Leeuwen,Parallel computers and algorithms, Techn. Rep. RUU-CS-83-13, Dept. of Computer Science, University of Utrecht, 1983; also in: J. van Leeuwen and J. K. Lenstra (eds.),Parallel Computers and Computations, CWI Syll. 9, Centre for Mathematics and Computer Science, Amsterdam, 1985, pp, 1–32.
J. van Leeuwen and H. A. G. Wijshoff,Data mappings in large parallel computers, in: I. Kupka (ed.), GI-13 Jahrestagung, Informatik Fb 73, Springer Verlag, Berlin, 1983, pp. 8–20.
J. van Leeuwen and J. Wiedermann,Array processing machines, Techn. Rep. RUU-CS-84-13, Dept. of Computer Science, University of Utrecht, Utrecht, 1984. Extended abstract in: L. Budach (ed.),Fundamentals of Computation Theory, Proceedings, Lecture Notes in Computer Science, Vol. 199, Springer-Verlag, Berlin, 1985, pp. 257–268.
J. Wiedermann,Parallel Turing machines, Techn. Rep. RUU-CS-84-11, Dept. of Computer Science, University of Utrecht, Utrecht, 1984.
Author information
Authors and Affiliations
Additional information
This work was carried out while the second author was visiting the Dept. of Computer Science, University of Utrecht, the Netherlands (Fall 1984). A preliminary version of this paper was presented at the 5th International Conference on Fundamentals of Computation Theory (FCT 85), Cottbus, Sept. 9–13, 1985.