Throughput calculation for basic stochastic rendezvous networks

DOI10.1016/0166-5316(89)90039-4zbMath0667.68050OpenAlexW1993104029MaRDI QIDQ3820001

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

queueingdecompositionPetri netsstochastic networkrendezvouscomputer performancedistributed softwaredistributed programAda tasking performance

Mathematics Subject Classification ID

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

Related Items (2)

Approximate mean value analysis based on Markov chain aggregation by composition ⋮ Queueing analysis of a server node in transaction processing middleware systems

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