Scheduling optimization in coupling independent services as a Grid transaction

  • Authors:

  • Haitao Yang;Zhenghua Wang;Qinghua Deng

  • Affiliations:

  • Institute of Computing Technology of Chinese Academy of Sciences, Graduate University of Chinese Academy of Sciences, Beijing 100080, China;National Laboratory for Parallel and Distributed Processing, National University of Defense Technology, Changsha 410073, China;Institute of Computing Technology of Chinese Academy of Sciences, Graduate University of Chinese Academy of Sciences, Beijing 100080, China

  • Venue:
  • Journal of Parallel and Distributed Computing
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Due to the dynamic properties of autonomous resource providers, the coupling of independent services as a Grid transaction may abort with inconsistency. In many situations people would resort to compensation actions to regain consistency; consequently there comes the issue of compensation-cost. To handle such an issue, for the first time we set up a costing model for the all-or-nothing transaction of Grid services, and introduce the ECC metric to evaluate related service scheduling. The analysis of ECC estimation is based on the so-called CC-PreC commit pattern, which is an abstract of a category of common use cases of commit handling. Our analysis theoretically illustrates the high degree of computational complexity of scheduling optimization with respect to the cost labeling, timing and order of requests. Under certain typical conditions we prove that infinite possible schemes of scheduling can be reduced down to a finite set of candidates of scheduling. Especially based on the ECC metric, the caution scheduling is thoroughly investigated, which as a basic policy could be employed in certain common scenarios, and under which the intuitive product-first or cost-first schemes are justified in several typical situations.