Parallélisation d'une combinaison des méthodes de Monte-Carlo et quasi-Monte-Carlo et application aux réseaux de files d'attente

 Access to full text

 Full (PDF)

1. 1. F. BASKETT, M. CHANDY, R. MUNTZ et J. PALACIOS, Open, closed and mixed networks of queues with different classes of customers, J. Assoc. Comput. Machi., 1975, 22, p. 248-260. Zbl0313.68055MR365749
2. 2. J. BECK et W. CHEN, Irregularities of Distribution, Cambridge University Press, 1987. Zbl1156.11029MR903025
3. 3. J. P. BUZEN, Computational algorithms for closed queueing networks with exponential servers, Comm. ACM, 1973, 16, p. 527-531. Zbl0261.68031MR362985
4. 4. R. CRANLEY et T. N. L. PATTERSON, Randomization of number theoretic methods for multiple integration, SIAM J. Numer. Anal., 1976, 13 n° 6, p. 904-914. Zbl0354.65016MR494820
5. 5. M. DRMOTA et R. F. TICHY, Sequences, Discrepancies and Applications, Springer Verlag, Heidelberg, Lecture Notes in Mathematics, 1997, 1651. Zbl0877.11043MR1470456
6. 6. M. EL KHADIRI, R. MARIE et G. RUBINO, Parallel estimation of 2-terminal network reliability by a crude Monte-Carlo technique, M. Baray and B. Özgüç (Eds.), Computer and Information Sciences VI, Elsevier Science, 1991. 
7. 7. G. S. FISHMAN, Monte-Carlo: Concepts, algorithms and applications, Springer-Verlag, 1997. Zbl0859.65001MR1392474
8. 8. P. HEIDELBERGER, Discrete event simulations and parallel processing: Statistical properties, SIAM J. Stat. Comput., 1988, 9 n° 6, p. 1114-1132. Zbl0661.68115MR963858
9. 9. D. E. KNUTH, The art of computer progamming, Vol. 2, Addison-Wesley, 1981. Zbl0477.65002MR633878
10. 10. W. J. MOROKOFF et R. E. CAFLISCH, Quasi-random sequences and their discrepancies, SIAM J. Sci.Comput., 1994, p. 1571-1599. Zbl0815.65002MR1298614
11. 11. H. NIEDERREITER, Random number generation and quasi-Monte-Carlo methods, CBMS-SIAM 63, Philadelphia, 1992. Zbl0761.65002MR1172997
12. 12. W. H. PRESS, S. A. TEUTOLSKY, W. T. VETTERLING et B. P. FLANNERY, Numerical recipes in C: the art of scientific Computing, Cambridge, New York, Oakeigh, Cambridge University Press, 1992. Zbl0845.65001MR1201159
13. 13. K. G. RAMAKRISHNAN et D. MITRA, An overview of PANACEA, a software package for analyzing Markovian queueing networks, Bell System Technical Journal, 1982, 61, p. 2849-2872. Zbl0501.60001
14. 14. M. REISER et H. KOBAYASHI, Queueing networks with multiple closed chains: Theory and computational algorithms, IBM J. Res. Develop., 1975, 19, p. 283-294. Zbl0307.68042MR383584
15. 15. K. W. ROSS, D. TSANG et J. WANG, Monte-Carlo summation and integration applied to multichain queueing networks, J. Assoc. Comput. Mach., 1994, 41 n° 6, p. 1110-1135. Zbl0829.68010MR1371496
16. 16. K. W. ROSS et J. WANG, Asymptotically optimal importance sampling for product-form queueing networks, ACM Trans. Modeling and Computer Simulation, 1993, 3, p. 244-268. Zbl0844.60076
17. 17. K. W. ROSS et J. WANG, Implementation of Monte-Carlo integration for the analysis of product-form queueing networks, Performance Evaluation, 1997, 29 n° 4, p.-273-292. 
18. 18. J. E. H. SHAW, A quasirandom approach to integration in Bayesian statistics, Ann. Statist., 1988, 16, p. 895-914. Zbl0645.62043MR947584
19. 19. B. TUFFIN, Simulation accélérée par les méthodes de Monte-Carlo et quasi-Monte-Carlo : théorie et applications, PhD thesis, Université de Rennes 1, Octobre 1997. 
20. 20. B. TUFFIN, Variance reductions applied to product-form multi-class queuing network, ACM Trans. Modeling and Computer Simulation, 1997, 7 n° 4, p. 478-500. Zbl0917.65129
21. 21. J. WANG et K. W. ROSS, Asymptotic analysis for closed multiclass queueing networks in critical usage, Queueing Systems: Theory and Applications, 1994, 6, p. 167-191. Zbl0794.60091MR1272447