Performance bounds for concurrent software with rendezvous

DOI10.1016/0166-5316(91)90047-7MaRDI QIDQ3983061zbMATH OpenOpenAlexFDO

Authors Shikharesh Majumdar, John E. Neilson, Dorina C. Petriu, C. Murray Woodside

Publication date 27 June 1992

Published in Performance Evaluation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0166-5316(91)90047-7

zbMATH Keywords

distributed operating systemdistributed softwaremessage passingmultitasking systemsrendezvoussoftware performance

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of operating systems (68N25) Theory of software (68N99)

Recommendations

• The stochastic rendezvous network model for performance of synchronous client-server-like distributed software
• Throughput calculation for basic stochastic rendezvous networks
• Two classes of performance bounds for closed queueing networks
• Performance bounds for modeling NUMA architectures
• A toolset for performance engineering and software design of client-server systems

Cited in

(2)

• On the price of concurrency in group ratcheting protocols
• The stochastic rendezvous network model for performance of synchronous client-server-like distributed software

This page was built for publication: Performance bounds for concurrent software with rendezvous

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