Addressing the computational cost of large EIT solutions

被引:17
作者
Boyle, Alistair [1 ]
Borsic, Andrea [2 ]
Adler, Andy [1 ]
机构
[1] Carleton Univ, Ottawa, ON K1S 5B6, Canada
[2] Dartmouth Coll, Thayer Sch Engn, Hanover, NH 03755 USA
基金
加拿大自然科学与工程研究理事会;
关键词
electrical impedance tomography; finite-element method; distributed; computing; sparse linear algebra; IMPEDANCE TOMOGRAPHY; RECONSTRUCTION; GENERATION; ALGORITHM; LAW;
D O I
10.1088/0967-3334/33/5/787
中图分类号
Q6 [生物物理学];
学科分类号
071011 ;
摘要
Electrical impedance tomography (EIT) is a soft field tomography modality based on the application of electric current to a body and measurement of voltages through electrodes at the boundary. The interior conductivity is reconstructed on a discrete representation of the domain using a finite-element method (FEM) mesh and a parametrization of that domain. The reconstruction requires a sequence of numerically intensive calculations. There is strong interest in reducing the cost of these calculations. An improvement in the compute time for current problems would encourage further exploration of computationally challenging problems such as the incorporation of time series data, wide-spread adoption of three-dimensional simulations and correlation of other modalities such as CT and ultrasound. Multicore processors offer an opportunity to reduce EIT computation times but may require some restructuring of the underlying algorithms to maximize the use of available resources. This work profiles two EIT software packages (EIDORS and NDRM) to experimentally determine where the computational costs arise in EIT as problems scale. Sparse matrix solvers, a key component for the FEM forward problem and sensitivity estimates in the inverse problem, are shown to take a considerable portion of the total compute time in these packages. A sparse matrix solver performance measurement tool, Meagre-Crowd, is developed to interface with a variety of solvers and compare their performance over a range of two-and three-dimensional problems of increasing node density. Results show that distributed sparse matrix solvers that operate on multiple cores are advantageous up to a limit that increases as the node density increases. We recommend a selection procedure to find a solver and hardware arrangement matched to the problem and provide guidance and tools to perform that selection.
引用
收藏
页码:787 / 800
页数:14
相关论文
共 34 条
[1]   Uses and abuses of EIDORS: an extensible software base for EIT [J].
Adler, A ;
Lionheart, WRB .
PHYSIOLOGICAL MEASUREMENT, 2006, 27 (05) :S25-S42
[2]  
Amdahl G. M., 1967, P APR 18 20 1967 SPR, P483, DOI [10.1145/1465482.1465560, DOI 10.1145/1465482.1465560]
[3]   Hybrid scheduling for the parallel solution of linear systems [J].
Amestoy, PR ;
Guermouche, A ;
L'Excellent, JY ;
Pralet, S .
PARALLEL COMPUTING, 2006, 32 (02) :136-156
[4]  
[Anonymous], 2006, 2006 IEEE ACM INT C, DOI [DOI 10.1109/ICCAD.2006.320067, DOI 10.1145/1233501.1233516]
[5]   3D Electric Impedance Tomography Reconstruction on Multi-Core Computing Platforms [J].
Borsic, Andrea ;
Hartov, Alexander ;
Paulsen, Keith D. ;
Manwaring, Preston .
2008 30th Annual International Conference of the IEEE Engineering in Medicine and Biology Society, Vols 1-8, 2008, :1175-1177
[6]  
Boyle A, 2011, 12 C EL IMP TOM U BA
[7]  
Breckon WR, 1990, THESIS OXFORD POLYTE
[8]  
BUNCH JR, 1977, MATH COMPUT, V31, P163, DOI 10.1090/S0025-5718-1977-0428694-0
[9]   Algorithm 887: CHOLMOD, Supernodal Sparse Cholesky Factorization and Update/Downdate [J].
Chen, Yanqing ;
Davis, Timothy A. ;
Hager, William W. ;
Rajamanickam, Sivasankaran .
ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 2008, 35 (03)
[10]   Algorithm 832: UMFPACK V4.3 - An unsymmetric-pattern multifrontal method [J].
Davis, TA .
ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 2004, 30 (02) :196-199