- Abstract:
-
In Grid applications the heterogeneity and potential failures of the computing infrastructure poses significant challenges to efficient scheduling. Performance models have been shown to be useful in providing predictions on which schedules can be based [1, 2] and most such techniques can also take account of failures and degraded service. However, when several alternative schedules are to be compared it is vital that the analysis of the models does not become so costly as to outweigh the potential gain of choosing the best schedule. Moreover, it is vital that the modelling approach can scale to match the size and complexity of realistic applications. In this paper we present a novel method of modelling job execution on Grid compute clusters. As previously we use Performance Evaluation Process Algebra (PEPA) [3] as the system description formalism, capturing both workload and computing fabric. The novel feature is that we make a continuous approximation of the state space underlying the PEPA model and represent it as a set of ordinary differential equations (ODEs) for solution, rather than a continuous time, but discrete state space, Markov chain.
- Links To Paper
- 1st Link
- Bibtex format
- @InProceedings{EDI-INF-RR-0427,
- author = {
Anne Benoit
and Murray Cole
and Stephen Gilmore
and Jane Hillston
},
- title = {Enhancing the effective utilisation of Grid clusters by exploiting on-line performability analysis},
- book title = {1st International Workshop on Grid Performability},
- year = 2005,
- month = {May},
- url = {http://homepages.inf.ed.ac.uk/mic/Pubs/gridperf05.pdf},
- }
|