Skip to main content
Springer Nature Link
Log in

Visualizing the iteration space in PEFPT

  • Conference paper
  • First Online:
High-Performance Computing and Networking (HPCN-Europe 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1225))

Included in the following conference series:

  • 107 Accesses

Abstract

Sufficient and precise semantic information is essential to interactive parallel programming. In this paper, we present a feasible implementation of the iteration space dependence graph and discuss relevant technical problems. Moreover, we give a further prospect of interactive loop parallelization guided by the graph.

This work was supported in part by European Community under grant ITDC'94-164 and by the Ministry of Education, project CHIN9504

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Michael Wolfe, “Optimizing Supercompilers for Supercomputers”, Ph.D. thesis, University of Illinois, 1982.

    Google Scholar 

  2. Utpal Banerjee, “Dependence Analysis for Supercomputing”, Kluwer Academic Publishers, 1988.

    Google Scholar 

  3. G. Goff, K. Kennedy, and C.-W. Tseng, “Practical Dependence Testing” Proceedings of the ACM SIGPLAN '91 Conference on Programming Language Design and Implementation (PLDI'91), SIGPLAN Notices, 26(2), June 1991.

    Google Scholar 

  4. K.McKinliey, “Evaluation Automatic Parallelizationfor Efficient Execution on Shared Memory Multiprocessors”, ICS'94, pp.54–63, 1994.

    Google Scholar 

  5. W.Blume and R.Eigenmann, “Performance Analysis of Parallelizing Compilers on the Perfect Benchmarks Programs”, IEEE Transaction on Parallel Distributed Systems, 3(6), pp. 643–656, Nov. 1992.

    Google Scholar 

  6. K. Cooper et al., “The ParaScope Parallel Programming Environment”, Proceedings of the IEEE, 81(2), Feb. 1993.

    Google Scholar 

  7. C.D.Polychronopoulos et al, “Parafrase-2: An Environment for Parallelizing, Partitioning, Synchronizing, and Scheduling Programs on Multiprocessors”, Inter. Conference on Parallel processing, pp. II-39–II48 1989.

    Google Scholar 

  8. F.B.Zhang “The FPT Parallel Programming Environment”, Ph.D. thesis, University of Gent, 1996.

    Google Scholar 

  9. Q.Wang, Y.J.Yu and E.H.D'Hollander, “Interactive Programming using PEFPT”, Syllabus of the Parallel Computing Seminar, T.U.Delft, pp. 125–130 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Electrical Engineering, University of Ghent, St.-Pietersnieuwstraat 41, B-9000, Ghent

    Qi Wang, Yu Yijun & Erik D'Hollander

Authors
  1. Qi Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yu Yijun
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Erik D'Hollander
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Bob Hertzberger Peter Sloot

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wang, Q., Yijun, Y., D'Hollander, E. (1997). Visualizing the iteration space in PEFPT. In: Hertzberger, B., Sloot, P. (eds) High-Performance Computing and Networking. HPCN-Europe 1997. Lecture Notes in Computer Science, vol 1225. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0031662

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-62898-9

  • Online ISBN: 978-3-540-69041-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation