• DocumentCode
    3050632
  • Title

    Jinv: A Parallel Method for Distributed Matrix Inversion

  • Author

    Sahota, Vijay ; Bayford, Richard

  • Author_Institution
    Sch. of Health & Social Sci., Middlesex Univ., London, UK
  • fYear
    2010
  • fDate
    6-8 Sept. 2010
  • Firstpage
    163
  • Lastpage
    167
  • Abstract
    The past few years have seen the Grid maturing towards a final product, along with an increased popularity with researchers simulating their projects which contain some form of matrix inversion. The inversion of a matrix is very resource intensive and is often limited to either a Grid nodes CPU or memory capacity. This paper presents Jinv; a distributable matrix inversion solution. Developed using Jama, a linear algebra package for Java; it adopts a divide and conquer approach to tackle the main part of LU decomposition, matrix multiplication. Having implemented Jinv, initial tests have shown Jinv to be scalable and provide a working proof of concept. However it highlights the need for a more memory bandwidth efficient method to eliminate memory racing when executed on a single node.
  • Keywords
    Java; grid computing; matrix multiplication; Java; Jinv; LU decomposition; distributed matrix inversion; grid nodes CPU; matrix multiplication; memory racing; Bandwidth; Instruction sets; Java; Matrix decomposition; Memory management; Tomography; EIT; Grid Computing; Inverse problem; Jama; LU decomposition;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Developments in E-systems Engineering (DESE), 2010
  • Conference_Location
    London
  • Print_ISBN
    978-1-4244-8044-9
  • Type

    conf

  • DOI
    10.1109/DeSE.2010.34
  • Filename
    5633686