Abstract
We present in this paper a stochastic model for a class of resources sharing systems, on which we define a performance parameter: γ This parameter can be seen as the inverse of the asymptotic throughput of the system. We then present an upper-bound and a lower-bound for γ These bounds are simply deduced from the conflict graph of the system. We finally show how they can lead to a good estimation of γ for some large systems.
This research was partially supported by the National French Inter-PRC project Aξ and the IMAG project MAI
Chapter PDF
References
M. Brilman. Modélisation et évaluation de performances de systèmes de ressources partagées. PhD thesis, Université Joseph Fourrier, 1996.
M. Brilman and J-M. Vincent. Dynamics of synchronized parallel systems. March 1995. Submitted to Stochastic Models.
M. Brilman and J-M. Vincent. On the estimation of the throughput for a class of stochastic resources sharing systems. November 1995. Submitted to Mathematics of Operations Research.
G.H. Golub and C.F. Van Loan. Matrix Computations. Hopkins University Press, 1987.
J. Mairesse. Products of Irreducible Random Matrices in the (Max,+) Algebra-Part1. Technical Report 1939, INRIA, June 1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brilman, M., Vincent, JM. (1996). Estimation of the throughput for some stochastic resources sharing systems. In: Bougé, L., Fraigniaud, P., Mignotte, A., Robert, Y. (eds) Euro-Par'96 Parallel Processing. Euro-Par 1996. Lecture Notes in Computer Science, vol 1124. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0024770
Download citation
DOI: https://doi.org/10.1007/BFb0024770
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61627-6
Online ISBN: 978-3-540-70636-6
eBook Packages: Springer Book Archive