Abstract
Various kinds of simulations among parallel computers are considered. We prove that it is not possible to simulate all parallel computers by one without an additional expense of time or of processors. Then we present a parallel computer which can simulate all parallel computers with n processors and which needs c·n2log(n) processors and extends the time only by a factor d·log log(n).
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Z. Galil, W.J. Paul: A Theory of Complexity of Parallel Computation. To appear in STOC 81
W.J. Paul: Komplexitätstheorie. Teubner-Verlag, Stuttgart, 1978
A. Waksman: A Permutation Network. Journal of the ACM, 15(1) (1968), pp. 159–163
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Meyer auf der Heide, F. (1981). Time-processor trade-offs for universal parallel computers. In: Gruska, J., Chytil, M. (eds) Mathematical Foundations of Computer Science 1981. MFCS 1981. Lecture Notes in Computer Science, vol 118. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10856-4_111
Download citation
DOI: https://doi.org/10.1007/3-540-10856-4_111
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10856-6
Online ISBN: 978-3-540-38769-5
eBook Packages: Springer Book Archive