Skip to main content
SpringerLink
Log in

Speedup studies of leading iteration model for non-DO loops in comparison with sequential iteration model

  • Regular Papers
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

In this paper, we present an approximate formula for calculating the speedup of a concurrent non-DO loop. The execution pattern of a concurrent non-DO loop is analyzed. As a result, the optimal concurrent step for a non-DO loop is presented and proved. With the analysis of the speedup of a concurrent non-DO loop, a simple and useful approximate formula is deduced, which is just the mathematical limit of speedup when the number of iterations is approaching infinity.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. M.J. Wolfe, Optimizing Supercompilers for Supercomputer, PH.D. Thesis, University of Illinois at Urbran-Champaign, 1982.

  2. C. D. Polychronopoulos, D. J. Kuck, and D. A. Padua, Execution of Parallel Loops on Parallel Processor Systems, Proc. of the 1986 ICPP.

  3. S. P. Midkiff and D. A. Padua, Compiler Generated Synchronization for DO Loops, Proc. of the 1986 ICPP.

  4. R. Cytron, Doacross: Beyond Vectorization for Multiprocessors, Proc. of the 1986 ICPP.

  5. D. Callahan, A Global Approach to Detection of Parallelism, Rice COMP TR86-40, May 1986.

  6. R. Stron and S. Yemini, Synthesizing Distributed and Parallel Programs through Optimistic Transformations, Proc. of the 1985 ICPP.

  7. Fan Zhihua, The tracing subscript method for vectorization of serial arithmetic,Scientia Sinica (Series A),3 (1983).

  8. Guo Qiang and Chen Haibo, The relevance analysis approach to vectorization,Chinese Journal of Computers,8:5 (1985), 342–349.

    Google Scholar 

  9. Guo Qiang and Chen Haibo, Interval segmentation techniques in vectorization,Chinese Journal of Computers,8:5 (1985), 331–341.

    Google Scholar 

  10. Chen Haibo and Yun-Gui Ci, Parallel Execution of Non-DO Loops, Proc. of the 1987 ICPP. CIT Comp TR87-6101.

  11. Chen Haibo and Yun-Gui Ci, Optimization for the Parallel Execution of Non-DO Loops under Leading Iteration Model, CIT Comp TR87-6102.

Download references

Author information

Authors and Affiliations

  1. Changsha Institute of Technology, Changsha, China

    Chen Haibo & Ci Yungui

Authors
  1. Chen Haibo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ci Yungui
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chen, H., Ci, Y. Speedup studies of leading iteration model for non-DO loops in comparison with sequential iteration model. J. of Comput. Sci. & Technol. 4, 147–154 (1989). https://doi.org/10.1007/BF02943362

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02943362

Keywords

Search

Navigation