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.
Assignment Of Finite Elements To Parallel Processors
NASA Tech Briefs ; 14 , 2
1990-02-01
Miscellaneous
No indication
English
Graph-Based Dynamic Assignment of Multiple Processors
Online Contents | 1994
Graph-Based Dynamic Assignment Of Multiple Processors
NTRS | 1994
|Airfoil Design Utilizing Parallel Processors
Online Contents | 1996
|Fast, Massively Parallel Data Processors
Online Contents | 1994
Fast, Massively Parallel Data Processors
NTRS | 1994
|