English  |  正體中文  |  简体中文  |  Items with full text/Total items : 90437/105768 (86%)
Visitors : 10972085      Online Users : 507
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/19031

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

    Title: Optimal assignment of task modules with precedence for distributed processing by graph matching and state-space search
    Authors: 王玲玲;Wang, Ling-Ling
    Contributors: 資訊傳播學系
    Date: 1988
    Issue Date: 2012-11-26 15:16:07 (UTC+8)
    Abstract: A graph matching approach to optimal assignment of task modules with varying lengths and precedence relationship in a distributed computing system is proposed. Inclusion of module precedence into the optimal solution is made possible by the use of topological module orderings. Two graphs are defined to represent the processor structure and the module precedence relationship, respectively. Assignment of the task modules to the system processors is transformed into a type of graph matching. The search of optimal graph matching corresponding to optimal task assignment is formulated as a state-space search problem which is then solved by theA* algorithm in artificial intelligence. Illustrative examples and experimental results are included to show the effectiveness of the proposed approach.
    Appears in Collections:[資訊傳播學系] 期刊論文

    Files in This Item:

    File Description SizeFormat

    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