English  |  正體中文  |  简体中文  |  Items with full text/Total items : 62805/95882 (66%)
Visitors : 3868249      Online Users : 315
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
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/71433

    Title: Efficient Address Generation for Affine Subscripts in Data-Parallel Programs
    Authors: Shih, Kuei-Ping;Sheu, Jang-Ping;Chang, Chih-Yung
    Contributors: 淡江大學資訊工程學系
    Keywords: Algorithms;Codes (symbols);Computational complexity;Data communication systems;Data processing;FORTRAN (programming language);Iterative methods;Parallel processing systems;Storage allocation (computer);Data parallel programs;Distributed memory multicomputers;Multiple induction variables;Single program multiple data;Program compilers
    Date: 2000-01
    Issue Date: 2013-03-12 11:23:08 (UTC+8)
    Publisher: Dordrecht: Kluwer Academic Publishers
    Relation: Journal of Supercomputing 17(2), pp.205-227
    DOI: 10.1023/A:1008190606079
    Appears in Collections:[Graduate Institute & Department of Computer Science and Information Engineering] Journal Article

    Files in This Item:

    File SizeFormat

    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