Texas A&M University LibrariesTexas A&M University LibrariesTexas A&M University Libraries
    • Help
    • Login
    OAKTrust
    View Item 
    •   OAKTrust Home
    • Colleges and Schools
    • Office of Graduate and Professional Studies
    • Electronic Theses, Dissertations, and Records of Study (2002– )
    • View Item
    •   OAKTrust Home
    • Colleges and Schools
    • Office of Graduate and Professional Studies
    • Electronic Theses, Dissertations, and Records of Study (2002– )
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Partitioning Optimization for Massively Parallel Transport Sweeps on Unstructured Grids

    Thumbnail
    View/ Open
    GHADDAR-DISSERTATION-2019.pdf (1.619Mb)
    Date
    2019-11-04
    Author
    Ghaddar, Tarek
    Metadata
    Show full item record
    Abstract
    The field of radiation transport studies the distribution of radiation throughout a seven-dimensional phase-space consisting of time, space, energy, and direction. Radiation transport is described by the Boltzmann equation that can be solved stochastically or deterministically. The work presented in this dissertation utilizes the deterministic method known as the transport sweep, a popular technique that has been the subject of a large amount of research. We specifically focus on the parallel implementations of the transport sweep, and predicting the time it takes to sweep across a structured or unstructured mesh given a set of partitioning parameters, achieved through a time-to-solution estimator, written in Python. The time-to-solution estimator is tested against PDT, Texas A&M’s massively deterministic transport code. The time-to-solution estimator’s sweep time is within 10% of PDT’s sweep time for the majority of problems tested. We use the time-to-solution estimator as the objective function in an optimization scheme to attempt to get the partitions that lead to the fastest sweep time for a given problem and partitioning scheme. Two optimization methods are discussed: using a black box tool (scipy’s optimize library) and an intuitive method that prioritizes placing partitions in mesh locations that does not increase the number of cells (which we chose to name the CDF method). The time-to-solution estimator proved to not be smooth enough for a black box tool to work, so the CDF optimization method became the primary method. The CDF method proved effective for the majority of problems run, improving the time to solution over previously used partitioning schemes
    URI
    https://hdl.handle.net/1969.1/188736
    Subject
    transport sweeps
    massively parallel
    unstructured
    Collections
    • Electronic Theses, Dissertations, and Records of Study (2002– )
    Citation
    Ghaddar, Tarek (2019). Partitioning Optimization for Massively Parallel Transport Sweeps on Unstructured Grids. Doctoral dissertation, Texas A&M University. Available electronically from https : / /hdl .handle .net /1969 .1 /188736.

    DSpace software copyright © 2002-2016  DuraSpace
    Contact Us | Send Feedback
    Theme by 
    Atmire NV
     

     

    Advanced Search

    Browse

    All of OAKTrustCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsDepartmentTypeThis CollectionBy Issue DateAuthorsTitlesSubjectsDepartmentType

    My Account

    LoginRegister

    Statistics

    View Usage Statistics
    Help and Documentation

    DSpace software copyright © 2002-2016  DuraSpace
    Contact Us | Send Feedback
    Theme by 
    Atmire NV