Advertisement

Parallel algorithms — theory and limitations

  • P. Weidner
  • F. Hoßfeld
Conference paper
  • 179 Downloads
Part of the Lecture Notes in Physics book series (LNP, volume 196)

Keywords

Parallel Algorithm Communication Complexity Systolic Array Memory Unit Inherent Parallelism 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. /1/.
    Baudet, G.M.: Asynchronous iterative methods for multiprocessors, J. ACM 25 (1978), 226–244CrossRefGoogle Scholar
  2. /2/.
    Bucher, I.Y., Buzbee B.L. and Frederickson, P.O.: Experiment in parallel processing a large scientific code, Proc. 1981 Int. Conf. on Parallel Processing, 1981, 166–167Google Scholar
  3. /3/.
    Cooley, J.W. and Tukey, J.W.: An algorithm for the machine calculation of complex Fourier series, Math. Comput. 19 (1965), 297–301Google Scholar
  4. /4/.
    Gentleman, W.M.: Some complexity results for matrix computations on parallel processors, J. ACM 25 (1978), 112–115CrossRefGoogle Scholar
  5. /5/.
    Heller, D.: A survey of parallel algorithms in numerical linear algebra, SIAM Review 20 (1978), 740–777CrossRefGoogle Scholar
  6. /6/.
    Hoßfeld, F.: Parallele Algorithmen, Reihe Informatik-Fachberichte, Bd. 64. Berlin-Heidelberg-New York: Springer 1983Google Scholar
  7. /7/.
    Hoßfeld, F. and Weidner, P.: Parallel evaluation of correlation time-of-flight experiments, CONPAR Nürnberg, 1981, W. Händler ed., 441–452Google Scholar
  8. /8/.
    Hwang, K. and Cheng, Y.-H.: Partitioned matrix algorithms for VLSI arithmetic systems, IEEE Trans. Computers C-31 (1982), 1215–1224Google Scholar
  9. /9/.
    Kuck, D.J.: The Structure of Computers and Computations, Vol. 1. New York: J. Wiley & Sons 1978Google Scholar
  10. /10/.
    Kuck, D.J., Lawrie, D.H., Sameh, A.H. (eds.): High Speed Computer and Algorithm Organisation. New York: Academic Press 1977Google Scholar
  11. /11/.
    Kung, H.T., Leiserson, C.E.: Systolic arrays (for VLSI), Proc. SIAM Sparse Matrix 1979, 256Google Scholar
  12. /12/.
    Lawrie, D.H.: Access and alignment of data in an array processor, IEEE Trans. Computers C-24 (1975), 1145–1155Google Scholar
  13. /13/.
    Oed, W.: Monte Carlo simulations on vector machines, Angewandte Informatik 24 (1982), 358–364Google Scholar
  14. /14/.
    Reghbati (Arjomandi), E., and Corneil, D.G.: Parallel computations in graph theory, SIAM J. Computing 7 (1978), 230–237CrossRefGoogle Scholar
  15. /15/.
    Rodrigue, G. (ed.): Parallel Computations. New York: Academic Press 1982Google Scholar
  16. /16/.
    Schultz, M. (ed.): Elliptic Problem Solvers. New York: Academic Press 1981Google Scholar
  17. /17/.
    Stone,H.S.: Parallel processing with the perfect shuffle, IEEE Trans. Computers C-20 (1971), 153–161Google Scholar
  18. /18/.
    Traub, J.F. (ed.): Complexity of Sequential and Parallel Numerical Algorithms, New York: Academic Press 1973 *** DIRECT SUPPORT *** A3418153 00003Google Scholar

Copyright information

© Springer-Verlag 1984

Authors and Affiliations

  • P. Weidner
    • 1
  • F. Hoßfeld
    • 1
  1. 1.Zentralinstitut für Angewandte Mathematik derKernforschungsanlage Jülich GmbHJülich

Personalised recommendations