Optimal precomputation for mapping service level agreements in grid computing

  • Authors:
  • Qin Liu;Xiaohua Jia;Chanle Wu

  • Affiliations:
  • School of Computing, Wuhan University, Wuhan 430079, China;Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong;School of Computing, Wuhan University, Wuhan 430079, China

  • Venue:
  • Future Generation Computer Systems
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

A complicated task running on the grid system is usually made up of many services, each of which typically offers a better service quality at a higher cost. Mapping service level agreements (SLAs) optimally is to find the most appropriate quality level for each service such that the overall SLA of a task is achieved at the minimum cost. This paper considers mapping the execution time SLA in the case of the discrete cost function, which is an NP-hard problem. Due to the high computation of mapping SLAs, we propose a precomputation scheme that makes the selection of each individual service level in advance for every possible SLA requirement, which can reduce the request response time greatly. We use a (1+@e)-approximation method, whose solution for any time bound is at most (1+@e) times of the optimal cost. Simulation results demonstrate the superiority of our method compared with others.