Downloads: 349

Files in This Item:
File Description SizeFormat 
ipsjjip.22.642.pdf1.62 MBAdobe PDFView/Open
Full metadata record
DC FieldValueLanguage
dc.contributor.authorIda, Akihiroen
dc.contributor.authorIwashita, Takeshien
dc.contributor.authorMifune, Takeshien
dc.contributor.authorTakahashi, Yasuhitoen
dc.contributor.alternative伊田, 明弘ja
dc.description.abstractWe discuss a scheme for hierarchical matrices with adaptive cross approximation on symmetric multiprocessing clusters. We propose a set of parallel algorithms that are applicable to hierarchical matrices. The proposed algorithms are implemented using the flat-MPIand hybrid MPI+OpenMP programming models. The performance of these implementations is evaluated using an electric field analysis computed on two symmetric multiprocessing cluster systems. Although the flat-MPI version gives better parallel scalability when constructing hierarchical matrices, the speed-up reaches a limit in the hierarchical matrix-vector multiplication. We succeeded in developing a hybrid MPI+OpenMP version to improve the parallel scalability. In numerical experiments, the hybrid version exhibits a better parallel speed-up for the hierarchical matrix-vector multiplication up to 256 cores.en
dc.publisherInformation Processing Society of Japanen
dc.rights© 2014 by the Information Processing Society of Japanen
dc.subjectboundary element methoden
dc.subjectmatrix approximationen
dc.subjecthierarchical matricesen
dc.subjectadaptive cross approximationen
dc.subjectparallel scalabilityen
dc.subjectsymmetric multiprocessing clustersen
dc.titleParallel Hierarchical Matrices with Adaptive Cross Approximation on Symmetric Multiprocessing Clustersen
dc.typejournal article-
dc.type.niitypeJournal Article-
dc.identifier.jtitleJournal of Information Processingen
dcterms.accessRightsopen access-
Appears in Collections:Journal Articles

Show simple item record

Export to RefWorks

Export Format: 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.