Advanced Stochastic Host State Modeling to Reliable Computation in Global Computing Environment

  • EunJoung Byun
  • HongSoo Kim
  • SungJin Choi
  • MaengSoon Baik
  • SooJin Goo
  • Joon-Min Gil
  • HarkSoo Park
  • Chong-Sun Hwang
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4096)


To design a stable global computing environment supporting reliable job execution and covering unanticipated state changes of hosts, the dynamic characteristics (i.e. volatilities) of hosts should be considered. Since a host is not dedicated to the system, voluntary hosts are free to leave and join autonomously in the middle of execution. As current systems do not relate volatility to a scheduling procedure, global computing systems suffer from performance degradation, reliability loss, job interruption, and execution time delays. For dependable computation, we propose Advanced Stochastic Host State Modeling (ASHSM), which is based on Markov model relating to execution availability quantifying duration and regularity of execution patterns of each host. Through the model, the system predicts desktop activities and allocates jobs according to the host features. Furthermore ASHSM alleviates unreliability due to unstable resource provision and job suspension during execution.


Success Probability Schedule Scheme Total Execution Time Desktop Grid Host Availability 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Sarmenta, L.F.G.: ”Volunteer Computing”, Ph.D. thesis. Dept. of Electrical Engineering and Computer Science, MIT (March 2001)Google Scholar
  2. 2.
    Fedak, G., Germain, C., Neri, V., Cappello, F.: XtremWeb: A Generic Global Computing System. In: Workshop on Global Computing on Personal Devices, CCGRID 2001 (May 2001)Google Scholar
  3. 3.
    Baratloo, A., Karaul, M., Kedem, Z., Wyckoff, P.: Charlotte: Metacomputing on the web. In: Proceedings of 9th Conference on Parallel and Distributed Computing System (1996)Google Scholar
  4. 4.
    Anderson, D.P., Cobb, J., Korpela, E., Lebofsky, M., Werthimer, D.: SETI@home: an experiment in5 public-resource computing. Communications of the ACM 45(11) (November 2002)Google Scholar
  5. 5.
    Bhagwan, Savage, Voelker: ”Understanding availability”, IPTPS (2003)Google Scholar
  6. 6.
    Brevik, J., Nurmi, D., Wolski, R.: Modeling machine availability in enterprise and wide-area distributed computing environment, Technical Report CS2003-28 (October 2003)Google Scholar
  7. 7.
    Chu, J., Labonte, K., Levine, B.N.: Availability and Popularity Measurements of Peer-to-Peer File systems, Technical report 04-36 (June 2004)Google Scholar
  8. 8.
    Kondo, D., Taufer, M., Karanicolas, J., Brooks, C.L., Casanova, H., Chien, A.: Characterizing and Evaluating desktop Grids - An Empirical Study. In: Proceedings of IPDPS 2004 (April 2004)Google Scholar
  9. 9.
    Kondo, D., Casanova, H., Berman, F.: Models and Scheduling Mechanism in Global Computing Applications. In: Proceedings of IPDPS 2002 (April 2002)Google Scholar
  10. 10.
    Casanova, H., Legrand, A., Zagorodnov, D., Berman, F.: Heuristics for Scheduling Prameter Sweep Applications in Grid Environments. In: Proceedings of the 9th Hrogeneous Computing Workshop (May 2000)Google Scholar
  11. 11.
    Wolski, R., Spring, N., Hayes, J.: The Network Weather Service: A Distributed Resource Performance Forecasting Service for Metacomputing. Journal of Future Generation Computing Systems (1999)Google Scholar
  12. 12.
    Lau, L.F., Ananda, A.L., Tan, G., Wong, W.F.: Gucha: Internet-based parallel computing using Java. In: ICA3PP (December 2000)Google Scholar
  13. 13.
    Eun Joung Byun, S.J., Choi, M.S., Baik, C.Y., Park, S.Y., Jung, Hwang, C.S.: Scheduling Scheme based on Dedication Rate. In: ISPDC (2005)Google Scholar
  14. 14.
    Schopt, J., Berman, F.: Stochastic Scheduling. In: Proceedings of SC 1999 (November 1999)Google Scholar
  15. 15.
    Rainer, L.R.: A Tutorial on Hidden Markov Models and Selected Application. IEEE AS3P Magagine (January 1986)Google Scholar
  16. 16.
    Mutka, M.W., Livny, M.: The Available Capacity of a Privately Owned Workstation Environmont. Performance Evaluation 12(4), 269–284 (1991)MATHCrossRefGoogle Scholar
  17. 17.
    Forney Jr., G.D.: The Viterbi Algorithm. IEEE Proceedings of TT (March 1973)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • EunJoung Byun
    • 1
  • HongSoo Kim
    • 1
  • SungJin Choi
    • 1
  • MaengSoon Baik
    • 2
  • SooJin Goo
    • 1
  • Joon-Min Gil
    • 3
  • HarkSoo Park
    • 4
  • Chong-Sun Hwang
    • 1
  1. 1.Dept. of Computer Science & EngineeringKorea University 
  2. 2.IT Research & Development CenterSAMSUNG SDS 
  3. 3.Dept. of Computer Science EducationCatholic University of DaeguGyeongbukKorea
  4. 4.Supercomputing CenterKISTIKorea

Personalised recommendations