Parallel Computer Models: An Introduction

  • G. Ausiello
  • P. Bertolazzi
Part of the International Centre for Mechanical Sciences book series (CISM, volume 284)


Various forms of parallel processing have been realized in computer systems in the last two decades, ranging from parallelization of data processing with respect to input and output operations, to the use of higly parallel arithmetic units, to the construction of networks of tightly interconnected processors. In this introductory paper we examine various examples of abstract and real parallel machines with the aim of providing the basic concepts and discuss their fundamental characteristics. Besides we briefly discuss under what circumstances and up to what extent parallel devices may provide a more efficient solution to computational problems.


Parallel Algorithm Parallel Machine Single Instruction Multiple Data Array Processor Communication Step 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Baer 73]
    J.L. Baer: A survey od some theoretical aspects of multiprocessing. ACM Computing surveys, vol. 5, n. 4, March 1973.Google Scholar
  2. [Bilardi 81]
    G. Bilardi, M. Pracchi, F.P. Preparata: A critique and appraisal of VLSI models of computation. Manuscript, 1981.Google Scholar
  3. [Chandra 79]
    A.K. Chandra: Computable nondeterministic functions, Proc. of 4th IBM Symposium on Math. Found. of Comp. Sc., Tokyo, 1979.Google Scholar
  4. [Chandra, Stockmeyer 76]
    A.K. Chandra, L.J. Stockmeyer: Alternation, Proc. 17th FOCS, 1976.Google Scholar
  5. [Chazelle 81]
    B. Chazelle, L. Monier: A model of computation for VLSI with related complexity results. Carnegie Mell University, Tech. Rep. n. CMU-CS-81–107, Feb. 1981.Google Scholar
  6. [Chi-Chin Yao 81]
    A. Chi-Chin Yao: On the parallel computation for the knapsack problem, 13th Symposium of Theory of Comp., Milwaukee 1981.Google Scholar
  7. [Cole 64]
    S.N. Cole: Real time computation by iterative arrays of finite state machines, Doctoral Thesis Harvard University, Cambridge, Mass., 1964.Google Scholar
  8. [Cook 83]
    S.A. Cook: The classification of problems which have fast parallel algorithms. Found. of Comp. Theory Borgholm, Sweden Aug. 1983, Springer Verlag Ed.Google Scholar
  9. [Dekel 80]
    E. Dekel, D. Nassimi, S. Sahni: Parallel matrix and graph algorithms. From 18th Allerton Conference on Communication Control and Comp. Oct. 79.Google Scholar
  10. [Dixon 81]
    L.C.W. Dixon: The place of parallel computation in numerical optimization, CREST-CNR Summer School on design of numerical algorithms for parallel processing, Bergamo June 1981.Google Scholar
  11. [Duff, Levialdi 81]
    M.J.B. Duff, S. Levialdi edits: Languages and architectures for image processing, Academic Press, 1981.Google Scholar
  12. [Eckstein 79]
    D.M. Eckstein: Simultaneous memory access, TR-79–6, Computer Sc. Dep., Iowa State University, Arnes, Iowa 1979.Google Scholar
  13. [Enslow 77]
    P.H. Enslow: Multiprocessor organization: a survey, ACM Comp. Surveys, vol. 9, n. 1, March 1977.Google Scholar
  14. [Flynn 66]
    M.J. Flynn: Very high speed computing systems, Proc. IEEE, 54, Dec. 1966.Google Scholar
  15. [Galil, Paul 81]
    Z. Galil, W.J. Paul: An efficient general purpose parallel computer, 13th STOC, 1981.Google Scholar
  16. [Gentleman 76]
    W.M. Gentleman: Some complexity results for matrix computations on parallel processors, Journal of ACM, vol. 23, n. 1, Jan 1976.Google Scholar
  17. [Goldschlager 78]
    L.M. Goldschlager: A unified approach to models of synchronous parallel machines, Proc. 10th STOC, 1978.Google Scholar
  18. [Goldschlager 82]
    L.M. Goldschlager: A universal interconnection pattern for parallel computers. J. of ACM, vol. 29, n. 4, Oct. 1982.Google Scholar
  19. [Heller 78]
    D. Heller: A survey of parallel algorithms in numerical linear algebra, Siam Review, vol. 20, n. 4, Oct. 1978.Google Scholar
  20. [Kindervater 83]
    G.A.P. Kindervater, J.K. Lenstra: Parallel algorithms in combinatorial optimization: an annotated bibliography. Mathematisch Centrum Techn. Rep. n. BW 189 /83, Aug. 1983.Google Scholar
  21. [Kozen 76]
    D. Kozen: On parallelism in Turing machines, Proc. 17th FOCS, 1976.Google Scholar
  22. [Kuck 77]
    D.J. Kuck: A survey of parallel machine organization and programming, ACM Comp. Surveys, vol. 9, n. 1, March 1977.Google Scholar
  23. [Kung 80]
    H.T. Kung: The structure of parallel algorithms in Advances in Computers, vol. 19, ed. by Marshall C. Yovits, Academic Press, 1980.Google Scholar
  24. [Kung, Lehman 80]
    H.T. Kung, P. Lehman: Systolic (VLSI) array for relational data base operations, 1980 ACM SIGMOD International Conference on Management of Data, Los Angeles, May 1980.Google Scholar
  25. [Lint 81]
    B. Lint, T. Agerwala: Communication issues in the design and analysis of parallel algorithms, IEEE Trans. on Softw. Eng., vol. 7, n. 2, March 1981.Google Scholar
  26. [Mc Keown 80]
    J.J. Mc Keown: Aspects of parallel computation in numerical optimization, on Numerical Techniques for Stochastic systems. F. Archetti, M. Cugiani eds., North Holland Pub. 1980.Google Scholar
  27. [Megiddo 83]
    N. Megiddo: Applying parallel computation algorithms in the design of serial algorithms, Journal of ACM, 30, 4, 1983.CrossRefMathSciNetGoogle Scholar
  28. [Miranker 71]
    W.L. Miranker: A survey of parallelism in numerical analysis, SIAM Review, 13, 1971.Google Scholar
  29. [Moore 62]
    E.F. Moore: Machine models of self-reproduction, Proc. Symp. Appi. Math., 14, 1962.Google Scholar
  30. [Munro 79]
    J.I. Munro, E.L. Robertson: Parallel algorithms and serial data structures, 17th Annual Allerton Conference on Communication, Control and Computing, Oct. 1979.Google Scholar
  31. [Peterson 77]
    J.L. Peterson: Petri nets, ACM Comp. Surv. 9, 3, 1977.CrossRefGoogle Scholar
  32. [Petri 62]
    C.A. Petri: Kommunication mit Automaten, Schrift des RW Inst. f. Instr. Math. an der U. Bonn Heft 2, Bonn, 1962.Google Scholar
  33. [Pratt, Stockmeyer 76]
    V.R. Pratt, L.J. Stockmeyer: A characterization of the power of vector machines, JCSS, 1976.Google Scholar
  34. [Preparata, Vuillemin 81]
    F.P. Preparata, J. Vuillemin: The cube-connected cycles: A versatile network for parallel computation, Communications of ACM, 24, 5, 1981.CrossRefMathSciNetGoogle Scholar
  35. [Ramamoorthy, Li 77]
    C.V. Ramamoorthy, H.F. Li: Pipeline architecture, ACM Comp. Surveys, vol. 9, n. 1, March 1977.Google Scholar
  36. [Reddy, Hon 79]
    D.R. Reddy, R.W. Hon: Computer architecture for vision, Computer vision and sensor based robots, ed. G.G. Dodd, L. Rossol, Plenum Press, New York, 1979.Google Scholar
  37. [Rozenberg, Salomaa 80]
    G. Rozenberg, A. Salomaa: The mathematical theory of L-systems, Academic Press, 1980.Google Scholar
  38. [Savitch, Stimson 76]
    W.J. Savitch, M.J. Stimson: Time bounded random access machines with parallel processing, TR IW 67/76, Math. Centrum, Amsterdam, 1976.Google Scholar
  39. [Schwartz 80]
    J.T. Schwartz: Ultracomputers, ACM TOPLAS, 2, 4, 1980.Google Scholar
  40. [Thompson 79]
    C.D. Thompson: Area time complexity for VLSI, Proc. of the 11th Annual ACM Symp. on the Theory of Comp. May 1979.Google Scholar
  41. [Thompson 77]
    C.D. Thompson, H.T. Kung: Sorting on a mesh connected parallel computer, Comm. of ACM, vol. 20, n. 4, Apr. 1977.Google Scholar
  42. [Valiant, Brebner 81]
    L.G. Valiant, G.J. Brebner: Universal schemes for parallel communication, 13th STOC, 1981.Google Scholar
  43. [Vishkin 82]
    U. Vishkin: Parallel-Design space, Distributed-Implementation space (PDDI) general purpose computer. RC 9541, IBM T.J. Watson Research Center, Yorktown Heights, 1982.Google Scholar
  44. [Vishkin 83]
    U. Vishkin: Synchronous Parallel Computation. A survey, 1982 Manuscript.Google Scholar
  45. [Von Neumann 51]
    J. Von Neumann: The general and logical theory of automata, in Cerebral Mechanisms in Behaviour, Hixon Symposium, 1948 ( Wiley, N.Y. 1951 ).Google Scholar

Copyright information

© Springer-Verlag Wien 1984

Authors and Affiliations

  • G. Ausiello
    • 1
  • P. Bertolazzi
    • 2
  1. 1.Dipartimento di Informatica e SistemisticaUniversity of RomaItaly
  2. 2.Istituto di Analisi dei Sistemi ed InformaticaCNRRomaItaly

Personalised recommendations