Advanced Search
Volume 30 Issue 11
Nov.  2004
Turn off MathJax
Article Contents
Journal of Beijing University of Aeronautics and Astronautics  > 2004  >  30(11): 1052-1056.
Guo Wencai, Yang Yang, Liu Liet al. Resource dependency based grid resources assignment[J]. Journal of Beijing University of Aeronautics and Astronautics, 2004, 30(11): 1052-1056. (in Chinese)
Citation: Guo Wencai, Yang Yang, Liu Liet al. Resource dependency based grid resources assignment[J]. Journal of Beijing University of Aeronautics and Astronautics, 2004, 30(11): 1052-1056. (in Chinese)
shu

Resource dependency based grid resources assignment

  • School of Information Engineering, University of Science and Technology Beijing , Beijing 100083, China

  • Received Date: 25 Jun 2004
  • Publish Date: 30 Nov 2004
    Abstract
  • As a component of a grid job, a grid service is required to select suit able resource from global wide providers so that the different resource assignme nts will have distinctive impact on the utility of the job,which results in SRA(service resource assignment) problem.Addressing it a novel method TDRA (tree decomposition based resource allocation algorithm), based on tree- decomposition of grid resource dependency graph ,was choosed to form the correct vertex elemination order on which the variables were iteratively relaxed untill the optimised result was reached. The method indicates the complexity of TDRA i s polynominal instead of exponential,which proves available to solve SRA problem s. As a conclusion the further work of this research was also discussed.

     

    • FullText(HTML)
  • loading
    • References(1)
  • [1] Ian Foster, Carl Kesselman, Jeffrey M, et al. Grid services for distributed system integration [J]. Computer, 2002, 35(6):37~46 [2]Roman Ginis. Automating resource management for distributed business processes . California:California Institue of Technology, 2002 [3]Klaus Krauter,Rajkumar Buyya,Muthucumaru Maheswarm. A taxonomy and survey of grid resource management systems for distributed computing[J]. Software -Practice and Experience,2002,32(2):135~164 [4] 原晋江.图的填充和运算[J].中国科学(A辑), 1994, 24(10) Yuan Jinjiang. The fill-in and computation of graph[J]. Science in China(Seri es A), 1994, 24 (10)(in Chinese) [5] Robertson N, Seymour P D. Graph minors II:algorithmic aspects of tree-width [J]. Journal of Algorithms, 986,7:309~322 [6]Koster A M, van Hoesel S P, Kolen A W. Solving frequency assignment problems via tree-decomposition . Technical Report of Universiteit Maastricht RM/99/011, 1999 [7]Tarjan R E. Decomposition by clique separators[J]. Discrete Mathematics, 1985,55(2):221~232 [8]Berry A, Bordat J P, Cogis O. Generating all the minimal separators of a graph . International Journal of Foundations of Computer Science, 2000,11(3):397~403
    • Relative Articles
    • Supplements(0)
    • Cited By
  • 加载中

Catalog

    通讯作者: 陈斌, bchen63@163.com
    • 1. 

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索
    Get Citation
    PDF
    XML

    Article Metrics

    Article views(2608) PDF downloads(740) Cited by()
    Proportional views
    Related

    Copyright © Journal of Beijing University of Aeronautics and Astronautics

    Address: Editorial Department of Journal of Beijing University of Aeronautics and Astronautics, 37 Xueyuan Road, Haidian District, Beijing Post Code: 100191 Email: jbuaa@buaa.edu.cn

    Supported by: Beijing Renhe Information Technology Co., Ltd.    

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return