A mean field approach for optimization in particle systems and applications

VALUETOOLS 2009 - 4th International Conference on Performance Evaluation Methodologies and Tools

Volumn , Issue , 2009, Pages

  Gast, Nicolas ^a   Gaujal, Bruno ^b  

^a UNIV GRENOBLE ALPES   (France)

^b INRIA   (France)

Author keywords

Brokering; Markov decision process; Mean field

Indexed keywords

COSTS; GRID COMPUTING; LEARNING ALGORITHMS; MARKOV PROCESSES; TOOLS;

BROKERING; COMMON ENVIRONMENT; DETERMINISTIC SYSTEMS; INFINITE HORIZONS; MARKOV DECISION PROCESSES; MEAN FIELD; MEAN FIELD APPROACH; SPEED OF CONVERGENCE;

OPTIMIZATION;

EID: 84897096001     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4108/ICST.VALUETOOLS2009.7477     Document Type: Conference Paper

References (17)

1. M. Benaim and J. Le Boudec, "A Class Of Mean Field Interaction Models for Computer and Communication Systems, " To appear in Performance Evaluation.
2. C. Bordenave, D. McDonald, and A. Proutiere, "A particle system in interaction with a rapidly varying environment: Mean field limits and applications, " Arxiv preprint math.PR/0701363, 2007.
3. J. Boudec, D. McDonald, and J. Mundinger, "A Generic Mean Field Convergence Result for Systems of Interacting Objects, " QEST 2007., pp. 3-18, 2007.
4. C. Bordenave and V. Anantharam, "Optimal control of interacting particle systems, " CNRS Open-Archive HAL, Tech. Rep. 00397327, 2007.
5. EGEE: Enabling Grids for E-sciencE. [Online]. Available: http://www.eu-egee.org.
6. C. H. Papadimitriou and J. N. Tsitsiklis, "The complexity of optimal queueing network control, " Math. Oper. Res., vol. 24, pp. 293-305, 1999.
7. C. Graham, "Chaoticity on path space for a queueing network with selection of the shortest queue among several, " Journal of Applied Probability, vol. 37, pp. 198-211, 2000.
8. M. Puterman, Markov Decision Processes : Discrete Stochastic Dynamic Programming. Wiley-Interscience, 2005.
9. R. Durrett, Probability: Theory and examples. Wadsworth & Brooks/Cole, 1991.
10. V. Borkar, Stochastic Approximation: A Dynamical Systems Viewpoint. Cambridge University Press, 2008.
11. J. Palmer and I. Mitrani, "Optimal and heuristic policies for dynamic server allocation, " Journal of Parallel and Distributed Computing, vol. 65, no. 10, pp. 1204-1211, 2005, special issue: Design and Performance of Networks for Super-, Cluster-, and Grid-Computing (Part I).
12. V. Berten and B. Gaujal, "Brokering strategies in computational grids using stochastic prediction models, " Parallel Computing, 2007, special Issue on Large Scale Grids.
13. V. Berten and B. Gaujal, "Grid brokering for batch allocation using indexes, " in Euro-FGI NET-COOP. Avignon, France: LNCS, june 2007.
14. P. Whittle, A celebration of applied probability. J. Appl. Probab. Spec., 1988, vol. 25A, ch. Restless Bandits: Activity allocation in a changing world, pp. 287-298.
15. R. R. Weber and G. Weiss, "On an index policy for restless bandits, " Journal of Applied Probability, vol. 27, pp. 637-648, 1990.
16. T. Rolski, "Comparison theorems for queues with dependent interarrival times, " in Lecture Notes in Control and Information Sciences. Springer-Verlag, 1983, vol. 60, pp. 42-71.
17. D. Hochbaum, Approximation algorithms for NP-hard problems. PWS Publishing Co. Boston, MA, USA, 1996.