| Literature DB >> 9214799 |
H I Saleheen1, P D Claessen, K T Ng.
Abstract
In this paper, a data-parallel computer is used to provide the memory and reduction in computer time for solving large finite-difference bidomain problems. The finite-difference grid is mapped effectively to the processors of the parallel computer, simply by mapping one node to one (virtual) processor. Implemented on the connection machines (CM's) CM-200 and CM-5, the data-parallel finite-difference algorithm has allowed the solution of finite-difference bidomain problems with over 2 million nodes. Details on the algorithm are presented together with computational performance results.Mesh:
Year: 1997 PMID: 9214799 DOI: 10.1109/10.552249
Source DB: PubMed Journal: IEEE Trans Biomed Eng ISSN: 0018-9294 Impact factor: 4.538