English  |  正體中文  |  简体中文  |  Items with full text/Total items : 54367/62174 (87%)
Visitors : 15219905      Online Users : 73
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTHU 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
    National Tsing Hua University Institutional Repository > 電機資訊學院 > 資訊工程學系 > 期刊論文 >  Applications and performance analysis of a compile-timeoptimization approach for list scheduling algorithms on distributedmemory multiprocessors

    Please use this identifier to cite or link to this item: http://nthur.lib.nthu.edu.tw/dspace/handle/987654321/12777

    Title: Applications and performance analysis of a compile-timeoptimization approach for list scheduling algorithms on distributedmemory multiprocessors
    Authors: Yeh-Ching Chung
    Ranka, S.
    教師: 鍾葉青
    Date: 1992
    Publisher: Institute of Electrical and Electronics Engineers Inc
    Relation: Supercomputing'92.Proceedings,16-20 Nov.1992, Page(s):512-521
    Keywords: directed graphs
    distributed memory systems
    performance evaluation
    program compilers
    Abstract: The authors discuss applications of BTDH (bottom-up top-down duplication heuristic) to list scheduling algorithms (LSAs). There are two ways to use BTDH for LSAs. BTDH can be used with an LSA to form a new scheduling algorithm (LSA/BTDH), and it can be used as a pure optimization algorithm for an LSA (LSA-BTDH). BTDH has been applied with two well-known LSAs: the highest level first with estimated time (HLFET) and the earlier task first (ETF) heuristics. Simulation results show that, given a directed acyclic growth (DAG), the graph parallelism of the DAG can accurately predict the number of processors to be used such that a good scheduling length and a good resource utilization (or efficiency) can be achieved simultaneously. In terms of speedups, LSA/BTDH ⩾ LSA-BTDH ⩾ ETF ⩾ HLFET. Experimental results of scheduling FFT programs, which are written in a single program multiple data (SPMD) programming approach, on NCUBE-2 are also presented. The results confirm the simulation results and show that the speedups of LSA/BTDH and LSA-BTDH are better than the speedups of LSAs
    Relation Link: http://ieeexplore.ieee.org/Xplore/dynhome.jsp
    URI: http://nthur.lib.nthu.edu.tw/handle/987654321/12777
    Appears in Collections:[資訊工程學系] 期刊論文
    [資訊系統與應用研究所] 期刊論文
    [電腦與通訊科技研發中心] 期刊論文

    Files in This Item:

    File Description SizeFormat
    2030220010036.pdf1020KbAdobe PDF997View/Open


    SFX Query


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