On the performance of synchronized programs in distributed networks with random processing times and transmission delays
- 1 January 1994
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 5 (9) , 939-950
- https://doi.org/10.1109/71.308532
Abstract
No abstract availableThis publication has 22 references indexed in Scilit:
- Analysis of a distributed scheduler for communication networksPublished by Springer Nature ,2005
- Upper and lower bounds for stochastic marked graphsInformation Processing Letters, 1994
- Analysis of distributed algorithms based on recurrence relationsPublished by Springer Nature ,1992
- The use of a synchronizer yields maximum computation rate in distributed networksPublished by Association for Computing Machinery (ACM) ,1990
- The fork-join queue and related systems with synchronization constraints: stochastic ordering and computable boundsAdvances in Applied Probability, 1989
- Acyclic fork-join queuing networksJournal of the ACM, 1989
- Investigations of fault-tolerant networks of computersPublished by Association for Computing Machinery (ACM) ,1988
- The effect of increasing service rates in a closed queueing networkJournal of Applied Probability, 1986
- Distributed snapshotsACM Transactions on Computer Systems, 1985
- Marked directed graphsJournal of Computer and System Sciences, 1971