Indexed by:
Abstract:
To solve the problem of task scheduling in grid service composition, based on the system model of grid service composition, the cooperative game among service containers in the system model is analyzed. The existing theorem of unique Nash bargaining solution is proved and the solving algorithm is designed. Experimental results show that the model and algorithm have better experimental effects than the scheduling algorithm based on the node ability.
Keyword:
Reprint Author's Address:
Email:
Source :
Journal of Beijing University of Technology
ISSN: 0254-0037
Year: 2012
Issue: 3
Volume: 38
Page: 380-384
Cited Count:
SCOPUS Cited Count:
ESI Highly Cited Papers on the List: 0 Unfold All
WanFang Cited Count:
Chinese Cited Count:
30 Days PV: 6
Affiliated Colleges: