Abstract
Analyzing the running time of a concurrent algorithm can be as important as verifying its partial correctness or termination. A simple technique for analyzing the running time of a concurrent algorithm is presented. To analyze an algorithm with concurrent processes, the interaction between the processes must be considered. This is done by using the communication sequences of the processes as the basis of the analysis. The technique is used for analyzing and comparing three concurrent algorithms for finding the root of a real function.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
The Design and Analysis of Computer Algorithms, A.V. Aho, J.E. Hopcroft and J.D. Ullman, Addison Wesley 1974.
An Introduction to Probability Theory and its Applications, W. Feller, John Wiley and Sons 1950.
The Art of Computer Programming I–III, D.E. Knuth, Addison Wesley 1968.
Synchronized and Asynchronous Algorithms, H. T. Kung in Algorithms and Complexity, J.F. Traub (ed.) Academic Press 1976.
Specification, Verification, and Implementation of Concurrent Programs, University of Southern California, Los Angeles 1978.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Staunstrup, J. (1981). Analysis of concurrent algorithms. In: Brauer, W., et al. Conpar 81. CONPAR 1981. Lecture Notes in Computer Science, vol 111. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0105120
Download citation
DOI: https://doi.org/10.1007/BFb0105120
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10827-6
Online ISBN: 978-3-540-38715-2
eBook Packages: Springer Book Archive