Your browser does not support JavaScript!
http://iet.metastore.ingenta.com
1887

Stochastic analysis of scheduling strategies in a Grid-based resource model

Stochastic analysis of scheduling strategies in a Grid-based resource model

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
IEE Proceedings - Software — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

A model inspired by a scenario found in Grid-based scheduling systems is considered. Scheduling is performed remotely without access to up-to-date resource availability and usage information. This system is modelled as a collection of queues where servers break down and are subsequently repaired. There is a delay before the scheduler learns of failures, and requests may continue to arrive into a resource queue for some time after active service has ceased. The queues are considered to be persistent under failure. However, these queues have finite capacity; therefore there is the possibility that queues become full, causing job-loss. Stochastic process algebra and stochastic probes are used to analyse this model to find steady-state measures and passage time distributions. The effect of the duration of any delay on information propagation on the system response time and job loss is investigated and evaluated numerically.

References

    1. 1)
      • B. Nitzberg , J. Schopf . Current activities in the scheduling and resource management area of the global Grid forum. Lect. Notes Comput. Sci.
    2. 2)
      • Thomas, N., Bradley, J.T.: `Decomposing models of parallel queues', Proc. 4th Int. Workshop on Queueing Networks with Finite Capacity, 2000.
    3. 3)
      • K.D.M. Haji , I. Gourlay , P. Dew . A SNAP-based community resource broker using a three-phase commit protocol: a performance study. Comput. J.
    4. 4)
      • Schopf, J.M.: ‘A general architecture for scheduling on the Grid’, Preprint ANL/MCS-P1000-1002, Argonne National Laboratory, 2002.
    5. 5)
      • S. Martin , I. Mitrani . Optimal scheduling among intermittently unavailable servers. Int. J. Simul.
    6. 6)
      • Dingle, N.J., Knottenbelt, W.J., Harrison, P.G.: `HYDRA: HYpergraph-based Distributed Response-time Analyser', Proc. 2003 Int. Conf. on Parallel and Distributed Processing Techniques and Applications, Las Vegas, NV, USA, 2003, 1, p. 215–219.
    7. 7)
    8. 8)
      • Argent-Katwala, A., Bradley, J.T., Dingle, N.J.: `Expressing performance requirements using regular expressions to specify stochastic probes over process algebra models', Proc. 4th Int. Workshop on Software and Performance (WOSP), Redwood City, CA, USA, 2004, p. 49–58.
    9. 9)
      • Berman, F., Wolski, R.: `The AppLeS project: A status report', Proc. 8th NEC Research Symp., Berlin, Germany, 1997.
    10. 10)
    11. 11)
    12. 12)
      • J. Cao , S.A. Jarvis , S. Saini . ARMS: An agent-based resource management system for Grid computing. Sci. Program. , 2 , 135 - 148
    13. 13)
      • Frey, J., Tannenbaum, T., Foster, I., Livny, M., Tuecke, S.: `Condor-G: A computation management agent for multi-institutional Grids', Proc. 10th IEEE Symp. on High-Performance Computing, San Francisco, CA, USA, 2001.
    14. 14)
      • Thomas, N.: `The effect of information latency on performance', Proc. 19th UK Performance Engineering Workshop, University of Warwick, 2003.
    15. 15)
      • G. Clark , S.T. Gilmore , J. Hillston , N. Thomas . Experiences with the PEPA workbench modelling tools. IEE Proc. – Softw. , 1 , 11 - 19
    16. 16)
      • Buyya, R., Abramson, J., Giddy, J.: `Nimrod/G: An architecture for a resource management and scheduling system in a global computational Grid', 4th IEEE Conf. on High-Performance Computing in the Asia-Pacific Region, China, 2000.
    17. 17)
      • N. Thomas , I. Mitrani . (1995) Routing among different nodes where servers break down without losing jobs, Quantitative methods in parallel systems.
    18. 18)
      • Bradley, J.T., Dingle, N.J., Gilmore, S.T., Knottenbelt, W.J.: `Derivation of passage-time densities in PEPA models using ipc: the Imperial PEPA Compiler', Proc. 11th IEEE/ACM Int. Symp. on Modeling, Analysis and Simulation of Computer and Telecommunications Systems (MASCOTS), 2003, University of Central Florida, Florida, USA, p. 344–351.
    19. 19)
      • Fitzgerald, S., Foster, I., Kesselman, C., von Laszewski, G., Smith, W., Tuecke, S.: `A directory service for configuring high-performance distributed computations', Proc. 6th IEEE Symp. on High-Performance Computing, 1997, p. 365–375.
http://iet.metastore.ingenta.com/content/journals/10.1049/ip-sen_20041091
Loading

Related content

content/journals/10.1049/ip-sen_20041091
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address