María J. Martín

Dr. María J. Martín

orcid

Research Focus & Metrics

Academic Career Length

33Years (1994-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
4 June 2016 in Mathematische Annalen
Verified
Journal Article
Open access
PDF file
OCOlivia Constantin
Olivia Constantin
MMMaría J. Martín
María J. Martín
We obtain a complete solution to the problem of classifying all two-dimensional ideal fluid flows with harmonic Lagrangian labelling maps; thus, we explicitly provide all solutions, with the specified structural property, to the incompressible two-dimensional Euler equations (in Lagrangian variables).

17 November 2009 in Concurrency and Computation: Practice and Experience
Verified
Journal Article
Closed access
PDF file
GRGabriel Rodríguez
Gabriel Rodríguez
MMMaría J. Martín
María J. Martín
PGPatricia González
Patricia González
JTJuan Touriño
Juan Touriño
RDRamón Doallo
Ramón Doallo

1 February 2019 in Future Generation Computer Systems
Verified
Journal Article
Closed access
NLNuria Losada
Nuria Losada
GBGeorge Bosilca
George Bosilca
ABAurélien Bouteiller
Aurélien Bouteiller
PGPatricia González
Patricia González
MMMaría J. Martín
María J. Martín

27 May 2019 in The International Journal of High Performance Computing Applications
Verified
Journal Article
Closed access
PDF file
CPChristian Ponte-Fernández
Christian Ponte-Fernández
JGJorge González-Domínguez
Jorge González-Domínguez
MMMaría J. Martín
María J. Martín
Genome-Wide Association Studies (GWASs), analyses that try to find a link between a given phenotype (such as a disease) and genetic markers, have been growing in popularity in the recent years. Relations between phenotypes and genotypes are not easy to identify, as most of the phenotypes are a product of the interaction between multiple genes, a phenomenon known as epistasis. Many authors have resorted to different approaches and hardware architectures in order to mitigate the exponential time complexity of the problem. However, these studies make some compromises in order to keep a reasonable execution time, such as limiting the number of genetic markers involved in the interaction, or discarding some of these markers in an initial filtering stage. This work presents MPI3SNP, a tool that implements a three-way exhaustive search for cluster architectures with the aim of mitigating the exponential growth of the run-time. Modern cluster solutions usually incorporate GPUs. Thus, MPI3SNP includes implementations for both multi-CPU and multi-GPU clusters. To contextualize the performance achieved, MPI3SNP is able to analyze an input of 6300 genetic markers and 3200 samples in less than 6 min using 768 CPU cores or 4 min using 8 NVIDIA K80 GPUs. The source code is available at https://github.com/chponte/mpi3snp .

22 January 2016 in The Journal of Supercomputing
Verified
Journal Article
Closed access
PDF file
NLNuria Losada
Nuria Losada
ICIván Cores
Iván Cores
MMMaría J. Martín
María J. Martín
PGPatricia González
Patricia González

1 June 2013 in Annales Academiae Scientiarum Fennicae Mathematica
Verified
Journal Article
Open access
RHRodrigo Hernández
Rodrigo Hernández
MMMaría J. Martín
María J. Martín