dor_id: 4133202

506.#.#.a: Público

590.#.#.d: Los artículos enviados a la revista "Geofísica Internacional", se juzgan por medio de un proceso de revisión por pares

510.0.#.a: Consejo Nacional de Ciencia y Tecnología (CONACyT); Scientific Electronic Library Online (SciELO); SCOPUS, Dialnet, Directory of Open Access Journals (DOAJ); Geobase

561.#.#.u: https://www.geofisica.unam.mx/

650.#.4.x: Físico Matemáticas y Ciencias de la Tierra

336.#.#.b: article

336.#.#.3: Artículo de Investigación

336.#.#.a: Artículo

351.#.#.6: http://revistagi.geofisica.unam.mx/index.php/RGI

351.#.#.b: Geofísica Internacional

351.#.#.a: Artículos

harvesting_group: RevistasUNAM

270.1.#.p: Revistas UNAM. Dirección General de Publicaciones y Fomento Editorial, UNAM en revistas@unam.mx

590.#.#.c: Open Journal Systems (OJS)

270.#.#.d: MX

270.1.#.d: México

590.#.#.b: Concentrador

883.#.#.u: https://revistas.unam.mx/catalogo/

883.#.#.a: Revistas UNAM

590.#.#.a: Coordinación de Difusión Cultural

883.#.#.1: https://www.publicaciones.unam.mx/

883.#.#.q: Dirección General de Publicaciones y Fomento Editorial

850.#.#.a: Universidad Nacional Autónoma de México

856.4.0.u: http://revistagi.geofisica.unam.mx/index.php/RGI/article/view/120/118

100.1.#.a: Herrera Revilla, Ismael; Contreras, Iván; Herrera, Graciela S.

524.#.#.a: Herrera Revilla, Ismael, et al. (2021). The divide-and-conquer framework: a suitable setting for domain decomposition methods of the future. Geofísica Internacional; Vol. 59 Núm. 1: Enero 1, 2020; 27-37. Recuperado de https://repositorio.unam.mx/contenidos/4133202

245.1.0.a: The divide-and-conquer framework: a suitable setting for domain decomposition methods of the future

502.#.#.c: Universidad Nacional Autónoma de México

561.1.#.a: Instituto de Geofísica, UNAM

264.#.0.c: 2021

264.#.1.c: 2020-01-01

653.#.#.a: MDD; DVS-DDM; computación paralela; aceleración paralela ideal; dividir y vencerás; DDM; DVS-DDM; parallel computation; ideal parallel speedup; divide and conquer

506.1.#.a: La titularidad de los derechos patrimoniales de esta obra pertenece a las instituciones editoras. Su uso se rige por una licencia Creative Commons BY-NC-SA 4.0 Internacional, https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode.es, para un uso diferente consultar al responsable jurídico del repositorio por medio del correo electrónico revistagi@igeofisica.unam.mx

884.#.#.k: http://revistagi.geofisica.unam.mx/index.php/RGI/article/view/120

001.#.#.#: 063.oai:revistagi.geofisica.unam.mx:article/120

041.#.7.h: spa

520.3.#.a: 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. doi: https://doi.org/10.22201/igeof.00167169p.2020.59.1.2078

773.1.#.t: Geofísica Internacional; Vol. 59 Núm. 1: Enero 1, 2020; 27-37

773.1.#.o: http://revistagi.geofisica.unam.mx/index.php/RGI

022.#.#.a: ISSN-L: 2954-436X; ISSN impreso: 0016-7169

310.#.#.a: Trimestral

300.#.#.a: Páginas: 27-37

264.#.1.b: Instituto de Geofísica, UNAM

doi: https://doi.org/10.22201/igeof.00167169p.2020.59.1.2078

handle: 00f43ba7fab644ca

harvesting_date: 2023-06-20 16:00:00.0

856.#.0.q: application/pdf

file_creation_date: 2020-01-21 22:50:14.0

file_modification_date: 2022-04-12 02:24:32.0

file_creator: Ismael Herrera-Revilla

file_name: 727945aa3aa53e40b9fea8ddcc4af4c9f8655c2f6e30d0e85769496a582acc4f.pdf

file_pages_number: 11

file_format_version: application/pdf; version=1.4

file_size: 700707

245.1.0.b: The divide-and-conquer framework: a suitable setting for domain decomposition methods of the future

last_modified: 2023-06-20 16:00:00

license_url: https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode.es

license_type: by-nc-sa

No entro en nada

No entro en nada 2

Artículo

The divide-and-conquer framework: a suitable setting for domain decomposition methods of the future

Herrera Revilla, Ismael; Contreras, Iván; Herrera, Graciela S.

Instituto de Geofísica, UNAM, publicado en Geofísica Internacional, y cosechado de Revistas UNAM

Licencia de uso

Procedencia del contenido

Entidad o dependencia
Instituto de Geofísica, UNAM
Revista
Repositorio
Contacto
Revistas UNAM. Dirección General de Publicaciones y Fomento Editorial, UNAM en revistas@unam.mx

Cita

Herrera Revilla, Ismael, et al. (2021). The divide-and-conquer framework: a suitable setting for domain decomposition methods of the future. Geofísica Internacional; Vol. 59 Núm. 1: Enero 1, 2020; 27-37. Recuperado de https://repositorio.unam.mx/contenidos/4133202

Descripción del recurso

Autor(es)
Herrera Revilla, Ismael; Contreras, Iván; Herrera, Graciela S.
Tipo
Artículo de Investigación
Área del conocimiento
Físico Matemáticas y Ciencias de la Tierra
Título
The divide-and-conquer framework: a suitable setting for domain decomposition methods of the future
Fecha
2020-01-01
Resumen
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. doi: https://doi.org/10.22201/igeof.00167169p.2020.59.1.2078
Tema
MDD; DVS-DDM; computación paralela; aceleración paralela ideal; dividir y vencerás; DDM; DVS-DDM; parallel computation; ideal parallel speedup; divide and conquer
Idioma
spa
ISSN
ISSN-L: 2954-436X; ISSN impreso: 0016-7169

Enlaces