English  |  正體中文  |  简体中文  |  Items with full text/Total items : 54367/62174 (87%)
Visitors : 14643207      Online Users : 184
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 > 電機資訊學院 > 電機工程學系 > 期刊論文 >  Bounds on the speedup and efficiency of partial synchronization in parallel processing systems

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

    Title: Bounds on the speedup and efficiency of partial synchronization in parallel processing systems
    Authors: Chang, C.S.;Nelson, R.
    教師: 張正尚
    Date: 1995
    Publisher: Association for Computing Machinery (ACM)
    Relation: JOURNAL OF THE ASSOCIATION FOR COMPUTING MACHINERY, Association for Computing Machinery (ACM), Volume 42, Issue 1, Jan 1995, Pages 204-231
    Keywords: bounds on the speedup
    Abstract: In this paper, we derive bounds on the speedup and efficiency of applications that schedule tasks on a set of parallel processors. We assume that the application runs an algorithm that consists of N iterations and before starting its i+1st iteration, a processor must wait for data (i.e., synchronize) calculated in the ith iteration by a subset of the other processors of the system. Processing times and interconnections between iterations are modeled by random variables with possibly deterministic distributions. Scientific applications consisting of iterations of recursive equations are examples of such applications that can be modeled within this formulation. We consider the efficiency of applications and show that, although efficiency decreases with an increase in the number of processors, it has a nonzero limit when the number of processors increases to infinity. We obtain a lower bound for the efficiency by solving an equation that depends on the distribution of task service times and the expected number of tasks needed to be synchronized. We also show that the lower bound is approached if the topology of the processor graph is ldquo;spread-out,” a notion we define in the paper.
    Relation Link: http://www.acm.org/
    URI: http://nthur.lib.nthu.edu.tw/dspace/handle/987654321/72571
    Appears in Collections:[電機工程學系] 期刊論文

    Files in This Item:

    File Description SizeFormat


    SFX Query


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