This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Baudet, G.M.: Asynchronous iterative methods for multiprocessors, J. ACM 25 (1978), 226–244
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–167
Cooley, J.W. and Tukey, J.W.: An algorithm for the machine calculation of complex Fourier series, Math. Comput. 19 (1965), 297–301
Gentleman, W.M.: Some complexity results for matrix computations on parallel processors, J. ACM 25 (1978), 112–115
Heller, D.: A survey of parallel algorithms in numerical linear algebra, SIAM Review 20 (1978), 740–777
Hoßfeld, F.: Parallele Algorithmen, Reihe Informatik-Fachberichte, Bd. 64. Berlin-Heidelberg-New York: Springer 1983
Hoßfeld, F. and Weidner, P.: Parallel evaluation of correlation time-of-flight experiments, CONPAR Nürnberg, 1981, W. Händler ed., 441–452
Hwang, K. and Cheng, Y.-H.: Partitioned matrix algorithms for VLSI arithmetic systems, IEEE Trans. Computers C-31 (1982), 1215–1224
Kuck, D.J.: The Structure of Computers and Computations, Vol. 1. New York: J. Wiley & Sons 1978
Kuck, D.J., Lawrie, D.H., Sameh, A.H. (eds.): High Speed Computer and Algorithm Organisation. New York: Academic Press 1977
Kung, H.T., Leiserson, C.E.: Systolic arrays (for VLSI), Proc. SIAM Sparse Matrix 1979, 256
Lawrie, D.H.: Access and alignment of data in an array processor, IEEE Trans. Computers C-24 (1975), 1145–1155
Oed, W.: Monte Carlo simulations on vector machines, Angewandte Informatik 24 (1982), 358–364
Reghbati (Arjomandi), E., and Corneil, D.G.: Parallel computations in graph theory, SIAM J. Computing 7 (1978), 230–237
Rodrigue, G. (ed.): Parallel Computations. New York: Academic Press 1982
Schultz, M. (ed.): Elliptic Problem Solvers. New York: Academic Press 1981
Stone,H.S.: Parallel processing with the perfect shuffle, IEEE Trans. Computers C-20 (1971), 153–161
Traub, J.F. (ed.): Complexity of Sequential and Parallel Numerical Algorithms, New York: Academic Press 1973 *** DIRECT SUPPORT *** A3418153 00003
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1984 Springer-Verlag
About this paper
Cite this paper
Weidner, P., Hoßfeld, F. (1984). Parallel algorithms — theory and limitations. In: Becker, J.D., Eisele, I. (eds) WOPPLOT 83 Parallel Processing: Logic, Organization, and Technology. Lecture Notes in Physics, vol 196. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0018257
Download citation
DOI: https://doi.org/10.1007/BFb0018257
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-12917-2
Online ISBN: 978-3-540-38803-6
eBook Packages: Springer Book Archive