Josep Maria Perez

Josep Maria Perez

Auto-generated profile, based on publicly available information

Josep Maria Perez

Barcelona Supercomputing Center (BSC)

Research Focus & Metrics

Academic Career Length

25Years (2002-Present)

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

Representative Publications

View All Publications
1 September 2008
Verified
Conference Paper
Closed access
JPJosep M. Perez
Josep M. Perez
RBRosa M. Badia
Rosa M. Badia
JLJesus Labarta
Jesus Labarta
Parallel programming on SMP and multi-core architectures is hard. In this paper we present a programming model for those environments based on automatic function level parallelism that strives to be easy, flexible, portable, and performant. Its main trait is its ability to exploit task level parallelism by analyzing task dependencies at run time. We present the programming environment in the context of algorithms from several domains and pinpoint its benefits compared to other approaches. We discuss its execution model and its scheduler. Finally we analyze its performance and demonstrate that it offers reasonable performance without tuning, and that it can rival highly tuned libraries with minimal tuning effort.

1 November 2006
Verified
Conference Paper
Closed access
PBPieter Bellens
Pieter Bellens
JPJosep M. Perez
Josep M. Perez
RBRosa M. Badia
Rosa M. Badia
JLJesus Labarta
Jesus Labarta
In this work we present Cell superscalar (CellSs) which addresses the automatic exploitation of the functional parallelism of a sequential program through the different processing elements of the Cell BE architecture. The focus in on the simplicity and flexibility of the programming model. Based on a simple annotation of the source code, a source to source compiler generates the necessary code and a runtime library exploits the existing parallelism by building at runtime a task dependency graph. The runtime takes care of the task scheduling and data handling between the different processors of this heterogeneous architecture. Besides, a locality-aware task scheduling has been implemented to reduce the overhead of data transfers. The approach has been implemented and tested with a set of examples and the results obtained since now are promising

1 September 2007 in IBM Journal of Research and Development
Verified
Journal Article
Closed access
JPJ. M. Perez
J. M. Perez
PBP. Bellens
P. Bellens
RBR. M. Badia
R. M. Badia
JLJ. Labarta
J. Labarta

22 July 2009 in Concurrency and Computation: Practice and Experience
Verified
Journal Article
Closed access
PDF file
RBRosa M. Badia
Rosa M. Badia
JHJosé R. Herrero
José R. Herrero
JLJesús Labarta
Jesús Labarta
JPJosep M. Pérez
Josep M. Pérez
EQEnrique S. Quintana‐Ortí
Enrique S. Quintana‐Ortí
GQGregorio Quintana‐Ortí
Gregorio Quintana‐Ortí

1 January 2006
Verified
Conference Paper
Open access
PDF file
PBPieter Bellens
Pieter Bellens
JPJosep M. Perez
Josep M. Perez
RBRosa M. Badia
Rosa M. Badia
JLJesus Labarta
Jesus Labarta

5 June 2010 in International Journal of Parallel Programming
Verified
Journal Article
Closed access
PDF file
EAEduard Ayguadé
Eduard Ayguadé
RBRosa M. Badia
Rosa M. Badia
PBPieter Bellens
Pieter Bellens
DCDaniel Cabrera
Daniel Cabrera
ADAlejandro Duran
Alejandro Duran
EQEnrique S. Quintana-Ortí
Enrique S. Quintana-Ortí