Analysis of distributed algorithms based on recurrence relations
- 1 January 1992
- book chapter
- Published by Springer Nature
- p. 242-253
- https://doi.org/10.1007/bfb0022451
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Cost-Sensitive Analysis of Communication ProtocolsPublished by Defense Technical Information Center (DTIC) ,1991
- On the average performance of synchronized programs in distributed networksPublished by Springer Nature ,1991
- Concurrency in heavily loaded neighborhood-constrained systemsACM Transactions on Programming Languages and Systems, 1989
- Distributed Nodes Organization Algorithm for Channel Access in a Multihop Dynamic Radio NetworkIEEE Transactions on Computers, 1987
- Complexity of network synchronizationJournal of the ACM, 1985
- Distributed snapshotsACM Transactions on Computer Systems, 1985
- Optimization by Simulated AnnealingScience, 1983
- Performance Evaluation of Asynchronous Concurrent Systems Using Petri NetsIEEE Transactions on Software Engineering, 1980
- A characterization of the minimum cycle mean in a digraphDiscrete Mathematics, 1978
- Marked directed graphsJournal of Computer and System Sciences, 1971