2nd International ICST Conference on Scalable Information Systems

Research Article

A decentralized quickest response algorithm for grid service discovery

  • @INPROCEEDINGS{10.4108/infoscale.2007.84,
        author={Jianjun  Hu and Heqing Guan and Hua  Zhong},
        title={A decentralized quickest response algorithm for grid service discovery},
        proceedings={2nd International ICST Conference on Scalable Information Systems},
        publisher={ACM},
        proceedings_a={INFOSCALE},
        year={2010},
        month={5},
        keywords={Grid computing service discovery decentralization network  latency},
        doi={10.4108/infoscale.2007.84}
    }
    
  • Jianjun Hu
    Heqing Guan
    Hua Zhong
    Year: 2010
    A decentralized quickest response algorithm for grid service discovery
    INFOSCALE
    ICST
    DOI: 10.4108/infoscale.2007.84
Jianjun Hu1,*, Heqing Guan1,*, Hua Zhong1,*
  • 1: Technology Center of Software Engineering, Institute of Software, Chinese Academy of Sciences, P.O.Box 8718, Beijing 100080, P.R.China. +8610-62630989
*Contact email: _hujj@otcaix.iscas.ac.cn, ghq@otcaix.iscas.ac.cn, _zhongh@otcaix.iscas.ac.cn

Abstract

Computational grid is an emerging computing infrastructure that enables effective access to high performance computing resources. Service discovery is one of the most important research issues of grid computing. However, traditional service discovery algorithms are not suitable for grid environment due to the facts of inherited decentralization and loose coupling of grid application itself. To address this problem, we in the paper analyze the limitation of those traditional algorithms, and present a novel grid oriented service discovery algorithm based on quickest response approach, namely DSDA, which is essentially decentralized. DSDA also takes network latency and processing capability of service nodes into account. Our later experiment justified DSDA's effectiveness in the grid environment.