loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2009 International Conference on Advanced Information Networking and Applications
Reliability-Driven Reputation Based Scheduling for Public-Resource Computing Using GA
Bradford, United Kingdom
May 26-May 29
ISBN: 978-0-7695-3638-5
For an application in public-resource computing environments, providing reliable scheduling based on resource reliability evaluation is becoming increasingly important. Most existing reputation models used for reliability evaluation ignore the time influence. And very few works use a robust genetic algorithm to optimize both time and reliability for a workflow application. Hence, in this paper, we propose the reliability-driven (RD) reputation, which is time dependent and can be used to evaluate a task’s reliability directly using the exponential failure model. Based on the RD reputation, we also propose Knowledge-Based Genetic Algorithm (KBGA) to optimize both time and reliability for a workflow application. KBGA uses heuristics to accelerate the evolution process without giving invalid solutions. Our experiments show that the RD reputation can improve the reliability of a workflow application with more accurate reputation, while the KBGA can evolve to better scheduling solutions more quickly than traditional genetic algorithms.
Index Terms:
reliability, reputation, workflow scheduling, genetic algorithm, heuristic
Citation:
Xiaofeng Wang, Chee Shin Yeo, Rajkumar Buyya, Jinshu Su, "Reliability-Driven Reputation Based Scheduling for Public-Resource Computing Using GA," aina, pp.411-418, 2009 International Conference on Advanced Information Networking and Applications, 2009
Usage of this product signifies your acceptance of the Terms of Use.