English  |  正體中文  |  简体中文  |  Items with full text/Total items : 90429/105609 (86%)
Visitors : 10381916      Online Users : 687
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    ASIA unversity > 資訊學院 > 資訊傳播學系 > 期刊論文 >  Item 310904400/4301


    Please use this identifier to cite or link to this item: http://asiair.asia.edu.tw/ir/handle/310904400/4301


    Title: A graph matching approach to optimal task assignment in distributed computing systems using a minimax criterion
    Authors: C. C. Shen;W. H. Tsai
    Contributors: Department of Information Communication
    Keywords: A* algorithm;distributed computing systems;grapi matching;interprocessor communication;load balancing;minimax criterion;state-space search;weak homomorphism
    Date: 1985-03
    Issue Date: 2009-11-25 10:30:46 (UTC+8)
    Publisher: Asia University
    Abstract: A graph matching approach is proposed in this paper for solving the task assignment problem encountered in distributed computing systems. A cost function defined in terms of a single unit, time, is proposed for evaluating the effectiveness of task assignment. This cost function represents the maximum time for a task to complete module execution and communication in all the processors. A new optimization criterion, called the minimax criterion, is also proposed, based on which both minimization of interprocessor communication and balance of processor loading can be achieved. The proposed approach allows various system constraints to be included for consideration. With the proposed cost function and the minimax criterion, optimal task assignment is defined. Graphs are then used to represent the module relationship of a given task and the processor structure of a distributed computing system. Module assignment to system processors is transformed into a type of graph matching, called weak homomorphism. The search of optimal weak homomorphism corresponding to optimal task assignment is next formulated as a state-space search problem. It is then solved by the well-known A* algorithm in artificial intelligence after proper heuristic information for speeding up the search is suggested. An illustrative example and some experimental results are also included to show the effectiveness of the heuristic search.
    Relation: IEEE Transactions on Computers C-34 (3): 197-203
    Appears in Collections:[資訊傳播學系] 期刊論文

    Files in This Item:

    File Description SizeFormat
    0KbUnknown319View/Open
    310904400-4301.doc35KbMicrosoft Word357View/Open


    All items in ASIAIR are protected by copyright, with all rights reserved.


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback