Advertisement

Visualization of Parallel Execution Graphs

  • Björn Steckelbach
  • Till Bubeck
  • Ulrich Fößmeier
  • Michael Kaufmann
  • Marcus Ritt
  • Wolfgang Rosenstiel
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1547)

Abstract

Measuring and evaluating the runtime of parallel programs is a difficult task. In this paper we present tools for performance evaluation and visualization in the distributed thread system (DTS), a programming environment for portable parallel applications. We describe the visualization of a parallel trace log as an execution graph using a novel layout algorithm which has been tailored to expose the structure of multithreaded applications.

Keywords

Parallel Execution Parallel Application Graph Grammar Runtime System Call Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. [1]
    T. Bubeck. Eine Systemumgebung zum verteilten funktionalen Rechnen. Technical Report WSI-93-8, Eberhard-Karls-Universität Tübingen, August1993.Google Scholar
  2. [2]
    T. Bubeck. Distributed Threads System DTS User’s Guide. SFB 382/C6, Universität Tübingen, Sep 1995.Google Scholar
  3. [3]
    T. Bubeck, J. Schreiner, and W. Rosenstiel. Timing multi-threaded Message-Passing Programs. In C. A. Héritier, editor, SIPAR Workshop 96, pages 15–18, University of Geneva, Oct1996.Google Scholar
  4. [4]
    A. Dingle and H. Sudborough. The complexity of single row routing problems, volume LNCS 382, pages 529–540, 1989.Google Scholar
  5. [5]
    Farrow, Kennedy, and Zucconi. Graph grammars and global data flow analysis, pages 42–56, 1976.Google Scholar
  6. [6]
    M. Garey and D. Johnson. Computers and Intractability. Freeman, 1979.Google Scholar
  7. [7]
    M. Golumbic. Algorithmic Graph Theory and Perfect Graphs. Academ. Press, 1980.Google Scholar
  8. [8]
    S. Masuda, K. Nakajima, T. Kashiwabara, and T. Fujisawa. Crossing minimization in linear embeddings of graphs. IEEE Transactions on CAD, 39:124–127, 1990.CrossRefMathSciNetGoogle Scholar
  9. [9]
    R. Raghavan and S. Sahni. Single row routing. IEEE Transactions on Computers, C-32:209–220, 1983.CrossRefGoogle Scholar
  10. [10]
    T. Tarng, M. Marek-Sadowska, and E. Kuh. An efficient single row routing algorithm. IEEE Transactions on CAD, CAD-3:178–183, 1984.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Björn Steckelbach
    • 1
  • Till Bubeck
    • 1
  • Ulrich Fößmeier
    • 2
  • Michael Kaufmann
    • 1
  • Marcus Ritt
    • 1
  • Wolfgang Rosenstiel
    • 1
  1. 1.Wilhelm-Schickard-InstitutUniversität TübingenTübingenGermany
  2. 2.Tom Sawyer SoftwareBerkeley

Personalised recommendations