Xavier Martorell

Prof. Xavier Martorell

orcid

Research Focus & Metrics

Academic Career Length

31Years (1996-Present)

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

Representative Publications

View All Publications
1 June 2011 in Parallel Processing Letters
Verified
Journal Article
Closed access
ADAlejandro Duran
Alejandro Duran
EAEduard Ayguadé
Eduard Ayguadé
RBRosa M. Badia
Rosa M. Badia
JLJesús Labarta
Jesús Labarta
LMLuis Martinell
Luis Martinell
JPJudit Planas
Judit Planas

1 September 2009
Verified
Conference Paper
Closed access
ADAlejandro Duran
Alejandro Duran
XTXavier Teruel
Xavier Teruel
RFRoger Ferrer
Roger Ferrer
XMXavier Martorell
Xavier Martorell
EAEduard Ayguadé
Eduard Ayguadé
Traditional parallel applications have exploited regular parallelism, based on parallel loops. Only a few applications exploit sections parallelism. With the release of the new OpenMP specification (3.0), this programming model supports tasking. Parallel tasks allow the exploitation of irregular parallelism, but there is a lack of benchmarks exploiting tasks in OpenMP. With the current (and projected) multicore architectures that offer many more alternatives to execute parallel applications than traditional SMP machines, this kind of parallelism is increasingly important. And so, the need to have some set of benchmarks to evaluate it. In this paper, we motivate the need of having such a benchmarks suite, for irregular and/or recursive task parallelism. We present our proposal, the Barcelona OpenMP Tasks Suite (BOTS), with a set of applications exploiting regular and irregular parallelism, based on tasks. We present an overall evaluation of the BOTS benchmarks in an Altix system and we discuss some of the different experiments that can be done with the different compilation and runtime alternatives of the benchmarks.

1 May 2012
Verified
Conference Paper
Closed access
JBJavier Bueno
Javier Bueno
JPJudit Planas
Judit Planas
ADAlejandro Duran
Alejandro Duran
RBRosa M. Badia
Rosa M. Badia
XMXavier Martorell
Xavier Martorell
JLJesus Labarta
Jesus Labarta
Clusters of GPUs are emerging as a new computational scenario. Programming them requires the use of hybrid models that increase the complexity of the applications, reducing the productivity of programmers. We present the implementation of OmpSs for clusters of GPUs, which supports asynchrony and heterogeneity for task parallelism. It is based on annotating a serial application with directives that are translated by the compiler. With it, the same program that runs sequentially in a node with a single GPU can run in parallel in multiple GPUs either local (single node) or remote (cluster of GPUs). Besides performing a task-based parallelization, the runtime system moves the data as needed between the different nodes and GPUs minimizing the impact of communication by using affinity scheduling, caching, and by overlapping communication with the computational task. We show several applications programmed with OmpSs and their performance with multiple GPUs in a local node and in remote nodes. The results show good tradeoff between performance and effort from the programmer.

20 June 2005
Verified
Conference Paper
Open access
PDF file
GAGeorge Almási
George Almási
PHPhilip Heidelberger
Philip Heidelberger
CACharles J. Archer
Charles J. Archer
XMXavier Martorell
Xavier Martorell
CEC. Chris Erway
C. Chris Erway
YZYili Zheng
Yili Zheng

2 June 2010
Verified
Conference Paper
Open access
PDF file
RBRamon Bertran
Ramon Bertran
MGMarc Gonzalez
Marc Gonzalez
XMXavier Martorell
Xavier Martorell
NNNacho Navarro
Nacho Navarro
EAEduard Ayguadé
Eduard Ayguadé

1 July 2013 in Computers & Fluids
Verified
Journal Article
Closed access
PDP. Dadvand
P. Dadvand
Riccardo RossiRiccardo Rossi
Riccardo Rossi
MGM. Gil
M. Gil
XMXavier Martorell
Xavier Martorell
JCJ. Cotela
J. Cotela
EOE. Oñate
E. Oñate