Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
G. Birkhoff, R.E. Lynch: Numerical Solution of Elliptic Problems, Philadelphia 1984
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)
J.J. Dongarra, A.H. Sameh: On some parallel banded system solvers, Parallel Computing 1, 223–235 (1984)
M.R. Garey, D.S. Johnson: Computers and Intractability, San Francisco 1979
W.M. Gentleman: Some complexity results for matrix computations on parallel processors, J. ACM 25, 112–115 (1978)
A. Gibbons: Algorithmic Graph Theory, Cambridge 1985
J.R. Gurd, C.C. Kirkham, I. Watson: The Manchester prototype dataflow computer, CACM 28, 34–52 (1985)
R. Gurke: Graphenalgorithmen für MIMD-Rechner, Report Jül-Spez 355, Jülich 1986
R.W. Hockney, C.R. Jesshope: Parallel Computers, Bristol 1983
F. Hoßfeld: Parallele Algorithmen, Berlin-Heidelberg 1983
K. Hwang, F.A. Briggs: Computer Architecture and Parallel Processing, New York 1984
J. Kowalik (ed.): Parallel MIMD Computation: The HEP Supercomputer and its Applications, Cambridge 1985
D.J. Kuck: The Structure of Computers and Computations, New York 1978
U. Meier: Two parallel SOR variants of the Schwarz alternating procedure, Parallel Computing 3 (1986)
J.M. Ortega, R.G. Voigt: Solution of partial differential equations on vector and parallel computers, SIAM Review 27, 149–240 (1985)
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)
M.K. Seager: Parallelizing conjugate gradient for the CRAY X-MP, Parallel Computing 3, 35–48 (1986)
C.L. Seitz: Experiments with VLSI ensemble machines, J. of VLSI and Computer Systems 1, 311–334 (1986)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Weidner, P. (1987). MIMD algorithms and their implementation. In: Becker, J.D., Eisele, I. (eds) WOPPLOT 86 Parallel Processing: Logic, Organization, and Technology. WOPPLOT 1986. Lecture Notes in Computer Science, vol 253. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18022-2_6
Download citation
DOI: https://doi.org/10.1007/3-540-18022-2_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18022-7
Online ISBN: 978-3-540-47709-9
eBook Packages: Springer Book Archive