Throughput calculation for basic stochastic rendezvous networks

DOI10.1016/0166-5316(89)90039-4MaRDI QIDQ3820001zbMATH OpenOpenAlexFDO

Authors C. Murray Woodside

Publication date 1989

Published in Performance Evaluation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0166-5316(89)90039-4

zbMATH Keywords

Ada tasking performancecomputer performancedecompositiondistributed programdistributed softwarePetri netsqueueingrendezvousstochastic network

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of operating systems (68N25) Theory of software (68N99) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Computing the throughput of dynamic networks
• Performance analysis of stochastic networks
• On the estimation of the throughput for a class of stochastic resources sharing systems
• scientific article; zbMATH DE number 956788
• Throughput Region of Random-Access Networks of General Topology
• Performance modeling, stochastic networks, and statistical multiplexing
• Stochastic models of random access networks

Cited in

(6)

• Approximate mean value analysis based on Markov chain aggregation by composition
• Queueing analysis of a server node in transaction processing middleware systems
• The multiway rendezvous
• Performance bounds for concurrent software with rendezvous
• The stochastic rendezvous network model for performance of synchronous client-server-like distributed software
• Calculation of traffic flow breakdown probability to optimize link throughput

This page was built for publication: Throughput calculation for basic stochastic rendezvous networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3820001)