Analysis of concurrent algorithms
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.
Unable to display preview. Download preview PDF.
- [Aho, Hopcroft, and Ullman 1974]The Design and Analysis of Computer Algorithms, A.V. Aho, J.E. Hopcroft and J.D. Ullman, Addison Wesley 1974.Google Scholar
- [Feller 1950]An Introduction to Probability Theory and its Applications, W. Feller, John Wiley and Sons 1950.Google Scholar
- [Knuth 1968]The Art of Computer Programming I–III, D.E. Knuth, Addison Wesley 1968.Google Scholar
- [Kung 1976]Synchronized and Asynchronous Algorithms, H. T. Kung in Algorithms and Complexity, J.F. Traub (ed.) Academic Press 1976.Google Scholar
- [Staunstrup 1978]Specification, Verification, and Implementation of Concurrent Programs, University of Southern California, Los Angeles 1978.Google Scholar