淡江大學機構典藏:Item 987654321/59899
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 62819/95882 (66%)
Visitors : 4010307      Online Users : 990
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU 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
    Home ‧ Login ‧ Upload ‧ Help ‧ About ‧ Administer Goto mobile version


    Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/59899


    Title: Efficient index generation for compiling two-level mappings in data-parallel programs
    Authors: Shih, Kuei-ping;Sheu, Jang-ping;Huang, Chua-huang;Chang, Chih-yung
    Contributors: 淡江大學資訊工程學系
    Keywords: communication set;distributed-memory multicomputers;high performance Fortran;hole compression;two-level data-processor mapping
    Date: 2000-02
    Issue Date: 2011-10-05 22:25:11 (UTC+8)
    Publisher: Maryland Heights: Academic Press
    Abstract: This paper presents compilation techniques used to compress holes, which are caused by the nonunit alignment stride in a two-level data-processor mapping. Holes are the memory locations mapped by useless template cells. To fully utilize the memory space, memory holes should be removed. In a two-level data-processor mapping, there is a repetitive pattern for array elements mapped onto processors. We classify blocks into classes and use a class table to record the distribution of each class in the first repetitive data distribution pattern. Similarly, data distribution on a processor also has a repetitive pattern. We use a compression table to record the distribution of each block in the first repetitive data distribution pattern on a processor. By using a class table and a compression table, hole compression can be easily and efficiently achieved. Compressing holes can save memory usage, improve spatial locality and further improve system performance. The proposed method is efficient, stable, and easy to implement. The experimental results do confirm the advantages of our proposed method over existing methods.
    Relation: Journal of Parallel and Distributed Computing 60(2), pp.189-216
    DOI: 10.1006/jpdc.1999.1601
    Appears in Collections:[Graduate Institute & Department of Computer Science and Information Engineering] Journal Article

    Files in This Item:

    File Description SizeFormat
    0743-7315_60(2)_p189-216.pdf710KbAdobe PDF245View/Open

    All items in 機構典藏 are protected by copyright, with all rights reserved.

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