MIMD algorithms and their implementation

  • P. Weidner
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 253)


We have shown that numerical as well as non-numerical problems can be solved efficiently on MIMD machines. Admittedly, the choice and inplementation of algorithms need more effort and caution than for SIMD. Especially, a careful balancing of the parallel tasks and of the communication cost is necessary. Our results are not restricted to two processors, but can as well be applied with more processors.


Parallel Task Careful Balance High Level Programming Language Bisection Point Jacobi Iteration 
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. [1]
    G. Birkhoff, R.E. Lynch: Numerical Solution of Elliptic Problems, Philadelphia 1984Google Scholar
  2. [2]
    S.C. Chen, J.J. Dongarra, C.C. Hsiung: Multiprocessing linear algebra algorithms on the CRAY X-MP-2: Experiences with small granularity, J. Parallel and Distributed Computing 1, 22–31 (1984)Google Scholar
  3. [3]
    J.J. Dongarra, A.H. Sameh: On some parallel banded system solvers, Parallel Computing 1, 223–235 (1984)Google Scholar
  4. [4]
    M.R. Garey, D.S. Johnson: Computers and Intractability, San Francisco 1979Google Scholar
  5. [5]
    W.M. Gentleman: Some complexity results for matrix computations on parallel processors, J. ACM 25, 112–115 (1978)Google Scholar
  6. [6]
    A. Gibbons: Algorithmic Graph Theory, Cambridge 1985Google Scholar
  7. [7]
    J.R. Gurd, C.C. Kirkham, I. Watson: The Manchester prototype dataflow computer, CACM 28, 34–52 (1985)Google Scholar
  8. [8]
    R. Gurke: Graphenalgorithmen für MIMD-Rechner, Report Jül-Spez 355, Jülich 1986Google Scholar
  9. [9]
    R.W. Hockney, C.R. Jesshope: Parallel Computers, Bristol 1983Google Scholar
  10. [10]
    F. Hoßfeld: Parallele Algorithmen, Berlin-Heidelberg 1983Google Scholar
  11. [11]
    K. Hwang, F.A. Briggs: Computer Architecture and Parallel Processing, New York 1984Google Scholar
  12. [12]
    J. Kowalik (ed.): Parallel MIMD Computation: The HEP Supercomputer and its Applications, Cambridge 1985Google Scholar
  13. [13]
    D.J. Kuck: The Structure of Computers and Computations, New York 1978Google Scholar
  14. [14]
    U. Meier: Two parallel SOR variants of the Schwarz alternating procedure, Parallel Computing 3 (1986)Google Scholar
  15. [15]
    J.M. Ortega, R.G. Voigt: Solution of partial differential equations on vector and parallel computers, SIAM Review 27, 149–240 (1985)Google Scholar
  16. [16]
    M.J. Quinn: The design and analysis of algorithms and data structures for the efficient solution of graph theoretic problems on MIMD computers, Ph.D. Thesis, Washington State University (1983)Google Scholar
  17. [17]
    M.K. Seager: Parallelizing conjugate gradient for the CRAY X-MP, Parallel Computing 3, 35–48 (1986)Google Scholar
  18. [18]
    C.L. Seitz: Experiments with VLSI ensemble machines, J. of VLSI and Computer Systems 1, 311–334 (1986)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • P. Weidner
    • 1
  1. 1.Zentralinstitut für Angewandte MathematikKernforschungsanlage Jülich GmbHJülichGermany

Personalised recommendations