IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-642-57201-2_22.html
   My bibliography  Save this book chapter

Computer Algebra for Automated Performance Modeling of Fortran Programs

In: Computer Algebra in Scientific Computing

Author

Listed:
  • Hermann Mierendorff

    (GMD — German National Research Center for Information Technology, Institute for Algorithms and Scientific Computing (SCAI))

  • Helmut Schwamborn

    (GMD — German National Research Center for Information Technology, Institute for Algorithms and Scientific Computing (SCAI))

Abstract

Time complexity of sequential programs or segments of parallel programs can be estimated using the dynamic frequency of statements and their execution time. The execution time of single statements can be estimated by counting basic operations. The present paper deals with a method of determining the global dynamic frequency of statements by transient analysis of a Markov model. For defining the model automatically and solving the related equations, we use AUGUR which is a research tool for performance modeling of Fortran programs. While static program analysis and model generation are implemented by routine compile techniques, AUGUR uses MAPLE for evaluating expressions, defining transition matrices, and transient analysis. Routines of LAPACK are considered to demonstrate the achievable results.

Suggested Citation

  • Hermann Mierendorff & Helmut Schwamborn, 2000. "Computer Algebra for Automated Performance Modeling of Fortran Programs," Springer Books, in: Victor G. Ganzha & Ernst W. Mayr & Evgenii V. Vorozhtsov (ed.), Computer Algebra in Scientific Computing, pages 285-299, Springer.
    • Handle: RePEc:spr:sprchp:978-3-642-57201-2_22
    DOI: 10.1007/978-3-642-57201-2_22
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-3-642-57201-2_22. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.