Summary
Concurrent algorithms for finding the root of a real continous function are analyzed. A lower bound on the running time is given, this lower bound is obtained by a synchronous algorithm. A new asynchronous algorithm is discussed in detail and its running time is analyzed. Finally, the results from running the asynchronous algorithm on a multiprocessor are shown.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Brinch Hansen: The programming language Concurrent Pascal. IEEE Transactions on Software Engineering 1, 2, 199–207 (1975)
Kung: Synchronized and asynchronous parallel algorithms for multiprocessors. In: Algorithms and Complexity: New Directions and Recent Results. Traub, J.F. (ed.). New York: Academic Press, 1976
Møller-Nielsen; Staunstrup, J.: Early experience from a multiprocessor project. DAIMI PB-142, Computer Science Department, Aarhus University, January 1982
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Eriksen, O., Staunstrup, J. Concurrent algorithms for root searching. Acta Informatica 18, 361–376 (1983). https://doi.org/10.1007/BF00289575
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00289575