Analysis of Concurrent Algorithms

Authors

  • Jørgen Staunstrup

DOI:

https://doi.org/10.7146/dpb.v10i129.7405

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.

Author Biography

Jørgen Staunstrup

Downloads

Published

1981-01-01

How to Cite

Staunstrup, J. (1981). Analysis of Concurrent Algorithms. DAIMI Report Series, 10(129). https://doi.org/10.7146/dpb.v10i129.7405