• Login
    View Item 
    •   Home
    • Research
    • Conference Papers
    • View Item
    •   Home
    • Research
    • Conference Papers
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of KAUSTCommunitiesIssue DateSubmit DateThis CollectionIssue DateSubmit Date

    My Account

    Login

    Quick Links

    Open Access PolicyORCID LibguideTheses and Dissertations LibguideSubmit an Item

    Statistics

    Display statistics

    Towards Green Multi-frontal Solver for Adaptive Finite Element Method

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Thumbnail
    Name:
    1-s2.0-S1877050915010480-main.pdf
    Size:
    2.272Mb
    Format:
    PDF
    Description:
    Main article
    Download
    Type
    Conference Paper
    Authors
    AbbouEisha, H.
    Moshkov, Mikhail cc
    Jopek, K.
    Gepner, P.
    Kitowski, J.
    Paszyn'ski, M.
    KAUST Department
    Applied Mathematics and Computational Science Program
    Computer Science Program
    Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
    Date
    2015-06-01
    Online Publication Date
    2015-06-01
    Print Publication Date
    2015
    Permanent link to this record
    http://hdl.handle.net/10754/556613
    
    Metadata
    Show full item record
    Abstract
    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 Science
    Publisher
    Elsevier BV
    Journal
    Procedia Computer Science
    Conference/Event name
    International Conference on Computational Science, ICCS 2002
    DOI
    10.1016/j.procs.2015.05.240
    Additional Links
    http://linkinghub.elsevier.com/retrieve/pii/S1877050915010480
    ae974a485f413a2113503eed53cd6c53
    10.1016/j.procs.2015.05.240
    Scopus Count
    Collections
    Conference Papers; Applied Mathematics and Computational Science Program; Computer Science Program; Computer, Electrical and Mathematical Science and Engineering (CEMSE) Division

    entitlement

     
    DSpace software copyright © 2002-2022  DuraSpace
    Quick Guide | Contact Us | KAUST University Library
    Open Repository is a service hosted by 
    Atmire NV
     

    Export search results

    The export option will allow you to export the current search results of the entered query to a file. Different formats are available for download. To export the items, click on the button corresponding with the preferred download format.

    By default, clicking on the export buttons will result in a download of the allowed maximum amount of items. For anonymous users the allowed maximum amount is 50 search results.

    To select a subset of the search results, click "Selective Export" button and make a selection of the items you want to export. The amount of items that can be exported at once is similarly restricted as the full export.

    After making a selection, click one of the export format buttons. The amount of items that will be exported is indicated in the bubble next to export format.