• DocumentCode
    3351038
  • Title

    Grid resource scheduling based on fuzzy similarity measures

  • Author

    Lu, Bin ; Chen, Juan

  • Author_Institution
    Dept. of Comput. Sci.&Technol., North China Electr. Power Univ., Baoding
  • fYear
    2008
  • fDate
    21-24 Sept. 2008
  • Firstpage
    940
  • Lastpage
    944
  • Abstract
    Resource scheduling is one of the basic and key aspects in grid computing, which allocating the most suitable resources satisfying the requirement of userspsila applications. After reviewing some novel fuzzy similarity measures, this paper presents an unified one to determine the fuzzy similarity between two objects, especially two grid resources. The approach is a family of fuzzy similarity measures, and any common measures can be obtained easily only by specifying a parameter h. The resource scheduling of grid is just based on it. Then, a formal model of Grid resources with three layers is proposed for effectively and efficiently organizing and accessing all kinds of heterogeneous resources. This is helpful to reduce the cost of time and correspondence in allocating resources through describing resources, abstracting resources and providing unified system images. Over the organization of resources, the scheme of resource scheduling is also described. Finally, analyses show that this approach is feasible to the different application fields.
  • Keywords
    fuzzy set theory; grid computing; resource allocation; scheduling; fuzzy similarity measure; grid computing; grid resource scheduling; Costs; Distributed computing; Electric variables measurement; Extraterrestrial measurements; Fuzzy set theory; Fuzzy sets; Grid computing; Power measurement; Processor scheduling; Resource management; fuzzy similarity measures; grid computing; hyper topology space; resource organization; resource scheduling;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Cybernetics and Intelligent Systems, 2008 IEEE Conference on
  • Conference_Location
    Chengdu
  • Print_ISBN
    978-1-4244-1673-8
  • Electronic_ISBN
    978-1-4244-1674-5
  • Type

    conf

  • DOI
    10.1109/ICCIS.2008.4670849
  • Filename
    4670849