Abstract
In this paper we show how dynamic brokering for batch allocation in grids based on bi-dimensional indices can be used in practice in computational grids, with or without knowing the sizes of the jobs. We provide a fast algorithm (with a quadratic complexity) which can be used off-line or even on-line to compute the index tables. We also report numerous simulations providing numerical evidence of the great efficiency of our index routing policy as well as its robustness with respect to parameter changes. The value of information is also assessed by comparing the performance of indexes when the sizes of the jobs are known and when they are not known.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
EGEE: Grids for E-sciencE. [Online]. Available: http://www.eu-egee.org
GridPP. [Online]. Available: http://www.gridpp.ac.uk
Grid 5000, a large scale nation wide infrastructure for grid research. [Online]. Available: https://www.grid5000.fr/
Papadimitriou, C.H., Tsitsiklis, J.N.: The complexity of optimal queueing network control. Math. Oper. Res. 24, 293–305 (1999)
Whittle, P.: A celebration of applied probability. In: gani, j. (ed.) J. Appl. Probab. Spec, vol. 25A, ch. Restless bandits: activity allocation in a changing world, pp. 287–298 (1988)
Palmer, J., Mitrani, I.: Optimal and heuristic policies for dynamic server allocation. Journal of Parallel and Distributed Computing 65(10), 1204–1211 (2005) (special issue: Design and Performance of Networks for Super-, Cluster-, and Grid-Computing (Part I))
Niño-Mora, J.: Dynamic allocation indices for restless projects and queueing admission control: a polyhedral approach. Mathematical Programming, Series A 93(3), 361–413 (2002)
Weber, R.R., Weiss, G.: On an index policy for restless bandits. Journal of Applied Probability 27, 637–648 (1990)
Ansell, P., Glazebrook, K.D., Nino-Mora, J., O’Keeffe, M.: Whittle’s index policy for a multi-class queueing system with convex holding costs. Mathematical Methods of Operational Research 57, 21–39 (2003)
Berten, V., Gaujal, B.: Index routing for task allocation in grids. INRIA, Tech. Rep. RR-5892 (2006)
Puterman, M.L.: Markov Decision Processes: Discrete Stochastic Dynamic Programming. Wiley, New York (1994)
Li, H., Groep, D., Wolters, L.: Workload characteristics of a multi-cluster supercomputer. In: Feitelson, D.G., Rudolph, L., Schwiegelshohn, U. (eds.) JSSPP 2004. LNCS, vol. 3277, pp. 176–193. Springer, Heidelberg (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Berten, V., Gaujal, B. (2007). Grid Brokering for Batch Allocation Using Indexes. In: Chahed, T., Tuffin, B. (eds) Network Control and Optimization. NET-COOP 2007. Lecture Notes in Computer Science, vol 4465. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72709-5_23
Download citation
DOI: https://doi.org/10.1007/978-3-540-72709-5_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72708-8
Online ISBN: 978-3-540-72709-5
eBook Packages: Computer ScienceComputer Science (R0)