Elements assigned approximately optimally to subdomains. Mapping algorithm based on simulated-annealing concept used to minimize approximate time required to perform finite-element computation on hypercube computer or other network of parallel data processors. Mapping algorithm needed when shape of domain complicated or otherwise not obvious what allocation of elements to subdomains minimizes cost of computation.


    Access

    Access via TIB

    Check availability in my library


    Export, share and cite



    Title :

    Assignment Of Finite Elements To Parallel Processors


    Contributors:

    Published in:

    Publication date :

    1990-02-01



    Type of media :

    Miscellaneous


    Type of material :

    No indication


    Language :

    English





    Graph-Based Dynamic Assignment Of Multiple Processors

    Hayes, Paul J. / Andrews, Asa M. | NTRS | 1994


    Airfoil Design Utilizing Parallel Processors

    Brawley, S.C. | Online Contents | 1996



    Fast, Massively Parallel Data Processors

    Heaton, Robert A. / Blevins, Donald W. / Davis, ED | NTRS | 1994