Evaluating the optimal server allocation policy for clusters with on/off sources

Performance Evaluation

Volumn 66, Issue 8, 2009, Pages 453-467

  Slegers, Joris ^a   Mitrani, Isi ^a   Thomas, Nigel ^a  

^a NEWCASTLE UNIVERSITY   (United Kingdom)

Author keywords

Bursty arrival sources; Cloud computing; Dynamic optimization; Resource allocation

Indexed keywords

BURSTY ARRIVAL SOURCES; BURSTY ARRIVALS; CLOUD COMPUTING; DYNAMIC OPTIMIZATION; MARKOV DECISION PROCESS; OPTIMAL POLICIES; OPTIMAL SERVER ALLOCATION; RE-CONFIGURABLE; SIMPLE SYSTEM;

HEURISTIC METHODS; MARKOV PROCESSES; PLANNING; RESOURCE ALLOCATION; SERVERS;

OPTIMIZATION;

EID: 67349281247     PISSN: 01665316     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.peva.2009.01.004     Document Type: Article

References (10)

1. Palmer J., and Mitrani I. Optimal server allocation in reconfigurable clusters with multiple job types. J. Parallel Distrib. Comput. 65/10 (2005) 1204-1211
2. J. Slegers, I. Mitrani, N. Thomas, Server allocation in grid systems with on/off sources, in: Proceedings of ISPA 2006 Workshops, in: Lecture Notes in Computing Science, vol. 4331, Springer, pp. 897-906
3. J. Slegers, I. Mitrani, N. Thomas, Static and dynamic server allocation in systems with on/off sources, Ann. Oper. Res., entitled Stochastic Performance Models for Resource Allocation in Communication Systems, (special issue, in press)
4. J. Slegers, I. Mitrani, N. Thomas, Optimal dynamic server allocation in systems with on/off sources, in: Formal Methods and Stochastic Models for Performance Evaluation, proceedings of EPEW 2007, in: Lecture Notes in Computing Science, vol. 4748, pp. 186-200
5. de Souza e Silva E., and Gail H.R. The uniformization method in performability analysis. In: Haverkort B.R., Marie R., Rubino G., and Trivedi K. (Eds). Performability Modelling (2001), Wiley
6. Tijms H.C. Stochastic Models (1994), Wiley, New York
7. Golub G.H., and Van Loan C.F. Matrix Computations (1996), Johns Hopkins University Press, Baltimore
8. Daniel B. Szyld, The mystery of asynchronous iterations convergence when the spectral radius is one, Research Report 98-102, Department of Mathematics, Temple University. http://www.math.temple.edu/~szyld/papers.html. 1988
9. Howard R.A. Dynamic Programming and Markov Processes (1960), Wiley, New York
10. White D.J. Dynamic programming, Markov chains and the method of successive approximations. J. Math Anal. Appl. 6 (1963) 373-376