An efficient and robust localization scheme on massively distributed systems
| Autor: | Rajiv Shenoy, Michael A. Park, Marilyn J. Smith |
|---|---|
| Rok vydání: | 2014 |
| Předmět: |
Scheme (programming language)
Numerical Analysis Theoretical computer science Hierarchy (mathematics) Applied Mathematics General Engineering Process (computing) Grid Domain (software engineering) Search algorithm Element (category theory) Interrupt Algorithm computer Mathematics computer.programming_language |
| Zdroj: | International Journal for Numerical Methods in Engineering. 101:470-488 |
| ISSN: | 0029-5981 |
| DOI: | 10.1002/nme.4812 |
| Popis: | Summary A parallel localization scheme is presented to enable solution transfers between unstructured grids. The scheme relies on neighbor walks to reduce the number of candidate elements that are visited to find the enclosing element. An advancing front method efficiently allows a subset of nodes to efficiently sweep through the grid, progressively reducing search spaces. The algorithm is parallelized permitting solution transfers over arbitrary grid decompositions. A hierarchical localization process helps prevent the neighbor walk algorithm from failing when encountering the boundaries of a concave domain by localizing the boundaries before the interior of the domain is localized. Random selections of the next step interrupt cyclic loops that may occur during a neighbor walk. The complexity of the search algorithm is verified over parallel decompositions and is effectively independent of the number of partitions. Copyright © 2014 John Wiley & Sons, Ltd. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Plný text