The divide-and-conquer framework: a suitable setting for domain decomposition methods of the future
This paper was prompted by numerical experiments we performed, in which algorithms that Ismael Herrera Research Group previously developed (the DVS-BDDC) and are already available in the literature, yielded accelerations (or, speedups) many times larger (more than seventy in some examples already tr...
| Autores: | , , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2020 |
| País: | México |
| Institución: | Universidad Nacional Autónoma de México |
| Repositorio: | Redalyc-UNAM |
| OAI Identifier: | oai:redalyc.org:56872303003 |
| Acceso en línea: | https://www.redalyc.org/articulo.oa?id=56872303003 https://www.redalyc.org/journal/568/56872303003/ https://www.redalyc.org/journal/568/56872303003/html/ https://www.redalyc.org/journal/568/56872303003/56872303003.epub https://www.redalyc.org/journal/568/56872303003/movil |
| Access Level: | acceso abierto |
| Palabra clave: | Ciencias de la Tierra DDM DVS divide and conquer parallel computation ideal parallel speedup |
| Sumario: | This paper was prompted by numerical experiments we performed, in which algorithms that Ismael Herrera Research Group previously developed (the DVS-BDDC) and are already available in the literature, yielded accelerations (or, speedups) many times larger (more than seventy in some examples already treated, but probably often much larger) than the number of processors used. Based on such outstanding results, this paper shows that believing that the ideal speedup is equal to the number of processors, has limited the performance-goal sought by researchers on domain decomposition methods (DDM) and has hindered much its development, thus far. Hence, an improved theory in which the speedup goal is based on the Divide and Conquer algorithmic paradigm, frequently considered as the leitmotiv of domain decomposition methods, is proposed as a suitable setting for the DDM of the future. |
|---|