Synchronization and concurrency measures for distributed computations
- 2 January 2003
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 3, 700-707
- https://doi.org/10.1109/icdcs.1992.235115
Abstract
Time and message complexities are measures commonlyused to characterize distributed computations.However, these measures only address quantitative aspectsof the computation. This paper presents severalqualitative measures which quantify the degree of concurrencyin a distributed computation by analyzing itssynchronization constraints.We introduce two abstractions, called cone andcylinder, and define concurrency measures using thesetwo abstractions. Then, we present simple ways to...Keywords
This publication has 6 references indexed in Scilit:
- Measure of parallelism of distributed computationsPublished by Springer Nature ,2005
- Logical time in distributed computing systemsComputer, 1991
- Combinatorics and geometry of consistent cuts : Application to concurrency theoryPublished by Springer Nature ,1989
- On distributed snapshotsInformation Processing Letters, 1987
- The mutual exclusion problemJournal of the ACM, 1986
- Time, clocks, and the ordering of events in a distributed systemCommunications of the ACM, 1978