Towards Green Multi-frontal Solver for Adaptive Finite Element Method
Name:
1-s2.0-S1877050915010480-main.pdf
Size:
2.272Mb
Format:
PDF
Description:
Main article
Type
Conference PaperKAUST Department
Applied Mathematics and Computational Science ProgramComputer Science Program
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
Date
2015-06-01Online Publication Date
2015-06-01Print Publication Date
2015Permanent link to this record
http://hdl.handle.net/10754/556613
Metadata
Show full item recordAbstract
In this paper we present the optimization of the energy consumption for the multi-frontal solver algorithm executed over two dimensional grids with point singularities. The multi-frontal solver algorithm is controlled by so-called elimination tree, defining the order of elimination of rows from particular frontal matrices, as well as order of memory transfers for Schur complement matrices. For a given mesh there are many possible elimination trees resulting in different number of floating point operations (FLOPs) of the solver or different amount of data trans- ferred via memory transfers. In this paper we utilize the dynamic programming optimization procedure and we compare elimination trees optimized with respect to FLOPs with elimination trees optimized with respect to energy consumption.Citation
Towards Green Multi-frontal Solver for Adaptive Finite Element Method 2015, 51:984 Procedia Computer SciencePublisher
Elsevier BVJournal
Procedia Computer ScienceConference/Event name
International Conference on Computational Science, ICCS 2002Additional Links
http://linkinghub.elsevier.com/retrieve/pii/S1877050915010480ae974a485f413a2113503eed53cd6c53
10.1016/j.procs.2015.05.240