Skip to main navigation Skip to search Skip to main content

Estimating Computer Performance for Parallel Sparse QR Factorisation

  • David J Miron
  • , Patrick M Lenders

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Abstract

    Performance estimates of a parallel computer during sparse matrix factorisation aid in the identification of overheads and the tuning of software. This paper proposes a technique which allows the computer parameters of computation speed, communication speed, latency and parallel efficiency to be estimated. The technique is based upon the use of mathematical models derived from a model problem in conjunction with experimental results. By combining the mathematical models with the experimental results, sets of simultaneous equations can be derived which can be solved for the above computer parameters. The technique is explained in the context of sparse QR factorisation.
    Original languageEnglish
    Title of host publicationEuro-Par' 99 Parallel Processing: 5th International Euro-Par Conference Toulouse, France, August 31-September 3, 1999 Proceedings
    EditorsP Amestoy, P Berger, M Dayde, I Duff, V Fraysse, L Giraud, D Ruiz
    Place of PublicationBerlin, Germany
    PublisherSpringer
    Pages1049-1058
    ISBN (Print)9783540483113, 9783540664437
    Publication statusPublished - 1999
    EventEuro-Par' 99: 5th International Euro-Par Conference - Toulouse, France
    Duration: 25 Oct 201228 Oct 2012

    Publication series

    NameLecture Notes in Computer Science
    Number1685
    ISSN (Electronic)0302-9743

    Conference

    ConferenceEuro-Par' 99: 5th International Euro-Par Conference
    CityToulouse, France
    Period25/10/1228/10/12

    Fingerprint

    Dive into the research topics of 'Estimating Computer Performance for Parallel Sparse QR Factorisation'. Together they form a unique fingerprint.

    Cite this