IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-540-27912-9_4.html
   My bibliography  Save this book chapter

Computing the Least Squares Inverse of Sparse Matrices on a Network of Clusters

In: Current Trends in High Performance Computing and Its Applications

Author

Listed:
  • Baolai Ge

    (The University of Western Ontario, SHARCNET)

Abstract

Summary This paper describes the calculation of the least square inverse of sparse matrices and the use of load balancing schemes for parallel processing in a heterogeneous environment. Due to the variation of number of non zero entries to be calculated row wise, as well as the difference of processor speeds, load imbalance may occur and have an impact on the performance. To improve the performance by keeping processors as busy as possible the redistribution of tasks and data is needed. We present an architecture and implementation outlines of a few load balancing schemes featured with one-sided communications in a framework of multithreading. We show through our tests that the use of load balancing schemes can improve the performance in some cases.

Suggested Citation

  • Baolai Ge, 2005. "Computing the Least Squares Inverse of Sparse Matrices on a Network of Clusters," Springer Books, in: Wu Zhang & Weiqin Tong & Zhangxin Chen & Roland Glowinski (ed.), Current Trends in High Performance Computing and Its Applications, pages 37-46, Springer.
    • Handle: RePEc:spr:sprchp:978-3-540-27912-9_4
    DOI: 10.1007/3-540-27912-1_4
    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-540-27912-9_4. 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.