Transfert de charge dans un réseau de processeurs totalement connectés
RAIRO - Operations Research - Recherche Opérationnelle (2000)
- Volume: 34, Issue: 1, page 99-129
- ISSN: 0399-0559
Access Full Article
top
How to cite
topBéguin, Maryse. "Transfert de charge dans un réseau de processeurs totalement connectés." RAIRO - Operations Research - Recherche Opérationnelle 34.1 (2000): 99-129. <http://eudml.org/doc/105211>.
@article{Béguin2000,
author = {Béguin, Maryse},
journal = {RAIRO - Operations Research - Recherche Opérationnelle},
keywords = {performance evaluation; load transfer; massively parallel system; Markov process; death process; birth process},
language = {fre},
number = {1},
pages = {99-129},
publisher = {EDP-Sciences},
title = {Transfert de charge dans un réseau de processeurs totalement connectés},
url = {http://eudml.org/doc/105211},
volume = {34},
year = {2000},
}
TY - JOUR
AU - Béguin, Maryse
TI - Transfert de charge dans un réseau de processeurs totalement connectés
JO - RAIRO - Operations Research - Recherche Opérationnelle
PY - 2000
PB - EDP-Sciences
VL - 34
IS - 1
SP - 99
EP - 129
LA - fre
KW - performance evaluation; load transfer; massively parallel system; Markov process; death process; birth process
UR - http://eudml.org/doc/105211
ER -
References
top- 1. A. T. BARUCHA-REID, Elements of the theory of Markov processes and their Applications, Mc Graw-Hill, Londres, 1960. Zbl0095.32803MR112177
- 2. M. BÉGUIN, Transfert de charge dans les machines parallèles, Rapport technique 6, MAI-IMAG, Grenoble, Octobre 1994.
- 3. D. P. BERTZEKAS et J. N. TSITSIKLIS, Parallel and distributed computation, Prentice-Hall, 1989. Zbl0743.65107
- 4. P. BRÉMAUD, Introduction aux chaînes de Markov et aux files d'attente, Polycopié de l'ENSTA, 1982.
- 5. D. J. EVANS et W. U. N. BUTT, Dynamic Load Balancing using Task-transfer Probabilities, Parallel Computing, 1993, 19, p. 897-916.
- 6. W. FISHER et K. MEIER-HELLSTERN, The Markov-modulated Poisson process (MMPP) cookbook, Performance Evaluation, 1993, 18, p. 149-171. Zbl0781.60098MR1237373
- 7. L. KLEINROCK, Queueing Systems: Theory, volume 1, J. Wiley & Sons, 1975. Zbl0870.60091
- 8. J. D. C. LITTLE, A proofof the queueing formula L = λW, Oper. Res, 1961, 9, p. 383-387. Zbl0108.14803MR125644
- 9. V. MALYSHEV et P. ROBERT, Phase transition in a loss load sharing model, Ann. Appl. Probab., 1994 4, p. 1161-1176. Zbl0812.60083MR1304779
- 10. R. MIRCHANANEY, D. TOWSLEY et J. A. STANKOVIC, Analysis of the effects of delays on load sharing, IEEE Trans. on Computers, 1989, C-38, p. 1513-1525.
- 11. B. PLATEAU, Algorithmique parallèle et partage de charge, Rapport technique, APACHE-IMAG, 1994.
- 12. M. ROSENBLATT, Functions of a Markov process that are Markovian, Journal of Mathematics and Mechanics, 1995, 8, p. 585-596. Zbl0100.34403MR103539
- 13. S. M. Ross, Introduction to probability models, fourth edition, Academic Press, INC, Londres, 1989. Zbl0781.60001MR1005105
- 14. F. SPIES, H. GUYENNET et M. TREHEL, Modeling and simulation of dynamic load balancing using queueing theory, Parallel Algorithms and Applications, Gordon and Breach science publishers, 1995, 5, p. 199-218. Zbl1049.68531
- 15. M. S. SQUILLANTE et R. D. NELSON, Analysis of task migration in shared-memory multiprocessors, In Proceedings of the ACM SYGMETRICS Conference on Meassurement and Modeling of Computer Systems, 1991, p. 143-155.
- 16. J. WALRAND, Introduction to Queueing Networks, Prentice-Hall, 1989. Zbl0854.60090
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.