Skip to main content

Part of the book series: Springer Series in Synergetics ((SSSYN,volume 31))

  • 281 Accesses

Abstract

Whereas many processes are naturally parallel, our perception of processes involved in the dynamics of physical systems, and the design of algorithms in order to model and compute the behaviour of such systems, has been dominated by the paradigm of the sequential flow of operations and data on which the breakthrough of computational science has fundamentally been built, thus enforcing the appearance — and the tremendous success — of the serial von Neumann type computer architecture.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literature

  1. Hossfeld, F.; Weidner, P.: Parallele Algorithmen, Informatik-Spektrum 6 (1983), 142.

    Google Scholar 

  2. Hossfeld, F.: Nonlinear Dynamics: A Challenge on High-Speed Computation, Proc. Int. Conf. Parallel Computing 83 (M. Feilmeier et al., eds.), North-Holland 1984, pp. 67.

    Google Scholar 

  3. Uhr, L.: Algorithm-Structured Computer Arrays and Networks, Academic Press, 1984.

    MATH  Google Scholar 

  4. Borodin, A.; Munro. I.: The Computational Complexity of Algebraic and Numeric Problems, Elsevier, 1975.

    MATH  Google Scholar 

  5. Munro, I.; Paterson, M.: Optimal Algorithms for Parallel Polynomial Evaluation, J. Computer and Syst. Sci. 7 (1973), 189.

    Article  MathSciNet  MATH  Google Scholar 

  6. Dekel, E.; Sahni, S.: Binary Trees and Parallel Scheduling Algorithms, IEEE Trans. Computers C-32 (1983), 307.

    Article  MATH  Google Scholar 

  7. Horowitz, E.; Zorat, A.: Divide-and-Conquer for Parallel Processing, IEEE Trans. Computers C-32 (1983), 582.

    Google Scholar 

  8. Aho, A.V.; Hopcroft, J.E.; Ullman, J.D.: The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974.

    MATH  Google Scholar 

  9. Hockney, R.W.; Jesshope, C.R.: Parallel Computers, Hilger, 1981.

    MATH  Google Scholar 

  10. van Leeuwen, J.; Wijshoff, H.A.G.: Data Mappings in Large Parallel Computers, Proceedings GI-13. Jahrestagung, Informatik-Fachberichte Bd. 73, Springer, 1983, pp. 8.

    Google Scholar 

  11. Heller, D.: A Survey of Parallel Algorithms in Numerical Linear Algebra, SIAM Rev. 20 (1978), 740.

    Article  MathSciNet  MATH  Google Scholar 

  12. Bitton, D.; De Witt, D.J.; Hsiao, D.K.; Menon, J.: A Taxonomy of Parallel Sorting, ACM Computing Surveys 16 (1984), 287.

    Article  MATH  Google Scholar 

  13. Quinn, M.J.; Deo, N.: Parallel Graph Algorithms, ACM Computing Surveys 16 (1984), 319.

    Article  MathSciNet  MATH  Google Scholar 

  14. Cooley, J.W.; Tukey, J.W.: An Algorithm for the Machine Calculation of Complex Fourier Series, Math. Comp. 19 (1965), 297.

    Article  MathSciNet  MATH  Google Scholar 

  15. Nussbaumer H.J.: Fast Fourier Transform and Convolution Algorithms, Springer, 1981.

    MATH  Google Scholar 

  16. Kung, H.T.; Leiserson, CE.: Systolic Arrays (for VLSI), Sparse Matrix Proceedings 1978, SIAM 1979, p. 256.

    Google Scholar 

  17. Brent, R.P.; Kung, H.T.; Luk, F.T.: Some Linear-Time Algorithms for Systolic Arrays, IFIP 83, Elsevier/North-Holland, 1983, p. 865.

    Google Scholar 

  18. Bojanczyk, A.; Brent, R.P.; Kung, H.T.: Numerically Stable Solution of Dense Systems of Linear Equations Using Mesh-Connected Processors, SIAM J. Sci. Stat. Comput. 5 (1984), 95.

    Article  MathSciNet  MATH  Google Scholar 

  19. Lord, R.E.; Kowalik, J.S.; Kumar, S.P.: Solving Linear Algebraic Equations on an MIMD Computer, J. ACM 30 (1983), 103.

    Article  MathSciNet  MATH  Google Scholar 

  20. Hwang, K.; Briggs, F.A.: Computer Architecture and Parallel Processing, McGraw-Hill, 1984.

    MATH  Google Scholar 

  21. Farmer, D.; Toffoli, T.; Wolfram, S. (eds.): Cellular Automata, Proceedings of an Interdisciplinary Workshop, Los Alamos. Special Issue of Physica 10D, North-Holland, 1984.

    MATH  Google Scholar 

  22. Wolfram, S.: Statistical Mechanics of Cellular Automata, Rev. Mod. Phys. 55

    Google Scholar 

  23. (1983), 601.

    Google Scholar 

  24. Nassimi, D.; Sahni, S.: Finding Connected Components and Connected Ones on a Mesh-Connected Parallel Computer, SIAM J. Computing 9 (1980), 744.

    Article  MathSciNet  MATH  Google Scholar 

  25. Hambrusch, S.E.: VLSI Algorithms for the Connected Component Problem, SIAM J. Computing 12 (1983), 354.

    Article  MathSciNet  MATH  Google Scholar 

  26. Kung, H.T.; Lehman, P.L.: Systolic (VLSI) Arrays for Relational Data Base Operations, Proc. ACM-SIGMOD 1980 International Conference on Management of Data, ACM, 1980, p. 105.

    Google Scholar 

  27. Lehman, P.L.: A Systolic (VLSI) Array for Processing Simple Relational Queries, in: H.T. Kung et al. (eds.), VLSI Systems and Computations, Carnegie-Mellon University, Computer Science Press, 1981, p. 285.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hossfeld, F. (1985). Parallel Processes and Parallel Algorithms. In: Haken, H. (eds) Complex Systems — Operational Approaches in Neurobiology, Physics, and Computers. Springer Series in Synergetics, vol 31. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-70795-7_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-70795-7_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-70797-1

  • Online ISBN: 978-3-642-70795-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics