On the Estimation of the Throughput for a Class of Stochastic Resources Sharing Systems

DOI10.1287/moor.23.2.305zbMath0981.60089OpenAlexW2126993079MaRDI QIDQ2757535

Jean-Marc Vincent, Matthieu Brilman

Publication date: 26 November 2001

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.23.2.305

zbMATH Keywords

stochastic processessynchronizationparallel systemsshared resources\((\max,+)\) systems

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items

Computing the average parallelism in trace monoids., APPROXIMATING THE MEAN SPEEDUP IN TRACE MONOIDS, Approximability and Non-approximability Results in Computing the Mean Speedup of Trace Monoids, On the average Cartier-Foata height of traces