On the average performance of synchronized programs in distributed networks
- 1 January 1991
- book chapter
- Published by Springer Nature
- p. 102-121
- https://doi.org/10.1007/3-540-54099-7_8
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Network synchronization with polylogarithmic overheadPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- The use of a synchronizer yields maximum computation rate in distributed networksPublished by Association for Computing Machinery (ACM) ,1990
- Concurrency in heavily loaded neighborhood-constrained systemsACM Transactions on Programming Languages and Systems, 1989
- Graph spannersJournal of Graph Theory, 1989
- Investigations of fault-tolerant networks of computersPublished by Association for Computing Machinery (ACM) ,1988
- Reducing complexities of the distributed max‐flow and breadth‐first‐search algorithms by means of network synchronizationNetworks, 1985
- Complexity of network synchronizationJournal of the ACM, 1985
- Distributed snapshotsACM Transactions on Computer Systems, 1985
- Performance Analysis Using Stochastic Petri NetsIEEE Transactions on Computers, 1982
- Marked directed graphsJournal of Computer and System Sciences, 1971