Abstract
The tree computer is a particular model of a highly parallel general — purpose computer, designed for very fast computations. We emphasise that a realistic model is needed both for reliable predictions about the behaviour of real machines and for investigations into efficient algorithms. With this background we shall interpret theoretical results with respect to the practical use of tree computers.
This research was supported in part by the DFG grant Me 672/2.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aho, A.V., Hopcroft, J.E., Ullman, J.D., (1974) “The Design and Analyses of Computer Algorithms” Addison-Wesley, Reading, Mass.
Bhatt, S.N., Leiserson, C.E., (1982) “How to Assemble Tree Machines” Proc. 14th ACM Symp. on Theory of Computing, pp. 77–84
Buchberger, B., (1978) “Computer-trees and their Programming” Proc. troisième Colloque de Lille “Les arbres en algèbre et en programmmation”
Chazelle, B., Monier, L., (1981) “Unbounded Hardware is Equivalent to Deterministic Turing Machines” Carnegie-Mellon University, Department of Computer Science, Report 81–143
Garey, M.R., Johnson, D.S., (1979) “Computers and Intractability” Freeman, San Francisco
Paul W.J., (1978) “Komplextitätstheorie” Teubner, Stuttgart
Savitch, W.J., Stimson, M.J., (1979) “Time Bounded Random Access Machines with Parallel Processing” JACM (26) 1, pp. 103–118
Savitch, W.J., (1970) “Relationship Between Nondeterministic and Deterministic Tape Complexities” JCSS (4) 2, pp. 177–192
Wöst, W., (1982) “Introduction to Tree Computers” Universität Karlsruhe, Institut für Informatik, Interner Bericht Nr. 12/82
Wöst, W., (1982) “Sorting and Scheduling on a Tree Computer” Universität Karlsruhe, Institut für Informatik, Interner Bericht Nr. 19/82
Wöst, W., (1982) “On the Parallel Complexity of the Fourier Transform” Universität Karlsruhe, Institut für Informatik, Interner Bericht Nr. 20/82
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1984 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wöst, W. (1984). Tree Computers. In: Wettstein, H. (eds) Architektur und Betrieb von Rechensystemen. Informatik-Fachberichte, vol 78. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-69394-6_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-69394-6_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-12913-4
Online ISBN: 978-3-642-69394-6
eBook Packages: Springer Book Archive