Grid brokering for batch allocation using indexes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4465 LNCS, Issue , 2007, Pages 215-225

  Berten, Vandy ^a   Gaujal, Bruno ^b  

^a UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

^b GRENOBLE INSTITUTE OF TECHNOLOGY   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; ELECTRONIC COMMERCE; INDEXING (OF INFORMATION); RESOURCE ALLOCATION;

COMPUTATIONAL GRIDS; DYNAMIC BROKERING; QUADRATIC COMPLEXITY;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 37149025078     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72709-5_23     Document Type: Conference Paper

References (12)

1. EGEE: Grids for E-sciencE. [Online]. Available: http://www.eu-egee.org
2. GridPP. [Online]. Available: http://www.gridpp.ac.uk
3. Grid 5000, a large scale nation wide infrastructure for grid research. [Online]. Available: https://www.grid5000.fr/
4. C. H. Papadimitriou and J. N. Tsitsiklis, "The complexity of optimal queueing network control," Math. Oper. Res., vol. 24, pp. 293-305, 1999.
5. P. Whittle, A celebration of applied probability, j. gani ed. J. Appl. Probab. Spec., 1988, vol. 25A, ch. Restless bandits: activity allocation in a changing world, pp. 287-298.
6. 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).
7. J. Niño-Mora, "Dynamic allocation indices for restless projects and queueing admission control: a polyhedral approach," Mathematical Programming, Series A, vol. 93, no. 3, pp. 361-413, 2002.
8. R. R. Weber and G. Weiss, "On an index policy for restless bandits," Journal of Applied Probability, vol. 27, pp. 637-648, 1990.
9. P. Ansell, K. D. Glazebrook, J. Nino-Mora, and M. O'Keeffe, "Whittle's index policy for a multi-class queueing system with convex holding costs," Mathematical Methods of Operational Research, vol. 57, pp. 21-39, 2003.
10. V. Berten and B. Gaujal, "Index routing for task allocation in grids," INRIA, Tech. Rep. RR-5892, 2006.
11. M. L. Puterman, Markov Decision Processes: Discrete Stochastic Dynamic Programming. New York: Wiley, 1994.
12. H. Li, D. Groep, and L. Wolters, "Workload characteristics of a multi-cluster supercomputer," in Job Scheduling Strategies for Parallel Processing, D. G. Feitelson, L. Rudolph, and U. Schwiegelshohn, Eds. Springer Verlag, 2004, pp. 176-193, lect. Notes Comput. Sci. vol. 3277.